{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T20:38:53Z","timestamp":1781728733748,"version":"3.54.5"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T00:00:00Z","timestamp":1712102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T00:00:00Z","timestamp":1712102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302451"],"award-info":[{"award-number":["62302451"]}],"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":["62025206"],"award-info":[{"award-number":["62025206"]}],"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":["62276233"],"award-info":[{"award-number":["62276233"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Zhejiang Province of China","award":["LQ22F020018"],"award-info":[{"award-number":["LQ22F020018"]}]},{"name":"Key Research Project of Zhejiang Province of China","award":["2023C01048"],"award-info":[{"award-number":["2023C01048"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11280-024-01259-2","type":"journal-article","created":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T15:02:05Z","timestamp":1712156525000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Towards efficient simulation-based constrained temporal graph pattern matching"],"prefix":"10.1007","volume":"27","author":[{"given":"Tianming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinwei","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,3]]},"reference":[{"issue":"1","key":"1259_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1147\/sj.461.0135","volume":"46","author":"RA Mushlin","year":"2007","unstructured":"Mushlin, R.A., Kershenbaum, A., Gallagher, S.T., Rebbeck, T.R.: A graph-theoretical approach for pattern discovery in epidemiological research. IBM Syst. J. 46(1), 135\u2013150 (2007)","journal-title":"IBM Syst. J."},{"key":"1259_CR2","doi-asserted-by":"crossref","unstructured":"Milajerdi, S.M., Eshete, B., Gjomemo, R., Venkatakrishnan, V.N.: POIROT: aligning attack behavior with kernel audit records for cyber threat hunting. In: CCS, pp. 1813\u20131830 (2019)","DOI":"10.1145\/3319535.3363217"},{"key":"1259_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2021.102282","volume":"106","author":"Z Li","year":"2021","unstructured":"Li, Z., Chen, Q.A., Yang, R., Chen, Y., Ruan, W.: Threat detection and investigation with system-level provenance graphs: A survey. Comput. Secur. 106, 102282 (2021)","journal-title":"Comput. Secur."},{"key":"1259_CR4","unstructured":"Cheng, Q., Shen, Y., Kong, D., Wu, C.: STEP: spatial-temporal network security event prediction. CoRR abs\/2105.14932 (2021)"},{"key":"1259_CR5","doi-asserted-by":"crossref","unstructured":"Mouden, Z.A.E., Taj, R.M., Jakimi, A., Hajar, M.: Towards using graph analytics for tracking covid-19. In: The 11th international conference on emerging ubiquitous systems and pervasive networks EUSPN, pp. 204\u2013211 (2020)","DOI":"10.1016\/j.procs.2020.10.029"},{"key":"1259_CR6","doi-asserted-by":"crossref","unstructured":"Cavallaro, L., Bagdasar, O., Meo, P.D., Fiumara, G., Liotta, A.: Graph and network theory for the analysis of criminal networks. CoRR abs\/2103.02504 (2021)","DOI":"10.1007\/978-3-030-67197-6_8"},{"issue":"4","key":"1259_CR7","first-page":"310","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4), 310\u2013321 (2011)","journal-title":"PVLDB"},{"key":"1259_CR8","doi-asserted-by":"crossref","unstructured":"Li, Y., Zou, L., \u00d6zsu, M.T., Zhao, D.: Time constrained continuous subgraph search over streaming graphs. In: ICDE, pp. 1082\u20131093 (2019)","DOI":"10.1109\/ICDE.2019.00100"},{"issue":"10","key":"1259_CR9","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., Jin, X., Lai, Z., Wang, R., Hao, K., Lin, X., Qin, L., Zhang, W., et al.: Distributed subgraph matching on timely dataflow. Proceedings of the VLDB Endowment 12(10), 1099\u20131112 (2019)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"1259_CR10","doi-asserted-by":"publisher","first-page":"176","DOI":"10.14778\/3425879.3425888","volume":"14","author":"S Sun","year":"2020","unstructured":"Sun, S., Sun, X., Che, Y., Luo, Q., He, B.: Rapidmatch: A holistic approach to subgraph query processing. Proc. VLDB Endow. 14(2), 176\u2013188 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"1259_CR11","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zou, L., \u00d6zsu, M.T., Hu, L., Zhang, F.: GSI: gpu-friendly subgraph isomorphism. In: ICDE, pp. 1249\u20131260 (2020)","DOI":"10.1109\/ICDE48307.2020.00112"},{"key":"1259_CR12","doi-asserted-by":"crossref","unstructured":"Zhu, K., Fletcher, G., Yakovets, N.: Leveraging temporal and topological selectivities in temporal-clique subgraph query processing. In: ICDE, pp. 672\u2013683 (2021)","DOI":"10.1109\/ICDE51399.2021.00064"},{"key":"1259_CR13","doi-asserted-by":"crossref","unstructured":"Yang, Z., Lai, L., Lin, X., Hao, K., Zhang, W.: Huge: An efficient and scalable subgraph enumeration system. In: Proceedings of the 2021 international conference on management of data, pp. 2049\u20132062 (2021)","DOI":"10.1145\/3448016.3457237"},{"issue":"11","key":"1259_CR14","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(11), 2415\u20132427 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"1259_CR15","doi-asserted-by":"crossref","unstructured":"Locicero, G., Micale, G., Pulvirenti, A., Ferro, A.: Temporalri: A subgraph isomorphism algorithm for temporal networks. In: International conference on complex networks and their applications, pp. 675\u2013687 (2020)","DOI":"10.1007\/978-3-030-65351-4_54"},{"issue":"1","key":"1259_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1(1), 364\u2013375 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"1259_CR17","unstructured":"Redmond, U., Cunningham, P.: Subgraph isomorphism in temporal networks. CoRR abs\/1605.02174 (2016)"},{"key":"1259_CR18","doi-asserted-by":"crossref","unstructured":"Xu, Y., Huang, J., Liu, A., Li, Z., Yin, H., Zhao, L.: Time-constrained graph pattern matching in a large temporal graph. In: APWeb-WAIM, pp. 100\u2013115 (2017)","DOI":"10.1007\/978-3-319-63579-8_9"},{"key":"1259_CR19","doi-asserted-by":"crossref","unstructured":"Jin, X., Yang, Z., Lin, X., Yang, S., Qin, L., Peng, Y.: Fast: Fpga-based subgraph matching on massive graphs. In: ICDE, pp. 1452\u20131463 (2021). IEEE","DOI":"10.1109\/ICDE51399.2021.00129"},{"issue":"3","key":"1259_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"4","key":"1259_CR21","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s41019-019-00105-0","volume":"4","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yuan, Y., Ma, Y., Wang, G.: Time-dependent graphs: Definitions, applications, and algorithms. Data Science and Engineering 4(4), 352\u2013366 (2019)","journal-title":"Data Science and Engineering"},{"issue":"3","key":"1259_CR22","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s10115-022-01753-x","volume":"65","author":"X Wang","year":"2023","unstructured":"Wang, X., Zhang, Q., Guo, D., Zhao, X.: A survey of continuous subgraph matching for dynamic graphs. Knowl. Inf. Syst. 65(3), 945\u2013989 (2023)","journal-title":"Knowl. Inf. Syst."},{"key":"1259_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109961","volume":"258","author":"F Li","year":"2022","unstructured":"Li, F., Zou, Z., Li, J., Yang, X., Wang, B.: Evolving subgraph matching on temporal graphs. Knowl. Based Syst. 258, 109961 (2022)","journal-title":"Knowl. Based Syst."},{"issue":"5","key":"1259_CR24","first-page":"4713","volume":"35","author":"F Li","year":"2023","unstructured":"Li, F., Zou, Z., Li, J.: Durable subgraph matching on temporal graphs. IEEE Trans. Knowl. Data Eng. 35(5), 4713\u20134726 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1259_CR25","doi-asserted-by":"crossref","unstructured":"Cao, Y., Fan, W., Huai, J., Huang, R.: Making pattern queries bounded in big graphs. In: ICDE, pp. 161\u2013172 (2015)","DOI":"10.1109\/ICDE.2015.7113281"},{"issue":"1","key":"1259_CR26","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"key":"1259_CR27","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: ICDE, pp. 39\u201350 (2011)","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"1259_CR28","doi-asserted-by":"crossref","unstructured":"Liu, G., Zheng, K., Wang, Y., Orgun, M.A., Liu, A., Zhao, L., Zhou, X.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE, pp. 351\u2013362 (2015)","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"1259_CR29","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Annual Symposium on Foundations of Computer Science, FOCS, pp. 453\u2013462 (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"issue":"1","key":"1259_CR30","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2528937","volume":"39","author":"S Ma","year":"2014","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: Capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 4\u20131446 (2014)","journal-title":"ACM Trans. Database Syst."},{"key":"1259_CR31","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Luo, J., Tan, Z., Wang, X., Wu, Y.: Incremental graph pattern matching. In: SIGMOD, pp. 925\u2013936 (2011)","DOI":"10.1145\/1989323.1989420"},{"key":"1259_CR32","doi-asserted-by":"crossref","unstructured":"Ma, S., Cao, Y., Huai, J., Wo, T.: Distributed graph pattern matching. In: WWW, pp. 949\u2013958 (2012)","DOI":"10.1145\/2187836.2187963"},{"issue":"6","key":"1259_CR33","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/TKDE.2017.2785824","volume":"30","author":"G Liu","year":"2018","unstructured":"Liu, G., Liu, Y., Zheng, K., Liu, A., Li, Z., Wang, Y., Zhou, X.: MCS-GPM: multi-constrained simulation based graph pattern matching in contextual social graphs. IEEE Trans. Knowl. Data Eng. 30(6), 1050\u20131064 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"1259_CR34","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1007\/s10586-019-02977-3","volume":"23","author":"H Mahfoud","year":"2020","unstructured":"Mahfoud, H.: Graph pattern matching with counting quantifiers and label-repetition constraints. Clust. Comput. 23(3), 1529\u20131553 (2020)","journal-title":"Clust. Comput."},{"key":"1259_CR35","doi-asserted-by":"crossref","unstructured":"Mahfoud, H.: Towards a strong containment for efficient matching of expressive graph patterns. In: Proceedings of the 14th international conference on management of digital ecosystems, pp. 48\u201355 (2022)","DOI":"10.1145\/3508397.3564851"},{"issue":"17","key":"1259_CR36","doi-asserted-by":"publisher","first-page":"14205","DOI":"10.1007\/s00521-021-06590-7","volume":"34","author":"H Mahfoud","year":"2022","unstructured":"Mahfoud, H.: Expressive top-k matching for conditional graph patterns. Neural Comput. Appl. 34(17), 14205\u201314221 (2022)","journal-title":"Neural Comput. Appl."},{"issue":"4","key":"1259_CR37","first-page":"413","volume":"8","author":"C Song","year":"2014","unstructured":"Song, C., Ge, T., Chen, C.X., Wang, J.: Event pattern matching over graph streams. PVLDB 8(4), 413\u2013424 (2014)","journal-title":"PVLDB"},{"issue":"1","key":"1259_CR38","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10707-019-00381-y","volume":"24","author":"Y Ma","year":"2020","unstructured":"Ma, Y., Yuan, Y., Liu, M., Wang, G., Wang, Y.: Graph simulation on large scale temporal graphs. GeoInformatica 24(1), 199\u2013220 (2020)","journal-title":"GeoInformatica"},{"issue":"10","key":"1259_CR39","doi-asserted-by":"publisher","first-page":"3453","DOI":"10.1109\/TKDE.2020.2968901","volume":"33","author":"Y Gao","year":"2021","unstructured":"Gao, Y., Zhang, T., Qiu, L., Linghu, Q., Chen, G.: Time-respecting flow graph pattern matching on temporal graphs. IEEE Trans. Knowl. Data Eng. 33(10), 3453\u20133467 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"1259_CR40","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00778-011-0238-6","volume":"21","author":"L Zou","year":"2012","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T., Zhao, D.: Answering pattern match queries in large graph databases via graph embedding. VLDB J. 21(1), 97\u2013120 (2012)","journal-title":"VLDB J."},{"key":"1259_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2022.100350","volume":"30","author":"H Zhang","year":"2022","unstructured":"Zhang, H., Bai, Q., Lian, Y., Wen, Y.: A twig-based algorithm for top-k subgraph matching in large-scale graph data. Big Data Res. 30, 100350 (2022)","journal-title":"Big Data Res."},{"issue":"4","key":"1259_CR42","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1109\/TKDE.2019.2942294","volume":"33","author":"G Sun","year":"2021","unstructured":"Sun, G., Liu, G., Wang, Y., Orgun, M.A., Sheng, Q.Z., Zhou, X.: Incremental graph pattern based node matching with multiple updates. IEEE Trans. Knowl. Data Eng. 33(4), 1585\u20131600 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1259_CR43","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ge, Q., Pang, Y., Zou, L.: Hop-constrained subgraph query and summarization on large graphs. In: DASFAA, pp. 123\u2013139 (2021)","DOI":"10.1007\/978-3-030-73216-5_9"},{"key":"1259_CR44","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhang, Y., Qin, L., Wang, W., Zhang, W., Lin, X.: Reinforcement learning based query vertex ordering model for subgraph matching. In: ICDE, pp. 245\u2013258 (2022)","DOI":"10.1109\/ICDE53745.2022.00023"},{"key":"1259_CR45","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Narasimhan, G., Smid, M.H.M.: Geometric spanners. In: Encyclopedia of Algorithms, pp. 846\u2013852 (2016)","DOI":"10.1007\/978-1-4939-2864-4_167"},{"issue":"1","key":"1259_CR46","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11280-019-00674-0","volume":"23","author":"T Zhang","year":"2020","unstructured":"Zhang, T., Gao, Y., Qiu, L., Chen, L., Linghu, Q., Pu, S.: Distributed time-respecting flow graph pattern matching on temporal graphs. World Wide Web 23(1), 609\u2013630 (2020)","journal-title":"World Wide Web"},{"issue":"12","key":"1259_CR47","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.14778\/2732977.2732983","volume":"7","author":"W Fan","year":"2014","unstructured":"Fan, W., Wang, X., Wu, Y., Deng, D.: Distributed graph simulation: Impossibility and possibility. Proceedings of the VLDB Endowment 7(12), 1083\u20131094 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1259_CR48","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11280-019-00674-0","volume":"23","author":"T Zhang","year":"2020","unstructured":"Zhang, T., Gao, Y., Qiu, L., Chen, L., Linghu, Q., Pu, S.: Distributed time-respecting flow graph pattern matching on temporal graphs. World Wide Web 23, 609\u2013630 (2020)","journal-title":"World Wide Web"},{"key":"1259_CR49","doi-asserted-by":"crossref","unstructured":"Gehani, A., Tariq, D.: Spade: Support for provenance auditing in distributed environments. In: 13th International middleware conference, pp. 101\u2013120 (2012)","DOI":"10.1007\/978-3-642-35170-9_6"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01259-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-024-01259-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01259-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T16:25:57Z","timestamp":1731687957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-024-01259-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,3]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1259"],"URL":"https:\/\/doi.org\/10.1007\/s11280-024-01259-2","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,3]]},"assertion":[{"value":"26 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"22"}}