Advertisement

Towards Graph Summary and Aggregation: A Survey

  • Jinguo YouEmail author
  • Qiuping Pan
  • Wei Shi
  • Zhipeng Zhang
  • Jianhua Hu
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 387)

Abstract

To obtain the insight in a single large graph and to save the space consumption for graph mining, the graph summary transforms the input graph into an aggregated concise super-graph represented by supernodes and superedges. In this paper, we investigate current algorithms of the graph summary and aggregation. We provide the classification of them in terms of partition criterion or information lossless. Further, the main graph summary algorithms are compared and discussed in detail. In the end, we give the challenges and future works.

Keywords

Graphs Networks Summarization Aggregation 

Notes

Acknowledgments

This work is supported by the Natural Science Foundation of Yunnan Province, China (2010ZC030) and is partially done when the author(s) visited Sa-Shixuan International Research Centre for Big Data Management and Analytics hosted in Renmin University of China. This Center is partially funded by a Chinese National “111” Project “Attracting International Talents in Data Engineering and Knowledge Engineering Research”.

References

  1. 1.
    Aggarwal, C., Wang, H.: Managing and Mining Graph Data. Springer, New York (2010)CrossRefzbMATHGoogle Scholar
  2. 2.
    Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv. 38(1), 2 (2006)CrossRefGoogle Scholar
  3. 3.
    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. KDD’05: Proceedings of the 11th ACM SIGKDD, pp. 177–187. ACM, New York (2005)Google Scholar
  4. 4.
    S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In: Proceedings of the 2008 ACM-SIGMOD International Conference Management of Data (SIGMOD’08), Vancouver, Canada, pp. 419–432, June 2008Google Scholar
  5. 5.
    Adler, M., Mitzenmacher, M: Towards compressing web graphs. In: Data Compression Conference, pp. 203–212 (2001)Google Scholar
  6. 6.
    Boldi, P., Vigna, S.: The webgraph framework i: Compression techniques. In: WWW, pp. 595–602 (2004)Google Scholar
  7. 7.
    Suel, T., Yuan, J.: Compressing the graph structure of the web. In: Data Compression Conference, pp. 213–222 (2001)Google Scholar
  8. 8.
    Raghavan, S., Garcia-Molina, H.: Representing the webgraphs. In: ICDE, pp. 405–416 (2003)Google Scholar
  9. 9.
    Toivonen, H., et al.: Compression of weighted graphs. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM (2011)Google Scholar
  10. 10.
    Zhou, F.: Methods for network abstraction. University of Helsinki, Helsinki (2012)Google Scholar
  11. 11.
    LeFevre, K., Terzi, E.: GraSS: graph structure summarization. In: SDM 2010, pp. 454–465 (2010)Google Scholar
  12. 12.
    Liu, Z., Yu, J.X.: On summarizing graph homogeneously. In: Database Systems for Advanced Applications, pp. 299–310 (2011)Google Scholar
  13. 13.
    Liu, Z., Yu, J.X., Cheng, H.: Approximate homogeneous graph summarization. JIP 20(1), 77–88 (2011)Google Scholar
  14. 14.
    Yin, D., Gao, H., Zou, Z.: A novel efficient graph aggregation algorithm. J. Comput. Res. Devel. 48(10) (2011) Google Scholar
  15. 15.
    Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM-SIGMOD International Conference Management of Data (SIGMOD’08), pp. 567–580, Vancouver, Canada, June 2008Google Scholar
  16. 16.
    Tian, Y., Patel, J.M.: Interactive graph summarization. In: Yu, P.S., Han, J., Faloutsos, C. (eds.) Link Mining: Models, Algorithms, and Applications, pp. 389–409. Springer, New York (2010)CrossRefGoogle Scholar
  17. 17.
    Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.S.: Graph OLAP: towards online analytical processing on graphs. In: ICDM, pp. 103–112 (2008)Google Scholar
  18. 18.
    Li, C., Yu, P.S., Zhao, L., Xie, Y., Lin, W.: InfoNetOLAPer: integrating InfoNetWarehouse and InfoNetCube with InfoNetOLAP. PVLDB 4(12), 1422–1425 (2011)Google Scholar
  19. 19.
    Qu, Q., Zhu, F., Yan, X., Han, J., Yu, P.S., Li, H.: Efficient topological OLAP on information networks. In: DASFAA’11, Hong Kong, pp. 389–403, April 2011Google Scholar
  20. 20.
    Li, C., Zhao, L., Tang, C.J., Chen, Y., et al.: Modeling, design and implementation of graph OLAPing. J. Softw. 22(2), 258–268 (2011)CrossRefGoogle Scholar
  21. 21.
    Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and OLAP multidimensional networks. In: SIGMOD’11, 12–16 June 2011Google Scholar
  22. 22.
    Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE). IEEE (2010)Google Scholar
  23. 23.
    Rodrigues, J.F., Triana, J.M., Faloutos, C., Triana Jr., C.: SuperGraph visualization. In: Proceedings of the 8th IEEE International Symposium on Multimedia, pp. 227–234 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jinguo You
    • 1
    Email author
  • Qiuping Pan
    • 1
  • Wei Shi
    • 2
  • Zhipeng Zhang
    • 1
  • Jianhua Hu
    • 1
  1. 1.School of Information Engineering and AutomationKunming University of Science and TechnologyKunmingChina
  2. 2.Department of ComputerXidian UniversityXi’anChina

Personalised recommendations