Abstract
A graph stream is a kind of dynamic graph representation that consists of a consecutive sequence of edges where each edge is represented by two endpoints and a weight. Graph stream is widely applied in many application scenarios to describe the relationships in social networks, communication networks, academic collaboration networks, etc. Graph sketch mechanisms were proposed to summarize large-scale graphs by compact data structures with hash functions to support fast queries in a graph stream. However, the existing graph sketches use fixed-size memory and inevitably suffer from dramatic performance drops after a massive number of edge updates. In this paper, we propose a novel Dynamic Graph Sketch (DGS) mechanism, which is able to adaptively extend graph sketch size to mitigate the performance degradation caused by memory overload. The proposed DGS mechanism incorporates deep neural network structures with graph sketch to actively detect the query errors, and dynamically expand the memory size and hash space of a graph sketch to keep the error below a pre-defined threshold. We conducted extensive experiments on three real-world graph stream datasets, which show that DGS outperforms the state-of-the-arts with regard to the accuracy of different kinds of graph queries.
This work was partially supported by the National Key R&D Program of China (Grant No. 2018YFB1004704), the National Natural Science Foundation of China (Grant Nos. 61972196, 61832008, 61832005), the Key R&D Program of Jiangsu Province, China (Grant No. BE2018116), the science and technology project from State Grid Corporation of China (Contract No. SGJSXT00XTJS2100049), and the Collaborative Innovation Center of Novel Software Technology and Industrialization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693–703. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45465-9_59
Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58–75 (2005)
Estan, C., Varghese, G.: New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst. 21(3), 270–313 (2003)
Gou, X., Zou, L., Zhao, C., Yang, T.: Fast and accurate graph stream summarization. In: 35th IEEE International Conference on Data Engineering (ICDE 2019), pp. 1118–1129 (2019)
Guo, Y., et al.: Closed-loop matters: dual regression networks for single image super-resolution. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 5406–5415 (2020)
Hsu, C., Indyk, P., Katabi, D., Vakilian, A.: Learning-based frequency estimation algorithms. In: 7th International Conference on Learning Representations (ICLR 2019) (2019)
Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20(4), 422–446 (2002)
Khan, A., Aggarwal, C.C.: Query-friendly compression of graph streams. In: Kumar, R., Caverlee, J., Tong, H. (eds.) 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2016), pp. 130–137 (2016)
Liu, L., et al.: Sf-sketch: a two-stage sketch for data streams. IEEE Trans. Parallel Distrib. Syst. 31(10), 2263–2276 (2020)
Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. In: Annual Conference on Neural Information Processing Systems (NeurIPS 2019), pp. 8024–8035 (2019)
Shi, W., et al.: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1874–1883 (2016)
Tang, L., Huang, Q., Lee, P.P.C.: Mv-sketch: a fast and compact invertible sketch for heavy flow detection in network data streams. In: IEEE Conference on Computer Communications (INFOCOM 2019), pp. 2026–2034 (2019)
Tang, N., Chen, Q., Mitra, P.: Graph stream summarization: from big bang to big crunch. In: Proceedings of the 2016 International Conference on Management of Data (SIGMOD 2016), pp. 1481–1496 (2016)
Zhang, M., Wang, H., Li, J., Gao, H.: Learned sketches for frequency estimation. Inf. Sci. 507, 365–385 (2020)
Zhao, P., Aggarwal, C.C., Wang, M.: gSketch: on query estimation in graph streams. Proc. VLDB Endow. 5(3), 193–204 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, D., Li, W., Chen, Y., Lin, M., Lu, S. (2021). Learning-Based Dynamic Graph Stream Sketch. In: Karlapalem, K., et al. Advances in Knowledge Discovery and Data Mining. PAKDD 2021. Lecture Notes in Computer Science(), vol 12712. Springer, Cham. https://doi.org/10.1007/978-3-030-75762-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-75762-5_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-75761-8
Online ISBN: 978-3-030-75762-5
eBook Packages: Computer ScienceComputer Science (R0)