skip to main content
10.1145/2390045.2390067acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

HMGraph OLAP: a novel framework for multi-dimensional heterogeneous network analysis

Authors Info & Claims
Published:02 November 2012Publication History

ABSTRACT

As information continues to grow at an explosive rate, more and more heterogeneous network data sources are coming into being. While OLAP (On-Line Analytical Processing) techniques have been proven effective for analyzing and mining structured data, unfortunately, to our best knowledge, there are no OLAP tools available that are able to analyze multi-dimensional heterogeneous networks from different perspectives and with multiple granularities. Therefore, we have developed a novel HMGraph OLAP (Heterogeneous and Multi-dimensional Graph OLAP) framework for the purpose of providing more dimensions and operations to mine multi-dimensional heterogeneous information network. After information dimensions and topological dimensions, we have been the first to propose entity dimensions, which represent an important dimension for heterogeneous network analysis. On the basis of this notion, we designed HMGraph OLAP operations named (Rotate and Stretch for entity dimensions, which are able to mine relationships between different entities. We then proposed the HMGraph Cube, which is an efficient data warehousing model for HMGraph OLAP. In addition, through comparison with common strategies, we have shown that the optimizations we have proposed deliver better performance. Finally, we have implemented a HMGraph OLAP prototype, LiterMiner, which has proven effective for the analysis of multi-dimensional heterogeneous networks.

References

  1. K. S. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In SIGMOD, pages 359--370, 199. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Burdick, A. Doan, R. Ramakrishnan, and S. Vaithyanathan. Olap over imprecise data with domain constraints. In VLDB, pages 39--50, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Chaudhuri and U. Dayal. An overview of data warehousing and olap technology. 26(1):65--74, March 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Chen, X. Yan, Z. Feida, J. Han, and P. S.Yu. Graph olap: Towards online analytical processing on graphs. In ICDM'08, pages 103--112, Dec 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Chen, X. Yan, Z. Feida, J. Han, and P. S. Yu. Grapholap: a multi-dimentional framework for graph data analysis. Knowledge and Information System, 21(1):41--63, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In SIGMOD'96, volume 25, pages 205--216, June 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Li, P. S.Yu, L. Zhao, Y. Xie, and W. Lin. Infonetolaper : Integrating infonetwarehouse and infonetcube with infonetolap. In VLDB'11, volume 4, pages 1422--1425, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Li, L. Zhao, C. Tang, Y. Chen, J. Li, X. Zhao, and X. Liu. Modeling, design and implementation of graph olaping. Journal of Software, 22 (2):258--268, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  9. X. Li, J. Han, and H. Gonzalez. High-dimensional olap: a minimal cubing approach. In VLDB, pages 528--539, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. X. Li, J. Han, and H. Gonzalez. High-dimensional olap: A minimal cubing approach. In VLDB'04, volume 30, pages 528--539, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. K. Morfonios, S. Konakas, Y. Ioannidis, and N. Kotsis. Rolap implementations of the data cube. In ACM Computing Surveys, volume 4, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Q. Qu, F. Zhu, X. Yan, J. Han, P. S. Yu, and H. Li. Efficient topological olap on information networks. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, pages 389--403, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu. Pathsim: Meta path-based top-k similarity search in heterogeneous information. In VLDB'11, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Sun, B. Norick, J. Han, X. Yan, P. S. Yu, and X. Yu. Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In KDD'12, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Y. Sun, T. Wu, Z. Yin, H. Cheng, J. Han, and X. Yin. Bibnetminer: Mining bibliographic information networks. In SIGMOD'08, pages 1341--1344, June 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. W. wei. Complex network virtualization and link olap. 2007.Google ScholarGoogle Scholar
  17. P. Zhao, X. Li, D. Xin, and J. Han. Graph cube: On warehousing and olap multidimensional networks. In SIGMOD'11, pages 12--16, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. HMGraph OLAP: a novel framework for multi-dimensional heterogeneous network analysis

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          DOLAP '12: Proceedings of the fifteenth international workshop on Data warehousing and OLAP
          November 2012
          154 pages
          ISBN:9781450317214
          DOI:10.1145/2390045

          Copyright © 2012 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 2 November 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate29of79submissions,37%

          Upcoming Conference

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader