Modeling, design and implementation of graph OLAPing

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a series of models and algorithms to implement OLAPing on graph data. The major contributions include (1) proposing a graph-oriented data warehouse model, called a double star model, (2) proposing the concept of graph data cube and its building algorithm, (3) designing an informational OLAPing algorithm, I-OLAPing, (4) designing topological dimensional OLAPing algorithm, T-OLAPing, and (5) building a Graph OLAPing prototype, Graph OLAPer1.0, based on the proposed approaches. Experimental results show that the Graph OLAPing algorithms designed and implemented in this paper, together with Graph OLAPing prototype, Graph OLAPer1.0 can work effectively on Co-Author Networks. © 2011 ISCAS.

Author supplied keywords

Cite

CITATION STYLE

APA

Li, C., Zhao, L., Tang, C. J., Chen, Y., Li, J., Zhao, X. M., & Liu, X. L. (2011). Modeling, design and implementation of graph OLAPing. Ruan Jian Xue Bao/Journal of Software, 22(2), 258–268. https://doi.org/10.3724/SP.J.1001.2011.03771

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free