{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T12:51:22Z","timestamp":1768481482968,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:00:00Z","timestamp":1683244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:00:00Z","timestamp":1683244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Major Key Project of PCL","award":["PCL2022A03"],"award-info":[{"award-number":["PCL2022A03"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002108"],"award-info":[{"award-number":["62002108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11280-023-01165-z","type":"journal-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T09:03:22Z","timestamp":1683277402000},"page":"2647-2667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Persistent graph stream summarization for real-time graph analytics"],"prefix":"10.1007","volume":"26","author":[{"given":"Yan","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoquan","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiyun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianye","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,5]]},"reference":[{"key":"1165_CR1","doi-asserted-by":"crossref","unstructured":"Adhikari, B., Zhang, Y., Bharadwaj, A., Prakash, B.A.: Condensing temporal networks using propagation. In: SDM. (2017)","DOI":"10.1137\/1.9781611974973.47"},{"key":"1165_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, K., Guha, S., Mcgregor, A.: Graph sketches sparsification, spanners, and subgraphs. In: PODS \u201912. (2012)","DOI":"10.1145\/2213556.2213560"},{"key":"1165_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K.C., Farach-Colton, M.: Finding frequent items in data streams. In: Theor. Comput. Sci. (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"key":"1165_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.14778\/1453856.1453884","volume":"1","author":"E Cohen","year":"2008","unstructured":"Cohen, E., Kaplan, H.: Tighter estimation using bottom k sketches. Proc. VLDB Endow. 1, 213\u2013224 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"1165_CR5","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary the count-min sketch and its applications. In: J. Algorithms. (2005)","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"1165_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Space efficient mining of multigraph streams. In: PODS \u201905. (2005)","DOI":"10.1145\/1065167.1065201"},{"key":"1165_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"JR Driscoll","year":"1986","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38, 86\u2013124 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"1165_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00778-022-00731-7","volume":"32","author":"W Fan","year":"2021","unstructured":"Fan, W., Li, Y., Liu, M., Lu, C.: Making graphs compact by lossless contraction. The Vldb Journal. 32, 49\u201373 (2021)","journal-title":"The Vldb Journal."},{"key":"1165_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, Y., Liu, M., Lu, C.: A hierarchical contraction scheme for querying big graphs. Proceedings of the 2022 International Conference on Management of Data (2022)","DOI":"10.1145\/3514221.3517862"},{"key":"1165_CR10","doi-asserted-by":"crossref","unstructured":"Gou, X., Zou, L., Zhao, C., Yang, T.: Fast and accurate graph stream summarization. 2019 IEEE 35th International Conference on Data Engineering (ICDE). pp. 1118\u20131129 (2019)","DOI":"10.1109\/ICDE.2019.00103"},{"key":"1165_CR11","doi-asserted-by":"crossref","unstructured":"Guha, S., Mcgregor, A.: Graph synopses, sketches, and streams a survey. Proc. VLDB Endow. 5, 2030\u20132031 (2012)","DOI":"10.14778\/2367502.2367570"},{"key":"1165_CR12","doi-asserted-by":"crossref","unstructured":"Hajiabadi, M., Srinivasan, V., Thomo, A.: Dynamic graph summarization optimal and scalable. 2022 IEEE International Conference on Big Data (Big Data). pp. 545\u2013554 (2022)","DOI":"10.1109\/BigData55660.2022.10020422"},{"key":"1165_CR13","doi-asserted-by":"crossref","unstructured":"Ji, Y., Zhang, Z.C., Tang, X., Shen, J., Zhang, X., Yang, G.Y.: Detecting cash-out users via dense subgraphs. Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2022)","DOI":"10.1145\/3534678.3539252"},{"key":"1165_CR14","doi-asserted-by":"crossref","unstructured":"Khan, A., Aggarwal, C.C.: Query-friendly compression of graph streams. 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). pp. 130\u2013137 (2016)","DOI":"10.1109\/ASONAM.2016.7752224"},{"key":"1165_CR15","doi-asserted-by":"crossref","unstructured":"Ko, J., Kook, Y., Shin, K.: Incremental lossless graph summarization. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2020)","DOI":"10.1145\/3394486.3403074"},{"key":"1165_CR16","doi-asserted-by":"crossref","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: KDD \u201906 (2006)","DOI":"10.1145\/1150402.1150476"},{"key":"1165_CR17","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect the koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web. pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"1165_CR18","doi-asserted-by":"crossref","unstructured":"Lee, K., Jo, H., Ko, J., Lim, S., Shin, K.: Ssumm sparse summarization of massive graphs. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2020)","DOI":"10.1145\/3394486.3403057"},{"key":"1165_CR19","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11280-021-00927-x","volume":"25","author":"Z Ma","year":"2021","unstructured":"Ma, Z., Liu, Y., Hu, Y., Yang, J., Liu, C., Dai, H.: Efficient maintenance for maximal bicliques in bipartite graph streams. World Wide Web. 25, 857\u2013877 (2021)","journal-title":"World Wide Web."},{"key":"1165_CR20","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ins.2021.12.116","volume":"589","author":"Z Ma","year":"2022","unstructured":"Ma, Z., Liu, Y., Yang, Z., Yang, J., Li, K.: A parameter-free approach tolossless summarization of fully dynamic graphs. Inf. Sci. 589, 376\u2013394 (2022)","journal-title":"Inf. Sci."},{"key":"1165_CR21","doi-asserted-by":"crossref","unstructured":"Ma, Z., Yang, J., Li, K., Liu, Y., Zhou, X., Hu, Y.: A parameter-free approach for lossless streaming graph summarization. In: DASFAA. (2021)","DOI":"10.1007\/978-3-030-73194-6_26"},{"key":"1165_CR22","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.14778\/2367502.2367508","volume":"5","author":"GS Manku","year":"2002","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. Proc. VLDB Endow. 5, 1699 (2002)","journal-title":"Proc. VLDB Endow."},{"key":"1165_CR23","doi-asserted-by":"publisher","first-page":"602","DOI":"10.14778\/3377369.3377371","volume":"13","author":"D Ouyang","year":"2020","unstructured":"Ouyang, D., Yuan, L., Qin, L., Chang, L., Zhang, Y., Lin, X.: Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. Proceedings of the VLDB Endowment. 13, 602\u2013615 (2020)","journal-title":"Proceedings of the VLDB Endowment."},{"key":"1165_CR24","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the tenth ACM international conference on web search and data mining. pp. 601\u2013610 (2017)","DOI":"10.1145\/3018661.3018731"},{"key":"1165_CR25","doi-asserted-by":"crossref","unstructured":"Peng, Y., Guo, J., Li, F., Qian, W., Zhou, A.: Persistent bloom filter membership testing for the entire history. Proceedings of the 2018 International Conference on Management of Data (2018)","DOI":"10.1145\/3183713.3183737"},{"key":"1165_CR26","doi-asserted-by":"publisher","first-page":"3231","DOI":"10.1109\/TKDE.2016.2601611","volume":"28","author":"Q Qu","year":"2016","unstructured":"Qu, Q., Liu, S., Zhu, F., Jensen, C.S.: Efficient online summarization of large-scale dynamic networks. IEEE Transactions on Knowledge and Data Engineering. 28, 3231\u20133245 (2016)","journal-title":"IEEE Transactions on Knowledge and Data Engineering."},{"key":"1165_CR27","doi-asserted-by":"crossref","unstructured":"Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: Timecrunch interpretable dynamic graph summarization. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2015)","DOI":"10.1145\/2783258.2783321"},{"key":"1165_CR28","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.14778\/3551793.3551803","volume":"15","author":"S Sun","year":"2022","unstructured":"Sun, S., Sun, X., He, B., Luo, Q.: Rapidflow: An efficient approach to continuous subgraph matching. Proc. VLDB Endow. 15, 2415\u20132427 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"1165_CR29","doi-asserted-by":"crossref","unstructured":"Tang, N., Chen, Q., Mitra, P.: Graph stream summarization from big bang to big crunch. Proceedings of the 2016 International Conference on Management of Data (2016)","DOI":"10.1145\/2882903.2915223"},{"key":"1165_CR30","doi-asserted-by":"crossref","unstructured":"Wang, S., Terano, T.: Detecting rumor patterns in streaming social media. 2015 IEEE International Conference on Big Data (Big Data). pp. 2709\u20132715 (2015)","DOI":"10.1109\/BigData.2015.7364071"},{"key":"1165_CR31","doi-asserted-by":"crossref","unstructured":"Wei, Z., Luo, G., Yi, K., Du, X., Wen, J.R.: Persistent data sketching. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (2015)","DOI":"10.1145\/2723372.2749443"},{"key":"1165_CR32","doi-asserted-by":"crossref","unstructured":"Yong, Q., Hajiabadi, M., Srinivasan, V., Thomo, A.: Efficient graph summarization using weighted lsh at billion-scale. Proceedings of the 2021 International Conference on Management of Data (2021)","DOI":"10.1145\/3448016.3457331"},{"key":"1165_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, L., Gao, M., Qian, W., Zhou, A.: Compressing streaming graph data based on triangulation. In: APWeb Workshops (2016)","DOI":"10.1007\/978-3-319-45835-9_15"},{"key":"1165_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2078331.2078335","volume":"5","author":"P Zhao","year":"2012","unstructured":"Zhao, P., Aggarwal, C.C., Wang, M.: gsketch: On query estimation in graph streams. Proc. VLDB Endow. 5, 193\u2013204 (2012)","journal-title":"Proc. VLDB Endow."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-023-01165-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-023-01165-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-023-01165-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T04:17:01Z","timestamp":1696997821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-023-01165-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,5]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1165"],"URL":"https:\/\/doi.org\/10.1007\/s11280-023-01165-z","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,5]]},"assertion":[{"value":"3 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}