Abstract
In rapid and massive graph streams, it is often impractical to store and process the entire graph. Lossless graph summarization as a compression technique can provide a succinct graph representation without losing information. However, the problem of lossless streaming graph summarization is computationally and technically challenging. Although the state-of-the-art method performs well with respect to efficiency, its summarization quality is usually unstable and unsatisfactory. This is because it is a randomized algorithm and depends heavily on the pre-tuned parameters. In this paper, we propose a parameter-free lossless streaming graph summarization algorithm. As the graph changes over time, we incrementally maintain the summarization result, by carefully exploring the influenced subgraph, which is shown to be a bounded neighborhood of the inserted edge. To enhance the performance of our method, we further propose two optimization techniques regarding candidate supernodes refinement and destination supernode selection. The experiment results demonstrate that the proposed methods outperform the state-of-the-art by a large margin in terms of compression quality with comparable running time on the majority of datasets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gou, X., Zou, L., Zhao, C., Yang, T.: Fast and accurate graph stream summarization. In: ICDE (2019)
Ko, J., Kook, Y., Shin, K.: Incremental lossless graph summarization. In: SIGKDD (2020)
Koutra, D., Vreeken, J., Bonchi, F.: Summarizing graphs at multiple scales: new trends. In: ICDM (2018)
Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. ACM Comput. Surv. (CSUR) 51(3), 1–34 (2018)
Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD (2008)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)
Shin, K., Ghoting, A., Kim, M., Raghavan, H.: Sweg: lossless and lossy summarization of web-scale graphs. In: WWW (2019)
Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD (2008)
Tsalouchidou, I., Bonchi, F., Morales, G.D.F., Baeza-Yates, R.: Scalable dynamic graph summarization. TKDE 32(2), 360–373 (2020)
Yang, J., Zhang, W., Wang, X., Zhang, Y., Lin, X.: Distributed streaming set similarity join. In: ICDE (2020)
Acknowledgment
This research was supported in part by National Key Research and Development Program of China (2018YFB0204302), and NSFC (Grant No. 62002108, 61772182, 61802032, 61872134).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Ma, Z., Yang, J., Li, K., Liu, Y., Zhou, X., Hu, Y. (2021). A Parameter-Free Approach for Lossless Streaming Graph Summarization. In: Jensen, C.S., et al. Database Systems for Advanced Applications. DASFAA 2021. Lecture Notes in Computer Science(), vol 12681. Springer, Cham. https://doi.org/10.1007/978-3-030-73194-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-73194-6_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73193-9
Online ISBN: 978-3-030-73194-6
eBook Packages: Computer ScienceComputer Science (R0)