Mining graph patterns efficiently via randomized summaries
Proceedings of the VLDB Endowment
Mining Heterogeneous Information Networks by Exploring the Power of Links
DS '09 Proceedings of the 12th International Conference on Discovery Science
Building data warehouses with semantic data
Proceedings of the 2010 EDBT/ICDT Workshops
Multidimensional cyclic graph approach: Representing a data cube without common sub-graphs
Information Sciences: an International Journal
Graph cube: on warehousing and OLAP multidimensional networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient topological OLAP on information networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Compression of weighted graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph-based data warehousing using the core-facets model
ICDM'11 Proceedings of the 11th international conference on Advances in data mining: applications and theoretical aspects
Business intelligence on complex graph data
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Network compression by node and edge mergers
Bisociative Knowledge Discovery
Mining knowledge from interconnected data: a heterogeneous information network analysis approach
Proceedings of the VLDB Endowment
HMGraph OLAP: a novel framework for multi-dimensional heterogeneous network analysis
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
A framework and a language for on-line analytical processing on graphs
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Mining heterogeneous information networks: a structural analysis approach
ACM SIGKDD Explorations Newsletter
SynopSys: large graph analytics in the SAP HANA database through summarization
First International Workshop on Graph Data Management Experiences and Systems
OLAPing social media: the case of Twitter
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
| Hi-index | 0.00 |
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need to deploy graph analysis from different perspectives and with multiple granularities. However, traditional OLAP technology cannot handle such demands because it does not consider the links among individual data tuples. In this paper, we develop a novel graph OLAP framework, which presents a multi-dimensional and multi-level view over graphs. The contributions of this work are two-fold. First, starting from basic definitions, i.e., what are dimensions and measures in the graph OLAP scenario, we develop a conceptual framework for data cubes on graphs. We also look into different semantics of OLAP operations, and classify the framework into two major subcases: informational OLAP and topological OLAP. Then, with more emphasis on informational OLAP (topological OLAP will be covered in a future study due to the lack of space), we show how a graph cube can be materialized by calculating a special kind of measure called aggregated graph and how to implement it efficiently. This includes both full materialization and partial materialization where constraints are enforced to obtain an iceberg cube. We can see that the aggregated graphs, which depend on the graph properties of underlying networks, are much harder to compute than their traditional OLAP counterparts, due to the increased structural complexity of data. Empirical studies show insightful results on real datasets and demonstrate the efficiency of our proposed optimizations.