{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:07:47Z","timestamp":1758280067849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306747"},{"type":"electronic","value":"9783031306754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30675-4_11","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"154-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discovering Persistent Subgraph Patterns over\u00a0Streaming Graphs"],"prefix":"10.1007","author":[{"given":"Chu","family":"Huang","sequence":"first","affiliation":[]},{"given":"Qianzhen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Deke","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y., Kalnis, P.: Incremental frequent subgraph mining on large evolving graphs. In: ICDE 2018, pp. 1767\u20131768 (2018)","DOI":"10.1109\/ICDE.2018.00241"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Aslay, \u00c7., Nasir, M.A.U., Morales, G.D.F., Gionis, A.: Mining frequent patterns in evolving graphs. In: CIKM 2018. pp. 923\u2013932 (2018)","DOI":"10.1145\/3269206.3271772"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Belth, C., Zheng, X., Koutra, D.: Mining persistent activity in continually evolving networks. In: KDD 2020, pp. 934\u2013944 (2020)","DOI":"10.1145\/3394486.3403136"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Z., Wang, X., Wang, C., Li, J.: Explainable link prediction in knowledge hypergraphs. In: CIKM 2022, pp. 262\u2013271 (2022)","DOI":"10.1145\/3511808.3557316"},{"key":"11_CR5","unstructured":"Choudhury, S., Holder, L.B., Jr., G.C., Agarwal, K., Feo, J.: A selectivity based approach to continuous pattern detection in streaming graphs. In: EDBT 2015, pp. 157\u2013168 (2015)"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.14778\/3025111.3025112","volume":"10","author":"H Dai","year":"2016","unstructured":"Dai, H., Shahzad, M., Liu, A.X., Zhong, Y.: Finding persistent items in data streams. Proc. VLDB Endow. 10(4), 289\u2013300 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1007\/978-3-642-05151-7_33","volume-title":"On the Move to Meaningful Internet Systems: OTM 2009","author":"S Hellmann","year":"2009","unstructured":"Hellmann, S., Stadler, C., Lehmann, J., Auer, S.: DBpedia live extraction. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2009. LNCS, vol. 5871, pp. 1209\u20131223. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05151-7_33"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Li, R., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: ICDE 2018, pp. 797\u2013808 (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Li, Y., Zou, L., \u00d6zsu, M.T., Zhao, D.: Time constrained continuous subgraph search over streaming graphs. In: ICDE 2019, pp. 1082\u20131093 (2019)","DOI":"10.1109\/ICDE.2019.00100"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11280-022-01016-3","volume":"26","author":"Z Li","year":"2023","unstructured":"Li, Z., Liu, X., Wang, X., Liu, P., Shen, Y.: Transo: a knowledge-driven representation learning method with ontology information constraints. World Wide Web 26, 297\u2013319 (2023)","journal-title":"World Wide Web"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-030-73194-6_26","volume-title":"Database Systems for Advanced Applications","author":"Z Ma","year":"2021","unstructured":"Ma, Z., Yang, J., Li, K., Liu, Y., Zhou, X., Hu, Y.: A parameter-free approach for lossless streaming graph summarization. In: Jensen, C.S., et al. (eds.) DASFAA 2021. LNCS, vol. 12681, pp. 385\u2013393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73194-6_26"},{"issue":"8","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.14778\/3457390.3457395","volume":"14","author":"S Min","year":"2021","unstructured":"Min, S., Park, S.G., Park, K., Giammarresi, D., Italiano, G.F., Han, W.: Symmetric continuous subgraph matching with bidirectional dynamic programming. Proc. VLDB Endow. 14(8), 1298\u20131310 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"48:1","DOI":"10.1145\/3442590","volume":"15","author":"MAU Nasir","year":"2021","unstructured":"Nasir, M.A.U., Aslay, \u00c7., Morales, G.D.F., Riondato, M.: Tiptap: approximate mining of frequent k-subgraph patterns in evolving graphs. ACM Trans. Knowl. Discov. Data 15(3), 48:1-48:35 (2021)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Pacaci, A., Bonifati, A., \u00d6zsu, M.T.: Regular path query evaluation on streaming graphs. In: SIGMOD Conference 2020, pp. 1415\u20131430 (2020)","DOI":"10.1145\/3318464.3389733"},{"key":"11_CR15","unstructured":"Ray, A., Holder, L., Choudhury, S.: Frequent subgraph discovery in large attributed streaming graphs. In: Proceedings of the 3rd International Workshop on Big Data, vol. 36, pp. 166\u2013181 (2014)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Yang, X., Song, C., Yu, M., Gu, J., Liu, M.: Distributed triangle approximately counting algorithms in simple graph stream. ACM Trans. Knowl. Discov. Data 16(4), 79:1\u201379:43 (2022)","DOI":"10.1145\/3494562"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, L., Jiang, H., Wang, F., Feng, D., Xie, Y.: T-sample: a dual reservoir-based sampling method for characterizing large graph streams. In: ICDE 2019, pp. 1674\u20131677 (2019)","DOI":"10.1109\/ICDE.2019.00170"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Guo, D., Zhao, X.: Discovering bursting patterns over streaming graphs. In: DASFAA 2022, pp. 441\u2013458 (2022)","DOI":"10.1007\/978-3-031-00123-9_36"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"128","DOI":"10.14778\/3425879.3425884","volume":"14","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., et al.: On-off sketch: a fast and accurate sketch on persistence. Proc. VLDB Endow. 14(2), 128\u2013140 (2020)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30675-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:08:07Z","timestamp":1710245287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30675-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306747","9783031306754"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30675-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}