Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1989323.1989413acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Graph cube: on warehousing and OLAP multidimensional networks

Published: 12 June 2011 Publication History

Abstract

We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming the so-called multidimensional networks. Data warehouses and OLAP (Online Analytical Processing) technology have proven to be effective tools for decision support on relational data. However, they are not well-equipped to handle the new yet important multidimensional networks. In this paper, we introduce Graph Cube, a new data warehousing model that supports OLAP queries effectively on large multidimensional networks. By taking account of both attribute aggregation and structure summarization of the networks, Graph Cube goes beyond the traditional data cube model involved solely with numeric value based group-by's, thus resulting in a more insightful and structure-enriched aggregate network within every possible multidimensional space. Besides traditional cuboid queries, a new class of OLAP queries, crossboid, is introduced that is uniquely useful in multidimensional networks and has not been studied before. We implement Graph Cube by combining special characteristics of multidimensional networks with the existing well-studied data cube techniques. We perform extensive experimental studies on a series of real world data sets and Graph Cube is shown to be a powerful and efficient tool for decision support on large multidimensional networks.

References

[1]
C. C. Aggarwal and H. Wang. Managing and Mining Graph Data. Springer, 2010.
[2]
T. Baird. The Truth About Facebook. Emereo Pty Limited, 2009.
[3]
D. Burdick, A. Doan, R. Ramakrishnan, and S. Vaithyanathan. OLAP over imprecise data with domain constraints. In VLDB, pages 39--50, 2007.
[4]
S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. SIGMOD Rec., 26(1):65--74, 1997.
[5]
C. Chen, X. Yan, F. Zhu, J. Han, and P. S. Yu. Graph OLAP: Towards online analytical processing on graphs. In ICDM, pages 103--112, 2008.
[6]
D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721--732, 2005.
[7]
J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Min. Knowl. Discov., 1(1):29--53, 1997.
[8]
P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. In VLDB, pages 311--322, 1995.
[9]
J. Han, Y. Chen, G. Dong, J. Pei, B. W. Wah, J. Wang, and Y. D. Cai. Stream cube: An architecture for multi-dimensional analysis of data streams. Distrib. Parallel Databases, 18(2):173--197, 2005.
[10]
V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In SIGMOD, pages 205--216, 1996.
[11]
H. Karloff and M. Mihail. On the complexity of the view-selection problem. In PODS, pages 167--173, 1999.
[12]
K. LeFevre and E. Terzi. GraSS: Graph structure summarization. In SDM, pages 454--465, 2010.
[13]
J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD, pages 631--636, 2006.
[14]
X. Li, J. Han, and H. Gonzalez. High-dimensional OLAP: a minimal cubing approach. In VLDB, pages 528--539, 2004.
[15]
C. X. Lin, B. Ding, J. Han, F. Zhu, and B. Zhao. Text cube: Computing IR measures for multidimensional text database analysis. In ICDM, pages 905--910, 2008.
[16]
E. Lo, B. Kao, W.-S. Ho, S. D. Lee, C. K. Chui, and D. W. Cheung. OLAP on sequence data. In SIGMOD, pages 649--660, 2008.
[17]
K. Morfonios, S. Konakas, Y. Ioannidis, and N. Kotsis. ROLAP implementations of the data cube. ACM Comput. Surv., 39(4):12, 2007.
[18]
S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD, pages 419--432, 2008.
[19]
S. Navlakha, M. C. Schatz, and C. Kingsford. Revealing biological modules via graph summarization. Journal of Computational Biology, 16:253--264, 2009.
[20]
M. Newman. Networks: An Introduction. Oxford University Press, 2010.
[21]
Y. Qi, K. S. Candan, J. Tatemura, S. Chen, and F. Liao. Supporting OLAP operations over imperfectly integrated taxonomies. In SIGMOD, pages 875--888, 2008.
[22]
H. Thomases. Twitter Marketing: An Hour a Day. Wiley, 2010.
[23]
Y. Tian, R. A. Hankins, and J. Patel. Efficient aggregation for graph summarization. In SIGMOD, pages 567--580, 2008.
[24]
M. Wattenberg. Visual exploration of multivariate graphs. In CHI, pages 811--819, 2006.
[25]
N. Zhang, Y. Tian, and J. M. Patel. Discovery-driven graph summarization. In ICDE, pages 880--891, 2010.
[26]
Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718--729, 2009.

Cited By

View all
  • (2024)The GraphTempo Framework for Exploring the Evolution of a Graph Through Pattern AggregationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.341064736:11(7143-7156)Online publication date: Nov-2024
  • (2024)Multithreading Heterogeneous Graph AggregationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3320127(1-15)Online publication date: 2024
  • (2024)A Comprehensive Survey on Graph Summarization With Graph Neural NetworksIEEE Transactions on Artificial Intelligence10.1109/TAI.2024.33505455:8(3780-3800)Online publication date: Aug-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
June 2011
1364 pages
ISBN:9781450306614
DOI:10.1145/1989323
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. OLAP
  2. data cube
  3. data warehouse
  4. graph cube
  5. multidimensional network

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)46
  • Downloads (Last 6 weeks)5
Reflects downloads up to 14 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)The GraphTempo Framework for Exploring the Evolution of a Graph Through Pattern AggregationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.341064736:11(7143-7156)Online publication date: Nov-2024
  • (2024)Multithreading Heterogeneous Graph AggregationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3320127(1-15)Online publication date: 2024
  • (2024)A Comprehensive Survey on Graph Summarization With Graph Neural NetworksIEEE Transactions on Artificial Intelligence10.1109/TAI.2024.33505455:8(3780-3800)Online publication date: Aug-2024
  • (2024)Unifying Faceted Search and Analytics over RDF Knowledge GraphsKnowledge and Information Systems10.1007/s10115-024-02076-966:7(3921-3958)Online publication date: 24-Mar-2024
  • (2023)A Brief Survey of Methods for Analytics over RDF Knowledge GraphsAnalytics10.3390/analytics20100042:1(55-74)Online publication date: 17-Jan-2023
  • (2023)Temporal Graph CubeIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.327046035:12(13015-13030)Online publication date: 1-Dec-2023
  • (2023)New Strategy for Developing and Enhancing Online Analytical Processing Cubes on Graphs2023 14th International Conference on Intelligent Systems: Theories and Applications (SITA)10.1109/SITA60746.2023.10373687(1-8)Online publication date: 22-Nov-2023
  • (2023)Pretrained Node-Enhanced Graph Pruning Network for Inductive Link Prediction2023 China Automation Congress (CAC)10.1109/CAC59555.2023.10451319(8952-8957)Online publication date: 17-Nov-2023
  • (2022)Effective and efficient aggregation on uncertain graphsFuzzy Sets and Systems10.1016/j.fss.2021.07.017446(261-276)Online publication date: Oct-2022
  • (2021)OLGAVis: On-Line Graph Analysis and Visualization for Bibliographic Information NetworkApplied Sciences10.3390/app1109386211:9(3862)Online publication date: 24-Apr-2021
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media