{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:11:51Z","timestamp":1784099511357,"version":"3.55.0"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012166","name":"national key research and development program","doi-asserted-by":"crossref","award":["2018YFE0207600"],"award-info":[{"award-number":["2018YFE0207600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U19B2024"],"award-info":[{"award-number":["U19B2024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61872446"],"award-info":[{"award-number":["61872446"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Science and Technology Innovation Program of Hunan Province","award":["2020RC4046"],"award-info":[{"award-number":["2020RC4046"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>With the rapid development of information technologies, multi-source heterogeneous data has become an open problem, and the data is usually modeled as graphs since the graph structure is able to encode complex relationships among entities. However, in practical applications, such as network security analysis and public opinion analysis over social networks, the structure and the content of graph data are constantly evolving. Therefore, the ability to continuously monitor and detect interesting patterns on massive and dynamic graphs in real-time is crucial for many applications. Recently, a large group of excellent research works has also emerged. Nevertheless, these studies focus on different updates of graphs and apply different subgraph matching algorithms; thus, it is desirable to review these works comprehensively and give a thorough overview. In this paper, we systematically investigate the existing continuous subgraph matching techniques from the aspects of key techniques, representative algorithms, and performance evaluation. Furthermore, the typical applications and challenges of continuous subgraph matching over dynamic graphs, as well as the future development trends, are summarized and prospected.\n<\/jats:p>","DOI":"10.1007\/s10115-022-01753-x","type":"journal-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T19:02:59Z","timestamp":1666206179000},"page":"945-989","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A survey of continuous subgraph matching for dynamic graphs"],"prefix":"10.1007","volume":"65","author":[{"given":"Xi","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qianzhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deke","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"1753_CR1","unstructured":"Apache girph[db\/ol]. http:\/\/incubator.apache.org\/giraph"},{"key":"1753_CR2","unstructured":"Facebook quarterly update. http:\/\/bit.ly\/2bim30d"},{"key":"1753_CR3","unstructured":"Neo4j. https:\/\/neo4j.com\/"},{"key":"1753_CR4","unstructured":"Orientdb. http:\/\/orientdb.com\/orientdb\/"},{"key":"1753_CR5","unstructured":"Postech database lab. nasa, yeast, and human datasets.[2012-08-27].[2014-11-20]. http:\/\/dtp.nci.nih.gov\/docs\/aids\/aids_data.html"},{"key":"1753_CR6","unstructured":"Reasoning on rdf streams. [online]: http:\/\/streamreasoning.org\/publication (2013)"},{"key":"1753_CR7","unstructured":"Verizon. http:\/\/www.verizonenterprise.com\/resources\/reports.pdf (2016)"},{"key":"1753_CR8","unstructured":"Reality mining dataset[db\/ol]. http:\/\/reality.media.mit.edu (2017)"},{"key":"1753_CR9","doi-asserted-by":"publisher","unstructured":"Aggarwal CC, Wang H. (eds.) (2010) Managing and Mining Graph Data, Advances in Database Systems, vol.\u00a040. Springer. https:\/\/doi.org\/10.1007\/978-1-4419-6045-0","DOI":"10.1007\/978-1-4419-6045-0"},{"issue":"6","key":"1753_CR10","doi-asserted-by":"publisher","first-page":"691","DOI":"10.14778\/3184470.3184473","volume":"11","author":"K Ammar","year":"2018","unstructured":"Ammar K, McSherry F, Salihoglu S, Joglekar M (2018) Distributed evaluation of subgraph queries using worst-case optimal and low-memory dataflows. Proc VLDB Endow 11(6):691\u2013704","journal-title":"Proc VLDB Endow"},{"key":"1753_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.bdr.2017.05.003","volume":"9","author":"S Aridhi","year":"2017","unstructured":"Aridhi S, Montresor A, Velegrakis Y (2017) BLADYG: a graph processing framework for large dynamic graphs. Big Data Res 9:9\u201317. https:\/\/doi.org\/10.1016\/j.bdr.2017.05.003","journal-title":"Big Data Res"},{"key":"1753_CR12","doi-asserted-by":"publisher","unstructured":"Bader DA, Madduri K (2007) A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms. In: Proceedings of 21th international parallel and distributed processing symposium, pp 1\u20138. https:\/\/doi.org\/10.1109\/IPDPS.2007.370445","DOI":"10.1109\/IPDPS.2007.370445"},{"issue":"1","key":"1753_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S1793351X10000936","volume":"4","author":"DF Barbieri","year":"2010","unstructured":"Barbieri DF, Braga D, Ceri S, Valle ED, Grossniklaus M (2010) C-SPARQL: a continuous query language for RDF data streams. Int J Semant Comput 4(1):3\u201325. https:\/\/doi.org\/10.1142\/S1793351X10000936","journal-title":"Int J Semant Comput"},{"key":"1753_CR14","doi-asserted-by":"publisher","unstructured":"Boshmaf Y, Muslukhov I, Beznosov K, Ripeanu M (2011) The socialbot network: when bots socialize for fame and money. In: Proceedings of twenty-seventh annual computer security applications conference, pp 93\u2013102. https:\/\/doi.org\/10.1145\/2076732.2076746","DOI":"10.1145\/2076732.2076746"},{"key":"1753_CR15","doi-asserted-by":"publisher","unstructured":"Cheng J, Ke Y, Ng W, Lu A (2007) Fg-index: towards verification-free query processing on graph databases. In: Proceedings of international conference on management of data, pp 857\u2013872. https:\/\/doi.org\/10.1145\/1247480.1247574","DOI":"10.1145\/1247480.1247574"},{"key":"1753_CR16","doi-asserted-by":"publisher","unstructured":"Choudhury S, Holder LB, Feo J, Jr, GC (2013) Fast search for dynamic multi-relational graphs. In: Proceedings of the workshop on dynamic networks management and mining, pp 1\u20138. https:\/\/doi.org\/10.1145\/2489247.2489251","DOI":"10.1145\/2489247.2489251"},{"key":"1753_CR17","doi-asserted-by":"publisher","unstructured":"Choudhury S, Holder LB, Jr, GC, Agarwal K, Feo J (2015) A selectivity based approach to continuous pattern detection in streaming graphs. In: Proceedings of the 18th international conference on extending database technology, pp 157\u2013168. https:\/\/doi.org\/10.5441\/002\/edbt.2015.15","DOI":"10.5441\/002\/edbt.2015.15"},{"key":"1753_CR18","unstructured":"Choudhury S, Holder LB, Jr, GC, Mackey P, Agarwal K, Feo J (2014) Query optimization for dynamic graphs. CoRR abs\/1407.3745. http:\/\/arxiv.org\/abs\/1407.3745"},{"key":"1753_CR19","doi-asserted-by":"publisher","unstructured":"Consortium TU (2017) Uniprot: the universal protein knowledgebase. Nucleic Acids Res. 45(Database-Issue), D158\u2013D169. https:\/\/doi.org\/10.1093\/nar\/gkw1099","DOI":"10.1093\/nar\/gkw1099"},{"issue":"10","key":"1753_CR20","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372. https:\/\/doi.org\/10.1109\/TPAMI.2004.75","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1753_CR21","doi-asserted-by":"crossref","unstructured":"Fan W, Fan Z, Tian C, Dong XL (2015) Keys for graphs. In: Proceedings of VLDB Endowment 8(12), 1590\u20131601. http:\/\/www.vldb.org\/pvldb\/vol8\/p1590-fan.pdf","DOI":"10.14778\/2824032.2824056"},{"key":"1753_CR22","doi-asserted-by":"publisher","unstructured":"Fan W, Hu C, Tian C (2017) Incremental graph computations: doable and undoable. In: Proceedings of the 2017 international conference on management of data, pp. 155\u2013169. https:\/\/doi.org\/10.1145\/3035918.3035944","DOI":"10.1145\/3035918.3035944"},{"key":"1753_CR23","doi-asserted-by":"publisher","unstructured":"Fan W, Li J, Luo J, Tan Z, Wang X, Wu Y (2011) Incremental graph pattern matching. In: Proceedings of the 2011 international conference on management of data, pp. 925\u2013936. https:\/\/doi.org\/10.1145\/1989323.1989420","DOI":"10.1145\/1989323.1989420"},{"issue":"12","key":"1753_CR24","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.14778\/2824032.2824048","volume":"8","author":"W Fan","year":"2015","unstructured":"Fan W, Wang X, Wu Y, Xu J (2015) Association rules with graph patterns. Proc VLDB Endow 8(12):1502\u20131513","journal-title":"Proc VLDB Endow"},{"key":"1753_CR25","doi-asserted-by":"publisher","unstructured":"Fan W, Wu Y, Xu J (2016) Functional dependencies for graphs. In: Proceedings of the 2016 international conference on management of data, pp. 1843\u20131857. https:\/\/doi.org\/10.1145\/2882903.2915232","DOI":"10.1145\/2882903.2915232"},{"key":"1753_CR26","doi-asserted-by":"publisher","unstructured":"Fan W, Xu J, Wu Y, Yu W, Jiang J, Zheng Z, Zhang B, Cao Y, Tian C (2017) Parallelizing sequential graph computations. In: Proceedings of the 2017 international conference on management of data, pp. 495\u2013510. https:\/\/doi.org\/10.1145\/3035918.3035942","DOI":"10.1145\/3035918.3035942"},{"issue":"1","key":"1753_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang Y, Huang X, Qin L, Zhang Y, Zhang W, Cheng R, Lin X (2020) A survey of community search over big graphs. VLDB J 29(1):353\u2013392. https:\/\/doi.org\/10.1007\/s00778-019-00556-x","journal-title":"VLDB J"},{"key":"1753_CR28","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, He G, Cheng C, Li J, Zhou M, Lin JC, Yun U (2020) A survey of pattern mining in dynamic graphs. WIREs Data Mining Knowl Discov. https:\/\/doi.org\/10.1002\/widm.1372","DOI":"10.1002\/widm.1372"},{"issue":"2","key":"1753_CR29","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00778-015-0416-z","volume":"25","author":"J Gao","year":"2016","unstructured":"Gao J, Zhou C, Yu JX (2016) Toward continuous pattern detection over evolving large graph with snapshot isolation. VLDB J 25(2):269\u2013290. https:\/\/doi.org\/10.1007\/s00778-015-0416-z","journal-title":"VLDB J"},{"key":"1753_CR30","doi-asserted-by":"publisher","unstructured":"Gao J, Zhou C, Zhou J, Yu JX (2014) Continuous pattern detection over billion-edge graph using distributed framework. In: Proceedings of the 30th international conference on data engineering, pp 556\u2013567. https:\/\/doi.org\/10.1109\/ICDE.2014.6816681","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"1753_CR31","doi-asserted-by":"publisher","unstructured":"Giugno R, Shasha DE (2002) Graphgrep: a fast and universal method for querying graphs. In: Proceedings of the 16th international conference on pattern recognition, pp 112\u2013115. https:\/\/doi.org\/10.1109\/ICPR.2002.1048250","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"1753_CR32","doi-asserted-by":"publisher","unstructured":"Gong NZ, Xu W, Huang L, Mittal P, Stefanov E, Sekar V, Song D (2012) Evolution of social-attribute networks: measurements, modeling, and implications using google+. In: Proceedings of the 12th internet measurement conference, pp 131\u2013144. https:\/\/doi.org\/10.1145\/2398776.2398792","DOI":"10.1145\/2398776.2398792"},{"key":"1753_CR33","doi-asserted-by":"publisher","unstructured":"Hajlaoui JE, Omri MN, Benslimane D (2017) Performance and scalability appraisal of four directed weighted graph matching algorithms: A survey. In: Proceedings of the 14th international conference on computer systems and applications, pp 392\u2013398. https:\/\/doi.org\/10.1109\/AICCSA.2017.50","DOI":"10.1109\/AICCSA.2017.50"},{"key":"1753_CR34","doi-asserted-by":"publisher","unstructured":"Han W, Lee J, Lee J (2013) Turbo$${}_{\\text{iso}}$$: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 international conference on management of data, pp 337\u2013348. https:\/\/doi.org\/10.1145\/2463676.2465300","DOI":"10.1145\/2463676.2465300"},{"key":"1753_CR35","doi-asserted-by":"publisher","unstructured":"He H, Singh AK (2006) Closure-tree: An index structure for graph queries. In: Proceedings of the 22nd international conference on data engineering, p\u00a038. https:\/\/doi.org\/10.1109\/ICDE.2006.37","DOI":"10.1109\/ICDE.2006.37"},{"key":"1753_CR36","doi-asserted-by":"publisher","unstructured":"He H, Singh AK (2008) Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 international conference on management of data, pp 405\u2013418. https:\/\/doi.org\/10.1145\/1376616.1376660","DOI":"10.1145\/1376616.1376660"},{"key":"1753_CR37","doi-asserted-by":"publisher","unstructured":"Jiang H, Wang H, Yu PS, Zhou S (2007) Gstring: a novel approach for efficient search in graph databases. In: Proceedings of the 23rd international conference on data engineering, pp 566\u2013575. https:\/\/doi.org\/10.1109\/ICDE.2007.367902","DOI":"10.1109\/ICDE.2007.367902"},{"key":"1753_CR38","doi-asserted-by":"publisher","unstructured":"Jiang N, Jin Y, Skudlark A, Hsu W, Jacobson G, Prakasam S, Zhang Z (2012) Isolating and analyzing fraud activities in a large cellular network via voice call graph analysis. In: Proceedings of the 10th international conference on mobile systems, pp 253\u2013266. https:\/\/doi.org\/10.1145\/2307636.2307660","DOI":"10.1145\/2307636.2307660"},{"issue":"2","key":"1753_CR39","first-page":"391","volume":"52","author":"Y Jing","year":"2015","unstructured":"Jing Y, Yanbing L, Yu Z, Mengya L, Jianlong T, Li G (2015) Survey on large-scale graph pattern matching. J Comput Res Dev 52(2):391\u2013409","journal-title":"J Comput Res Dev"},{"key":"1753_CR40","doi-asserted-by":"publisher","unstructured":"Kankanamge C, Sahu S, Mhedbhi A, Chen J, Salihoglu S (2017) Graphflow: an active graph database. In: Proceedings of the 2017 international conference on management of data, pp 1695\u20131698. https:\/\/doi.org\/10.1145\/3035918.3056445","DOI":"10.1145\/3035918.3056445"},{"key":"1753_CR41","doi-asserted-by":"publisher","unstructured":"Kao J, Chou J (2016) Distributed incremental pattern matching on streaming graphs. In: Proceedings of the workshop on high performance graph processing, pp 43\u201350. https:\/\/doi.org\/10.1145\/2915516.2915519","DOI":"10.1145\/2915516.2915519"},{"key":"1753_CR42","doi-asserted-by":"publisher","unstructured":"Khurana U, Deshpande A (2013) Efficient snapshot retrieval over historical graph data. In: Proceedings of the 29th international conference on data engineering, pp 997\u20131008. https:\/\/doi.org\/10.1109\/ICDE.2013.6544892","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"1753_CR43","doi-asserted-by":"publisher","unstructured":"Kim K, Seo I, Han W, Lee J, Hong S, Chafi H, Shin H, Jeong G (2018) TurboFlux: a fast continuous subgraph matching system for streaming graph data. In: Proceedings of the 2018 international conference on management of data, pp 411\u2013426. https:\/\/doi.org\/10.1145\/3183713.3196917","DOI":"10.1145\/3183713.3196917"},{"key":"1753_CR44","doi-asserted-by":"crossref","unstructured":"Kou Y, Shen D, Snell Q, Li D, Nie T, Yu G, Ma S (2020) Efficient team formation in social networks based on constrained pattern graph. In: Proceedings of ICDE, Dallas, TX, USA, April 20\u201324, pp 889\u2013900","DOI":"10.1109\/ICDE48307.2020.00082"},{"key":"1753_CR45","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of ICDM, 29 November\u20132 December, San Jose, California, USA, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"10","key":"1753_CR46","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai L, Qing Z, Yang Z et al (2019) Distributed subgraph matching on timely dataflow. Proc VLDB Endow 12(10):1099\u20131112","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"1753_CR47","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee J, Han W, Kasperovics R, Lee J (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc VLDB Endow 6(2):133\u2013144","journal-title":"Proc VLDB Endow"},{"key":"1753_CR48","doi-asserted-by":"crossref","unstructured":"Li Y, Zou L, \u00d6zsu MT, Zhao D (2019) Time constrained continuous subgraph search over streaming graphs. In: Proceedings of the 35th international conference on data engineering, pp 1082\u20131093","DOI":"10.1109\/ICDE.2019.00100"},{"key":"1753_CR49","unstructured":"Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2010) Graphlab: a new framework for parallel machine learning. In: Proceedings of the twenty-sixth conference on uncertainty in artificial intelligence, pp 340\u2013349. https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1 &smnu=2 &article_id=2126"},{"issue":"4","key":"1753_CR50","doi-asserted-by":"publisher","first-page":"310","DOI":"10.14778\/2095686.2095690","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2011) Capturing topology in graph pattern matching. Proc VLDB Endow 5(4):310\u2013321","journal-title":"Proc VLDB Endow"},{"key":"1753_CR51","doi-asserted-by":"publisher","unstructured":"Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the international conference on management of data, pp 135\u2013146. https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"1753_CR52","doi-asserted-by":"publisher","unstructured":"Mhedhbi A, Kankanamge C, Salihoglu S (2021) Optimizing one-time and continuous subgraph queries using worst-case optimal joins. ACM Trans Database Syst. 46(2), 6:1\u20136:45. https:\/\/doi.org\/10.1145\/3446980","DOI":"10.1145\/3446980"},{"key":"1753_CR53","unstructured":"Milner R (1989) Communication and concurrency. PHI Series in computer science. Prentice Hall"},{"issue":"8","key":"1753_CR54","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.14778\/3457390.3457395","volume":"14","author":"S Min","year":"2021","unstructured":"Min S, Park SG, Park K, Giammarresi D, Italiano GF, Han W (2021) Symmetric continuous subgraph matching with bidirectional dynamic programming. Proc VLDB Endow 14(8):1298\u20131310","journal-title":"Proc VLDB Endow"},{"key":"1753_CR55","doi-asserted-by":"publisher","unstructured":"Mondal J, Deshpande A (2012) Managing large dynamic graphs efficiently. In: Proceedings of the 2012 international conference on management of data, pp 145\u2013156. https:\/\/doi.org\/10.1145\/2213836.2213854","DOI":"10.1145\/2213836.2213854"},{"key":"1753_CR56","doi-asserted-by":"publisher","unstructured":"Mondal J, Deshpande A (2016) CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs. In: Proceedings of the 10th international conference on distributed and event-based systems, pp 226\u2013237. https:\/\/doi.org\/10.1145\/2933267.2933316","DOI":"10.1145\/2933267.2933316"},{"key":"1753_CR57","doi-asserted-by":"publisher","unstructured":"Ngo HQ, Porat E, R\u00e9 C, Rudra A (2018) Worst-case optimal join algorithms. J ACM 65(3), 16:1\u201316:40. https:\/\/doi.org\/10.1145\/3180143","DOI":"10.1145\/3180143"},{"issue":"4","key":"1753_CR58","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2013","unstructured":"Ngo HQ, R\u00e9 C, Rudra A (2013) Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec 42(4):5\u201316. https:\/\/doi.org\/10.1145\/2590989.2590991","journal-title":"SIGMOD Rec"},{"key":"1753_CR59","doi-asserted-by":"publisher","unstructured":"Pugliese A, Br\u00f6cheler M, Subrahmanian VS, Ovelg\u00f6nne M (2014) Efficient multiview maintenance under insertion in huge social networks. ACM Trans Web 8(2), 10:1\u201310:32. https:\/\/doi.org\/10.1145\/2541290","DOI":"10.1145\/2541290"},{"key":"1753_CR60","doi-asserted-by":"publisher","unstructured":"Raghavendra R, Lobo J, Lee K (2012) Dynamic graph query primitives for SDN-based cloudnetwork management. In: Proceedings of the the first workshop on Hot topics in software defined networks, pp 97\u2013102. https:\/\/doi.org\/10.1145\/2342441.2342461","DOI":"10.1145\/2342441.2342461"},{"key":"1753_CR61","doi-asserted-by":"crossref","unstructured":"Ren X, Wang J (2015) Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc VLDB Endow 8(5), 617\u2013628. http:\/\/www.vldb.org\/pvldb\/vol8\/p617-ren.pdf","DOI":"10.14778\/2735479.2735493"},{"key":"1753_CR62","doi-asserted-by":"crossref","unstructured":"Ren X, Wang J (2016) Multi-query optimization for subgraph isomorphism search. Proc VLDB Endow 10(3), 121\u2013132. http:\/\/www.vldb.org\/pvldb\/vol10\/p121-ren.pdf","DOI":"10.14778\/3021924.3021929"},{"key":"1753_CR63","doi-asserted-by":"crossref","unstructured":"Shang H, Zhang Y, Lin X, Yu JX (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc VLDB Endow 1(1), 364\u2013375. http:\/\/www.vldb.org\/pvldb\/vol1\/1453899.pdf","DOI":"10.14778\/1453856.1453899"},{"key":"1753_CR64","doi-asserted-by":"publisher","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the international conference on management of data, pp 505\u2013516. https:\/\/doi.org\/10.1145\/2463676.2467799","DOI":"10.1145\/2463676.2467799"},{"key":"1753_CR65","doi-asserted-by":"publisher","unstructured":"Shasha DE, Wang JT, Giugno R (2002) Algorithmics and applications of tree and graph searching. In: Proceedings of the twenty-first symposium on principles of database systems, pp 39\u201352. https:\/\/doi.org\/10.1145\/543613.543620","DOI":"10.1145\/543613.543620"},{"issue":"4","key":"1753_CR66","doi-asserted-by":"publisher","first-page":"413","DOI":"10.14778\/2735496.2735504","volume":"8","author":"C Song","year":"2014","unstructured":"Song C, Ge T, Chen CX, Wang J (2014) Event pattern matching over graph streams. Proc VLDB Endow 8(4):413\u2013424","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"1753_CR67","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TKDE.2020.2980257","volume":"34","author":"S Sun","year":"2022","unstructured":"Sun S, Luo Q (2022) Subgraph matching with effective matching order and indexing. IEEE Trans Knowl Data Eng 34(1):491\u2013505. https:\/\/doi.org\/10.1109\/TKDE.2020.2980257","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1753_CR68","doi-asserted-by":"publisher","unstructured":"Sun X, Sun S, Luo Q, He B (2022) An in-depth study of continuous subgraph matching (complete version). CoRR abs\/2203.06913. https:\/\/doi.org\/10.48550\/arXiv.2203.06913","DOI":"10.48550\/arXiv.2203.06913"},{"issue":"9","key":"1753_CR69","doi-asserted-by":"publisher","first-page":"788","DOI":"10.14778\/2311906.2311907","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun Z, Wang H, Wang H, Shao B, Li J (2012) Efficient subgraph matching on billion node graphs. Proc VLDB Endow 5(9):788\u2013799","journal-title":"Proc VLDB Endow"},{"key":"1753_CR70","doi-asserted-by":"publisher","unstructured":"Tian Y, Patel JM (2008) TALE: a tool for approximate large graph matching. In: Proceedings of the 24th international conference on data engineering, pp 963\u2013972. https:\/\/doi.org\/10.1109\/ICDE.2008.4497505","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"1753_CR71","unstructured":"Ugander J, Karrer B, Backstrom L, Marlow C (2011) The anatomy of the Facebook social graph. CoRR abs\/1111.4503. http:\/\/arxiv.org\/abs\/1111.4503"},{"issue":"8","key":"1753_CR72","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111. https:\/\/doi.org\/10.1145\/79173.79181","journal-title":"Commun ACM"},{"key":"1753_CR73","doi-asserted-by":"publisher","unstructured":"Veldhuizen TL (2014) Triejoin: a simple, worst-case optimal join algorithm. In: Proceedings of the 17th international conference on database theory, pp 96\u2013106. https:\/\/doi.org\/10.5441\/002\/icdt.2014.13","DOI":"10.5441\/002\/icdt.2014.13"},{"key":"1753_CR74","unstructured":"Wang AH (2010) Don\u2019t follow me - spam detection in twitter. In: Proceedings of the international conference on security and cryptography, pp 142\u2013151"},{"key":"1753_CR75","doi-asserted-by":"publisher","unstructured":"Wang C, Chen L (2009) Continuous subgraph pattern search over graph streams. In: Proceedings of the 25th international conference on data engineering, pp 393\u2013404. https:\/\/doi.org\/10.1109\/ICDE.2009.132","DOI":"10.1109\/ICDE.2009.132"},{"key":"1753_CR76","doi-asserted-by":"publisher","unstructured":"Wickramaarachchi C, Kannan R, Chelmis C, Prasanna VK (2016) Distributed exact subgraph matching in small diameter dynamic graphs. In: Proceedings of the 2016 international conference on big data, pp 3360\u20133369. https:\/\/doi.org\/10.1109\/BigData.2016.7840996","DOI":"10.1109\/BigData.2016.7840996"},{"issue":"1","key":"1753_CR77","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/nar\/30.1.303","volume":"30","author":"I Xenarios","year":"2002","unstructured":"Xenarios I, Salw\u00ednski L, Duan XJ, Higney P, Kim S, Eisenberg DS (2002) Dip, the database of interacting proteins: a research tool for studying cellular networks of protein interactions. Nucleic Acids Res 30(1):303\u2013305. https:\/\/doi.org\/10.1093\/nar\/30.1.303","journal-title":"Nucleic Acids Res"},{"issue":"14","key":"1753_CR78","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan D, Cheng J, Lu Y, Ng W (2014) Blogel: a block-centric framework for distributed computation on real-world graphs. Proc VLDB Endow 7(14):1981\u20131992","journal-title":"Proc VLDB Endow"},{"key":"1753_CR79","doi-asserted-by":"publisher","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: Proceedings of the 2002 international conference on data mining, pp 721\u2013724. https:\/\/doi.org\/10.1109\/ICDM.2002.1184038","DOI":"10.1109\/ICDM.2002.1184038"},{"key":"1753_CR80","doi-asserted-by":"publisher","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 international conference on management of data, pp 335\u2013346. https:\/\/doi.org\/10.1145\/1007568.1007607","DOI":"10.1145\/1007568.1007607"},{"key":"1753_CR81","doi-asserted-by":"publisher","unstructured":"Yang J, Jin W (2011) Br-index: an indexing structure for subgraph matching in very large dynamic graphs. In: Proceedings of the 23rd international conference on scientific and statistical database management, vol. 6809, pp 322\u2013331. https:\/\/doi.org\/10.1007\/978-3-642-22351-8_20","DOI":"10.1007\/978-3-642-22351-8_20"},{"key":"1753_CR82","doi-asserted-by":"publisher","unstructured":"Yang J, Zhang S, Jin W (2011) DELTA: indexing and querying multi-labeled graphs. In: Proceedings of the 20th conference on information and knowledge management, pp 1765\u20131774. https:\/\/doi.org\/10.1145\/2063576.2063832","DOI":"10.1145\/2063576.2063832"},{"key":"1753_CR83","doi-asserted-by":"publisher","unstructured":"Zervakis L, Setty V, Tryfonopoulos C, Hose K (2020) Efficient continuous multi-query processing over graph streams. In: Proceedings of the 23rd international conference on extending database technology, pp 13\u201324. https:\/\/doi.org\/10.5441\/002\/edbt.2020.03","DOI":"10.5441\/002\/edbt.2020.03"},{"key":"1753_CR84","doi-asserted-by":"publisher","unstructured":"Zhang Q, Guo D, Zhao X, Guo A (2019) On continuously matching of evolving graph patterns. In: Proceedings of the 28th international conference on information and knowledge management, pp 2237\u20132240. https:\/\/doi.org\/10.1145\/3357384.3358101","DOI":"10.1145\/3357384.3358101"},{"key":"1753_CR85","doi-asserted-by":"publisher","unstructured":"Zhang S, Li S, Yang J (2009) GADDI: distance index based subgraph matching in biological networks. In: Proceedings of the 12th international conference on extending database technology, vol. 360, pp 192\u2013203. https:\/\/doi.org\/10.1145\/1516360.1516384","DOI":"10.1145\/1516360.1516384"},{"key":"1753_CR86","unstructured":"Zhang\u00a0LX Wang\u00a0WP, GJWJ (2015) Pattern graph change oriented incremental graph pattern matching. J Softw 26(11)"},{"issue":"1","key":"1753_CR87","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. Proc VLDB Endow 3(1):340\u2013351","journal-title":"Proc VLDB Endow"},{"key":"1753_CR88","doi-asserted-by":"publisher","unstructured":"Zong B, Raghavendra R, Srivatsa M, Yan X, Singh AK, Lee K (2014) Cloud service placement via subgraph matching. In: Proceedings of the 30th international conference on data engineering, pp 832\u2013843. https:\/\/doi.org\/10.1109\/ICDE.2014.6816704","DOI":"10.1109\/ICDE.2014.6816704"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01753-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01753-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01753-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T07:09:11Z","timestamp":1676617751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01753-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,19]]},"references-count":88,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1753"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01753-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,19]]},"assertion":[{"value":"11 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}