{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:41:28Z","timestamp":1742982088239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031001222"},{"type":"electronic","value":"9783031001239"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00123-9_36","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"441-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discovering Bursting Patterns over Streaming Graphs"],"prefix":"10.1007","author":[{"given":"Qianzhen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deke","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"issue":"12","key":"36_CR1","doi-asserted-by":"publisher","first-page":"2710","DOI":"10.1109\/TKDE.2017.2743075","volume":"29","author":"E Abdelhamid","year":"2017","unstructured":"Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y., Kalnis, P.: Incremental frequent subgraph mining on large evolving graphs. IEEE Trans. Knowl. Data Eng. 29(12), 2710\u20132723 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_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: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, 22\u201326 October, 2018. pp. 923\u2013932 (2018)","DOI":"10.1145\/3269206.3271772"},{"key":"36_CR3","unstructured":"Borgwardt, K.M., Kriegel, H., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: Proceedings of the 6th IEEE International Conference on Data Mining, 18\u201322 December 2006, Hong Kong, China, pp. 818\u2013822 (2006)"},{"key":"36_CR4","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: Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, 23\u201327 March, 2015"},{"issue":"13","key":"36_CR5","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.14778\/3358701.3358704","volume":"12","author":"L Chu","year":"2019","unstructured":"Chu, L., Zhang, Y., Yang, Y., Wang, L., Pei, J.: Online density bursting subgraph detection from temporal graphs. Proc. VLDB Endow. 12(13), 2353\u20132365 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Gou, X., Zou, L.: Sliding window-based approximate triangle counting over streaming graphs with duplicate edges. In: SIGMOD \u201921: International Conference on Management of Data, Virtual Event, China, June 20\u201325, 2021, pp. 645\u2013657 (2021)","DOI":"10.1145\/3448016.3452800"},{"issue":"11","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.14778\/2809974.2809985","volume":"8","author":"J Kim","year":"2015","unstructured":"Kim, J., Shin, H., Han, W., Hong, S., Chafi, H.: Taming subgraph isomorphism for RDF query processing. Proc. VLDB Endow. 8(11), 1238\u20131249 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"36_CR8","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November - 2 December 2001, San Jose, California, USA, pp. 313\u2013320 (2001)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Li, Y., Zou, L., \u00d6zsu, M.T., Zhao, D.: Time constrained continuous subgraph search over streaming graphs. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, 8\u201311 April, 2019, pp. 1082\u20131093 (2019)","DOI":"10.1109\/ICDE.2019.00100"},{"issue":"8","key":"36_CR10","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."},{"key":"36_CR11","doi-asserted-by":"crossref","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\u201348:35 (2021)","DOI":"10.1145\/3442590"},{"key":"36_CR12","unstructured":"Qin, H., Li, R., Wang, G., Qin, L., Yuan, Y., Zhang, Z.: Mining bursting communities in temporal graphs. CoRR (2019)"},{"key":"36_CR13","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, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, BigMine 2014, New York City, USA, 24 August, 2014, vol. 36, pp. 166\u2013181"},{"issue":"4","key":"36_CR14","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s10115-019-01403-9","volume":"62","author":"P Rozenshtein","year":"2019","unstructured":"Rozenshtein, P., Bonchi, F., Gionis, A., Sozio, M., Tatti, N.: Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. 62(4), 1611\u20131639 (2019). https:\/\/doi.org\/10.1007\/s10115-019-01403-9","journal-title":"Knowl. Inf. Syst."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Tatti, N., Gionis, A.: Finding dynamic dense subgraphs. ACM Trans. Knowl. Discov. Data 11(3), 27:1\u201327:30 (2017)","DOI":"10.1145\/3046791"},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"36_CR17","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, 9\u201312 December 2002, Maebashi City, Japan, pp. 721\u2013724 (2002)"}],"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-00123-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:18:41Z","timestamp":1651007921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","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":"72","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":"76","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":"13% - 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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}