{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:01:25Z","timestamp":1776182485179,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"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":["62025208"],"award-info":[{"award-number":["62025208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China,China","doi-asserted-by":"crossref","award":["62421002"],"award-info":[{"award-number":["62421002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10115-025-02608-x","type":"journal-article","created":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T15:35:57Z","timestamp":1761320157000},"page":"12699-12726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["TriFMatch: a flash subgraph matching algorithm with effective filtering techniques"],"prefix":"10.1007","volume":"67","author":[{"given":"Jiezhong","family":"He","sequence":"first","affiliation":[]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Menghan","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Zhouyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Dongsheng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,24]]},"reference":[{"key":"2608_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6441","volume":"33","author":"M Jia","year":"2021","unstructured":"Jia M, Zhang Y, Li D (2021) Qrdf: An efficient rdf graph processing system for fast query. Concurr Comput Pract Exp 33:e6441","journal-title":"Concurr Comput Pract Exp"},{"key":"2608_CR2","doi-asserted-by":"crossref","unstructured":"Wi S, Woo S, Whang JJ, Son S (2022) Hiddencpg: Large-scale vulnerable clone detection using subgraph isomorphism of code property graphs. In: Proceedings of the ACM Web Conference 2022 (2022)","DOI":"10.1145\/3485447.3512235"},{"key":"2608_CR3","doi-asserted-by":"publisher","unstructured":"Pei Y, Lyu F, Ipenburg W, Pechenizkiy M (2021) Subgraph anomaly detection in financial transaction networks. In: Proceedings of the First ACM International Conference on AI in Finance. ICAIF \u201920. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3383455.3422548","DOI":"10.1145\/3383455.3422548"},{"key":"2608_CR4","doi-asserted-by":"crossref","unstructured":"Karp R (1972) Reducibility among combinatorial problems, vol 40, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2608_CR5","doi-asserted-by":"publisher","unstructured":"Han M, Kim H, Gu G, Park K, Han W-S (2019) Efficient subgraph matching: harmonizing dynamic programming, adaptive matching order, and failing set together. SIGMOD Conference. https:\/\/doi.org\/10.1145\/3299869.3319880","DOI":"10.1145\/3299869.3319880"},{"key":"2608_CR6","doi-asserted-by":"publisher","unstructured":"Bhattarai B, Liu H, Huang HH (2019) CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching. In: Proceedings of the 2019 International Conference on Management Of Data. SIGMOD \u201919, pp. 1447\u20131462. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3299869.3300086","DOI":"10.1145\/3299869.3300086"},{"issue":"2","key":"2608_CR7","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 (2020) Rapidmatch: a holistic approach to subgraph query processing. Proc VLDB Endow 14(2):176\u2013188. https:\/\/doi.org\/10.14778\/3425879.3425888","journal-title":"Proc VLDB Endow"},{"key":"2608_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-022-00749-x","volume":"32","author":"H Kim","year":"2022","unstructured":"Kim H, Choi Y, Park K, Lin X, Hong S-H, Han W-S (2022) Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J 32:343\u2013368","journal-title":"VLDB J"},{"key":"2608_CR9","doi-asserted-by":"publisher","DOI":"10.1145\/3589312","author":"J Arai","year":"2023","unstructured":"Arai J, Fujiwara Y, Onizuka M (2023) Gup: fast subgraph matching by guard-based pruning. Proc ACM Manag Data. https:\/\/doi.org\/10.1145\/3589312","journal-title":"Proc ACM Manag Data"},{"key":"2608_CR10","doi-asserted-by":"publisher","DOI":"10.1145\/3588695","author":"R Yang","year":"2023","unstructured":"Yang R, Zhang Z, Zheng W, Yu JX (2023) Fast continuous subgraph matching over streaming graphs via backtracking reduction. Proc ACM Manag Data. https:\/\/doi.org\/10.1145\/3588695","journal-title":"Proc ACM Manag Data"},{"key":"2608_CR11","doi-asserted-by":"publisher","DOI":"10.1145\/3639315","author":"Z Zhang","year":"2024","unstructured":"Zhang Z, Lu Y, Zheng W, Lin X (2024) A comprehensive survey and experimental study of subgraph matching: trends, unbiasedness, and interaction. Proc ACM Manag Data. https:\/\/doi.org\/10.1145\/3639315","journal-title":"Proc ACM Manag Data"},{"issue":"1","key":"2608_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342. https:\/\/doi.org\/10.1145\/321921.321925","journal-title":"J ACM"},{"key":"2608_CR13","doi-asserted-by":"publisher","unstructured":"Bi F, Chang L, Lin X, Qin L, Zhang W (2016) Efficient Subgraph Matching by Postponing Cartesian Products. In: Proceedings of the 2016 international conference on management of data. SIGMOD \u201916, pp 1199\u20131214. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/2882903.2915236","DOI":"10.1145\/2882903.2915236"},{"issue":"4","key":"2608_CR14","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2018","unstructured":"Carletti V, Foggia P, Saggese A, Vento M (2018) Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. IEEE Trans Pattern Anal Mach Intell 40(4):804\u2013818. https:\/\/doi.org\/10.1109\/TPAMI.2017.2696940","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2608_CR15","doi-asserted-by":"publisher","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc VLDB Endow 8(5), 617\u2013628 (2015) https:\/\/doi.org\/10.14778\/2735479.2735493","DOI":"10.14778\/2735479.2735493"},{"key":"2608_CR16","doi-asserted-by":"publisher","unstructured":"Jiang Z, Zhang S, Hou X, Yuan M, You H (2024) Ive: Accelerating enumeration-based subgraph matching via exploring isolated vertices. In: 2024 IEEE 40th international conference on data engineering (ICDE), pp 4208\u20134221. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00321","DOI":"10.1109\/ICDE60146.2024.00321"},{"key":"2608_CR17","doi-asserted-by":"publisher","unstructured":"Han WS, Lee J, Lee J-H (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD \u201913. https:\/\/doi.org\/10.1145\/2463676.2465300","DOI":"10.1145\/2463676.2465300"},{"key":"2608_CR18","doi-asserted-by":"publisher","unstructured":"Wang, J., Ren, X., Anirban, S., Wu, X.-W.: Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs. Information Sciences 482, 363\u2013373 (2019) https:\/\/doi.org\/10.1016\/j.ins.2019.01.036","DOI":"10.1016\/j.ins.2019.01.036"},{"key":"2608_CR19","doi-asserted-by":"publisher","unstructured":"Sun, S., Luo, Q.: In-Memory Subgraph Matching: An In-depth Study. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 1083\u20131098. ACM, Portland OR USA (2020). https:\/\/doi.org\/10.1145\/3318464.3380581","DOI":"10.1145\/3318464.3380581"},{"key":"2608_CR20","doi-asserted-by":"publisher","unstructured":"Shao, Y., Cui, B., Chen, L., Ma, L., Yao, J., Xu, N.: Parallel subgraph listing in a large-scale graph. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201914, pp. 625\u2013636. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2588555.2588557","DOI":"10.1145\/2588555.2588557"},{"key":"2608_CR21","doi-asserted-by":"publisher","unstructured":"Afrati, F.N., Fotakis, D., Ullman, J.D.: Enumerating subgraph instances using map-reduce. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 62\u201373 (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544814","DOI":"10.1109\/ICDE.2013.6544814"},{"issue":"4","key":"2608_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2014","unstructured":"Ngo HQ, R\u00e9 C, Rudra A (2014) 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":"2608_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.14778\/3021924.3021937","volume":"10","author":"L Lai","year":"2016","unstructured":"Lai L, Qin L, Lin X, Zhang Y, Chang L (2016) Scalable distributed subgraph enumeration. Proc VLDB Endow 10:217\u2013228","journal-title":"Proc VLDB Endow"},{"key":"2608_CR24","doi-asserted-by":"crossref","unstructured":"Ammar, K., McSherry, F., Salihoglu, S., Joglekar, M.R.: Distributed evaluation of subgraph queries using worst-case optimal and low-memory dataflows. ArXiv abs\/1802.03760 (2018)","DOI":"10.14778\/3199517.3199520"},{"key":"2608_CR25","doi-asserted-by":"publisher","first-page":"176","DOI":"10.14778\/3149193.3149198","volume":"11","author":"M Qiao","year":"2017","unstructured":"Qiao M, Zhang H, Cheng H (2017) Subgraph matching: on compression and computation. Proc VLDB Endow 11:176\u2013188","journal-title":"Proc VLDB Endow"},{"key":"2608_CR26","doi-asserted-by":"publisher","unstructured":"Choi, Y., Park, K., Kim, H.: Bice: Exploring compact search space by using bipartite matching and cell-wide verification. Proc. VLDB Endow. 16(9), 2186\u20132198 (2023) https:\/\/doi.org\/10.14778\/3598581.3598591","DOI":"10.14778\/3598581.3598591"},{"issue":"1","key":"2608_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10115-016-0968-2","volume":"51","author":"CR Rivero","year":"2017","unstructured":"Rivero CR, Jamil HM (2017) Efficient and scalable labeled subgraph matching using sgmatch. Knowl Inf Syst 51(1):61\u201387. https:\/\/doi.org\/10.1007\/s10115-016-0968-2","journal-title":"Knowl Inf Syst"},{"key":"2608_CR28","doi-asserted-by":"publisher","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: A distributed graph engine on a memory cloud. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201913, pp. 505\u2013516. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2463676.2467799","DOI":"10.1145\/2463676.2467799"},{"key":"2608_CR29","doi-asserted-by":"publisher","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce. Proc. VLDB Endow. 8(10), 974\u2013985 (2015) https:\/\/doi.org\/10.14778\/2794367.2794368","DOI":"10.14778\/2794367.2794368"},{"key":"2608_CR30","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, Zhang Y, Qian Z, Zhou J (2019) Distributed subgraph matching on timely dataflow. Proc VLDB Endow 12:1099\u20131112","journal-title":"Proc VLDB Endow"},{"key":"2608_CR31","doi-asserted-by":"publisher","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. EDBT \u201909, pp. 192\u2013203. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1516360.1516384","DOI":"10.1145\/1516360.1516384"},{"key":"2608_CR32","doi-asserted-by":"publisher","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. Proceedings of the VLDB Endowment 3(1-2), 340\u2013351 (2010) https:\/\/doi.org\/10.14778\/1920841.1920887","DOI":"10.14778\/1920841.1920887"},{"key":"2608_CR33","doi-asserted-by":"publisher","unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: 22nd International Conference on Data Engineering (ICDE\u201906), pp. 38\u201338 (2006). https:\/\/doi.org\/10.1109\/ICDE.2006.37","DOI":"10.1109\/ICDE.2006.37"},{"key":"2608_CR34","doi-asserted-by":"crossref","unstructured":"He, J., Chen, Y., Liu, Z., Li, D.: Optimizing subgraph retrieval and matching with an efficient indexing scheme. Knowledge and Information Systems (2024)","DOI":"10.21203\/rs.3.rs-4209309\/v1"},{"key":"2608_CR35","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. (1994)"},{"key":"2608_CR36","doi-asserted-by":"publisher","unstructured":"Wang, H., Zhang, Y., Qin, L., Wang, W., Zhang, W., Lin, X.: Reinforcement learning based query vertex ordering model for subgraph matching. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 245\u2013258 (2022). https:\/\/doi.org\/10.1109\/ICDE53745.2022.00023","DOI":"10.1109\/ICDE53745.2022.00023"},{"key":"2608_CR37","doi-asserted-by":"publisher","unstructured":"Han, S., Zou, L., Yu, J.X.: Speeding up set intersections in graph algorithms using simd instructions. In: Proceedings of the 2018 International Conference on Management of Data. SIGMOD \u201918, pp. 1587\u20131602. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3183713.3196924","DOI":"10.1145\/3183713.3196924"},{"key":"2608_CR38","doi-asserted-by":"publisher","unstructured":"MhedhbiAmine, SalihogluSemih: Optimizing subgraph queries by combining binary and worst-case optimal joins. Proceedings of the VLDB Endowment (2019) https:\/\/doi.org\/10.14778\/3342263.3342643 . Publisher: VLDB Endowment PUB4722","DOI":"10.14778\/3342263.3342643"},{"key":"2608_CR39","doi-asserted-by":"publisher","unstructured":"Katsarou, F., Ntarmos, N., Triantafillou, P.: Performance and scalability of indexed subgraph query processing methods. Proceedings of the VLDB Endowment 8(12), 1566\u20131577 (2015) https:\/\/doi.org\/10.14778\/2824032.2824054","DOI":"10.14778\/2824032.2824054"},{"key":"2608_CR40","doi-asserted-by":"publisher","unstructured":"Yazici, A., Ta\u015fkomaz, E.: Bf-biggraph: An efficient subgraph isomorphism approach using machine learning for big graph databases. Information Systems 124, 102401 (2024) https:\/\/doi.org\/10.1016\/j.is.2024.102401","DOI":"10.1016\/j.is.2024.102401"},{"key":"2608_CR41","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: A recursive model for graph mining. In: SDM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"2608_CR42","doi-asserted-by":"publisher","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proceedings of the VLDB Endowment 1(1), 364\u2013375 (2008) https:\/\/doi.org\/10.14778\/1453856.1453899","DOI":"10.14778\/1453856.1453899"},{"key":"2608_CR43","doi-asserted-by":"publisher","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD Conference (2008). https:\/\/doi.org\/10.1145\/1376616.1376660","DOI":"10.1145\/1376616.1376660"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02608-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T05:06:46Z","timestamp":1763701606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02608-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,24]]},"references-count":43,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2608"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02608-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6962397\/v1","asserted-by":"object"}]},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,24]]},"assertion":[{"value":"24 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2025","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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}