Advertisement

Graph Compression with Stars

  • Faming Li
  • Zhaonian ZouEmail author
  • Jianzhong Li
  • Yingshu Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11440)

Abstract

Making massive graph data easily understandable by people is a demanding task in a variety of real applications. Graph compression is an effective approach to reducing the size of graph data as well as its complexity in structures. This paper proposes a simple yet effective graph compression method called the star-based graph compression. This method compresses a graph by shrinking a collection of disjoint subgraphs called stars. Compressing a graph into the optimal star-based compressed graph with the highest compression ratio is shown to be NP-complete. We propose a greedy compression algorithm called StarZip. We experimentally verify that StarZip achieves compression ratios of 3.8–45.7 and 2.9–241.6 in terms of vertex count and edge count, respectively. Besides, we study the shortest path queries on compressed graphs. On the real graphs, the StarSSSP algorithm for processing shortest path queries on compressed graphs is 4X–20X faster than Dijkstra’s algorithm running on original graphs. The average absolute error between the query results of StarSSSP and the exact shortest distances is about 1. On the synthetic graphs, StarSSSP is up to 313X faster than Dijkstra’s algorithm, and the average absolute error is also about 1.

Keywords

Graph compression Star Shortest path 

Notes

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (No. 61532015, No. 61672189, No. 61732003 and No. 61872106) and the National Science Foundation of USA (No. 1741277 and No. 1829674).

References

  1. 1.
    Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD, pp. 631–636 (2006)Google Scholar
  2. 2.
    Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci. 51(2), 261–272 (1995)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: KDD, pp. 965–973 (2011)Google Scholar
  4. 4.
    Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233–235 (1979)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.I.: A greedy approximation for minimum connected dominating sets. Theoret. Comput. Sci. 329(1–3), 325–330 (2004)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http://snap.stanford.edu/data
  7. 7.
    Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SDM, vol. 4, pp. 442–446 (2004)Google Scholar
  8. 8.
    Li, L.: A concordance correlation coefficient to evaluate reproducibility. Biometrics 45(1), 255–268 (1989)CrossRefGoogle Scholar
  9. 9.
    Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD, pp. 567–580 (2008)Google Scholar
  10. 10.
    Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: ICDE, pp. 880–891 (2010)Google Scholar
  11. 11.
    Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD, pp. 419–432 (2008)Google Scholar
  12. 12.
    Ruan, N., Jin, R., Huang, Y.: Distance preserving graph simplification. In: ICDM, pp. 1200–1205 (2011)Google Scholar
  13. 13.
    Bonchi, F., Morales, G.D.F., Gionis, A., Ukkonen, A.: Activity preserving graph simplification. Data Min. Knowl. Disc. 27(3), 321–343 (2013)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: OSDI, pp. 17–30 (2012)Google Scholar
  15. 15.
    Shao, Y., Cui, B., Ma, L.: PAGE: a partition aware engine for parallel graph computation. IEEE Trans. Knowl. Data Eng. 27(2), 518–530 (2015)CrossRefGoogle Scholar
  16. 16.
    Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW, pp. 595–601 (2004)Google Scholar
  17. 17.
    Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: DCC, pp. 203–212 (2001)Google Scholar
  18. 18.
    Apostolico, A., Drovandi, G.: Graph compression by BFS. Algorithms 2(3), 1031–1044 (2009)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: SIGMOD, pp. 157–168 (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Faming Li
    • 1
  • Zhaonian Zou
    • 1
    Email author
  • Jianzhong Li
    • 1
  • Yingshu Li
    • 2
  1. 1.Harbin Institute of TechnologyHarbinChina
  2. 2.Georgia State UniversityAtlantaUSA

Personalised recommendations