Modeling, Design and Implementation of Graph OLAPing

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.

[1]  Ravi Kumar,et al.  Discovering Large Dense Subgraphs in Massive Graphs , 2005, VLDB.

[2]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[3]  Nisheeth Shrivastava,et al.  Graph summarization with bounded error , 2008, SIGMOD Conference.

[4]  Surajit Chaudhuri,et al.  An overview of data warehousing and OLAP technology , 1997, SGMD.

[5]  Jeffrey F. Naughton,et al.  An array-based algorithm for simultaneous multidimensional aggregates , 1997, SIGMOD '97.

[6]  Jignesh M. Patel,et al.  Efficient aggregation for graph summarization , 2008, SIGMOD Conference.

[7]  Tamara Munzner,et al.  TopoLayout: Multilevel Graph Layout by Topological Features , 2007, IEEE Transactions on Visualization and Computer Graphics.

[8]  Christos Faloutsos,et al.  Graph mining: Laws, generators, and algorithms , 2006, CSUR.

[9]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[10]  Ivan Herman,et al.  Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..

[11]  Timos K. Sellis,et al.  A survey of logical models for OLAP databases , 1999, SGMD.

[12]  Raghu Ramakrishnan,et al.  Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.

[13]  Philip S. Yu,et al.  Graph OLAP: Towards Online Analytical Processing on Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[14]  Sriram Raghavan,et al.  Representing Web graphs , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[15]  Ashish Gupta,et al.  Materialized views: techniques, implementations, and applications , 1999 .

[16]  Panos Kalnis,et al.  Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.

[17]  Huapu Lu,et al.  Complexity of public transport networks , 2007 .

[18]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[19]  Jiawei Han,et al.  Mining scale-free networks using geodesic clustering , 2004, KDD.

[20]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.