{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T09:13:43Z","timestamp":1782378823819,"version":"3.54.5"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:00:00Z","timestamp":1718496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:00:00Z","timestamp":1718496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Franco-Algerian program PHC Tassili BiGreen","award":["N\u00b018 MDU 111"],"award-info":[{"award-number":["N\u00b018 MDU 111"]}]},{"name":"Franco-Algerian program PHC Tassili BiGreen","award":["N\u00b018 MDU 111"],"award-info":[{"award-number":["N\u00b018 MDU 111"]}]},{"name":"Franco-Algerian program PHC Tassili BiGreen","award":["N\u00b018 MDU 111"],"award-info":[{"award-number":["N\u00b018 MDU 111"]}]},{"name":"Franco-Algerian program PHC Tassili BiGreen","award":["N\u00b018 MDU 111"],"award-info":[{"award-number":["N\u00b018 MDU 111"]}]},{"name":"Franco-Algerian program PHC Tassili BiGreen","award":["N\u00b018 MDU 111"],"award-info":[{"award-number":["N\u00b018 MDU 111"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s11227-024-06283-7","type":"journal-article","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T16:01:23Z","timestamp":1718553683000},"page":"21811-21836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GPU-accelerated relaxed graph pattern matching algorithms"],"prefix":"10.1007","volume":"80","author":[{"given":"Amira","family":"Benachour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u00efd","family":"Yahiaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarra","family":"Bouhenni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadia","family":"Nouali-Taboudjemat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,16]]},"reference":[{"issue":"9","key":"6283_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3434642","volume":"64","author":"S Sakr","year":"2021","unstructured":"Sakr S, Bonifati A, Voigt H, Iosup A, Ammar K, Angles R, Aref W, Arenas M, Besta M, Boncz PA et al (2021) The future is big graphs: a community view on graph processing systems. Commun ACM 64(9):62\u201371","journal-title":"Commun ACM"},{"issue":"1","key":"6283_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-022-00572-9","volume":"9","author":"H Shafiei","year":"2022","unstructured":"Shafiei H, Dadlani A (2022) Detection of fickle trolls in large-scale online social networks. J Big Data 9(1):1\u201321","journal-title":"J Big Data"},{"key":"6283_CR3","doi-asserted-by":"crossref","unstructured":"Yu K, Zhao T, Zhao P, Zhang J (2017) Extraction of protein-protein interactions using natural language processing based pattern matching. In: 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp 1292\u20131295 . IEEE","DOI":"10.1109\/BIBM.2017.8217847"},{"key":"6283_CR4","doi-asserted-by":"crossref","unstructured":"Noel S, Harley E, Tam KH, Limiero M, Share M (2016) CyGraph: graph-based analytics and visualization for cybersecurity. Elsevier","DOI":"10.1016\/bs.host.2016.07.001"},{"issue":"6","key":"6283_CR5","first-page":"3934","volume":"4","author":"P Kulkarni","year":"2014","unstructured":"Kulkarni P, Joglekar Y (2014) Generating and analyzing test cases from software requirements using nlp and hadoop. Int J Curr Eng Technol 4(6):3934\u20133937","journal-title":"Int J Curr Eng Technol"},{"key":"6283_CR6","doi-asserted-by":"crossref","unstructured":"Hains GJ, Khmelevsky Y, Tachon T (2019) From natural language to graph queries. In: 2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE), pp 1\u20134. IEEE","DOI":"10.1109\/CCECE.2019.8861892"},{"key":"6283_CR7","doi-asserted-by":"publisher","first-page":"87562","DOI":"10.1109\/ACCESS.2020.2993191","volume":"8","author":"AH Osman","year":"2020","unstructured":"Osman AH, Barukub OM (2020) Graph-based text representation and matching: a review of the state of the art and future challenges. IEEE Access 8:87562\u201387583","journal-title":"IEEE Access"},{"key":"6283_CR8","doi-asserted-by":"crossref","unstructured":"Liu C, Chen C, Han J, Yu PS (2006) Gplag: detection of software plagiarism by program dependence graph analysis. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 872\u2013881","DOI":"10.1145\/1150402.1150522"},{"issue":"2","key":"6283_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/335191.335429","volume":"29","author":"J Cho","year":"2000","unstructured":"Cho J, Shivakumar N, Garcia-Molina H (2000) Finding replicated web collections. ACM Sigmod Rec 29(2):355\u2013366","journal-title":"ACM Sigmod Rec"},{"key":"6283_CR10","unstructured":"Milner R (1989) Communication and concurrency. Prentice hall Englewood Cliffs"},{"key":"6283_CR11","doi-asserted-by":"crossref","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2011) Capturing topology in graph pattern matching. arXiv preprint arXiv:1201.0229","DOI":"10.1145\/2187836.2187963"},{"key":"6283_CR12","doi-asserted-by":"crossref","unstructured":"Fard A, Nisar MU, Ramaswamy L, Miller JA, Saltz M (2013) A distributed vertex-centric approach for pattern matching in massive graphs. In: 2013 IEEE International Conference on Big Data, pp 403\u2013411 . IEEE","DOI":"10.1109\/BigData.2013.6691601"},{"issue":"1\u20132","key":"6283_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.14778\/1920841.1920878","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan W, Li J, Ma S, Tang N, Wu Y, Wu Y (2010) Graph pattern matching: from intractable to polynomial time. Proc VLDB Endow 3(1\u20132):264\u2013275","journal-title":"Proc VLDB Endow"},{"key":"6283_CR14","doi-asserted-by":"crossref","unstructured":"Wu X, Theodoratos D, Skoutas D, Lan M (2020) Leveraging double simulation to efficiently evaluate hybrid patterns on data graphs. In: International Conference on Web Information Systems Engineering, pp 255\u2013269. Springer","DOI":"10.1007\/978-3-030-62005-9_19"},{"key":"6283_CR15","doi-asserted-by":"crossref","unstructured":"Ma S, Cao Y, Huai J, Wo T (2012) Distributed graph pattern matching. In: Proceedings of the 21st International Conference on World Wide Web, pp 949\u2013958","DOI":"10.1145\/2187836.2187963"},{"issue":"12","key":"6283_CR16","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 (2014) Distributed graph simulation: impossibility and possibility. Proc VLDB Endow 7(12):1083\u20131094","journal-title":"Proc VLDB Endow"},{"key":"#cr-split#-6283_CR17.1","doi-asserted-by":"crossref","unstructured":"Sch\u00e4tzle A, Przyjaciel-Zablocki M, Berberich T, Lausen G (2016) S2x: graph-parallel querying of rdf with graphx. In: Biomedical Data Management and Graph Online Querying: VLDB 2015 Workshops, Big-O","DOI":"10.1007\/978-3-319-41576-5_12"},{"key":"#cr-split#-6283_CR17.2","unstructured":"(Q) and DMAH, Waikoloa, HI, USA, August 31-September 4, 2015, Revised Selected Papers 1, pp 155-168 . Springer"},{"key":"6283_CR18","doi-asserted-by":"crossref","unstructured":"Kao J-S, Chou J (2016) Distributed incremental pattern matching on streaming graphs. In: Proceedings of the ACM Workshop on High Performance Graph Processing, pp 43\u201350","DOI":"10.1145\/2915516.2915519"},{"key":"6283_CR19","doi-asserted-by":"crossref","unstructured":"Li J, Li J, Wang X (2018) A vertex-centric graph simulation algorithm for large graphs. In: Big Data: 6th CCF Conference, Big Data 2018, Xi\u2019an, China, October 11\u201313, 2018, Proceedings 6, pp 238\u2013254 . Springer","DOI":"10.1007\/978-981-13-2922-7_16"},{"issue":"4","key":"6283_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3282488","volume":"43","author":"W Fan","year":"2018","unstructured":"Fan W, Yu W, Xu J, Zhou J, Luo X, Yin Q, Lu P, Cao Y, Xu R (2018) Parallelizing sequential graph computations. ACM Trans Database Syst (TODS) 43(4):1\u201339","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"2","key":"6283_CR21","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1007\/s11227-021-03938-7","volume":"78","author":"S Bouhenni","year":"2022","unstructured":"Bouhenni S, Yahiaoui S, Nouali-Taboudjemat N, Kheddouci H (2022) Efficient parallel edge-centric approach for relaxed graph pattern matching. J Supercomput 78(2):1642\u20131671","journal-title":"J Supercomput"},{"issue":"1","key":"6283_CR22","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 (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"key":"6283_CR23","unstructured":"Cordella L.P, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp 149\u2013159"},{"issue":"7","key":"6283_CR24","first-page":"1","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici V, Giugno R, Pulvirenti A, Shasha D, Ferro A (2013) A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform 14(7):1\u201313","journal-title":"BMC Bioinform"},{"issue":"4","key":"6283_CR25","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2017","unstructured":"Carletti V, Foggia P, Saggese A, Vento M (2017) 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","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6283_CR26","unstructured":"Han W-S, Lee J, Lee J-H (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 337\u2013348"},{"key":"6283_CR27","doi-asserted-by":"crossref","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, pp 1199\u20131214","DOI":"10.1145\/2882903.2915236"},{"key":"6283_CR28","doi-asserted-by":"crossref","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. In: Proceedings of the 2019 International Conference on Management of Data, pp 1429\u20131446","DOI":"10.1145\/3299869.3319880"},{"issue":"1","key":"6283_CR29","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TKDE.2020.2980257","volume":"34","author":"S Sun","year":"2020","unstructured":"Sun S, Luo Q (2020) Subgraph matching with effective matching order and indexing. IEEE Trans Knowl Data Eng 34(1):491\u2013505","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6283_CR30","doi-asserted-by":"crossref","unstructured":"Lv L, Liu J, Li Q, Li J (2022) Optimization of subgraph matching over knowledge graph based on subgraph indexing. In: 2022 5th International Conference on Artificial Intelligence and Big Data (ICAIBD), pp 543\u2013546. IEEE","DOI":"10.1109\/ICAIBD55127.2022.9820592"},{"key":"6283_CR31","doi-asserted-by":"crossref","unstructured":"Archibald B, Dunlop F, Hoffmann R, McCreesh C, Prosser P, Trimble J (2019) Sequential and parallel solution-biased search for subgraph algorithms. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4\u20137, 2019, Proceedings 16, pp 20\u201338. Springer","DOI":"10.1007\/978-3-030-19212-9_2"},{"key":"6283_CR32","doi-asserted-by":"publisher","first-page":"61697","DOI":"10.1109\/ACCESS.2021.3073494","volume":"9","author":"ZA Ansari","year":"2021","unstructured":"Ansari ZA, Abulaish M et al (2021) An efficient subgraph isomorphism solver for large graphs. IEEE Access 9:61697\u201361709","journal-title":"IEEE Access"},{"issue":"10","key":"6283_CR33","doi-asserted-by":"publisher","first-page":"10511","DOI":"10.1007\/s11227-023-05061-1","volume":"79","author":"H Moayed","year":"2023","unstructured":"Moayed H, Mansoori EG, Moosavi MR (2023) An efficient pruning method for subgraph matching in large-scale graphs. J Supercomput 79(10):10511\u201310532","journal-title":"J Supercomput"},{"key":"6283_CR34","doi-asserted-by":"crossref","unstructured":"Raman R, Rest O, Hong S, Wu Z, Chafi H, Banerjee J (2014) Pgx. ISO: parallel and efficient in-memory engine for subgraph isomorphism. In: Proceedings of Workshop on GRAph Data Management Experiences and Systems, pp 1\u20136","DOI":"10.1145\/2621934.2621939"},{"issue":"3","key":"6283_CR35","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, Yang S (2016) Scalable distributed subgraph enumeration. Proc VLDB Endow 10(3):217\u2013228","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"6283_CR36","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(2):176\u2013188","journal-title":"Proc VLDB Endow"},{"key":"6283_CR37","doi-asserted-by":"crossref","unstructured":"Ammar K, McSherry F, Salihoglu S, Joglekar M (2018) Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows. arXiv preprint arXiv:1802.03760","DOI":"10.14778\/3184470.3184473"},{"key":"6283_CR38","doi-asserted-by":"crossref","unstructured":"Carletti V, Foggia P, Ritrovato P, Vento M, Vigilante V (2019) A parallel algorithm for subgraph isomorphism. In: Graph-Based Representations in Pattern Recognition: 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19\u201321, 2019, Proceedings 12, pp 141\u2013151. Springer","DOI":"10.1007\/978-3-030-20081-7_14"},{"key":"6283_CR39","doi-asserted-by":"crossref","unstructured":"Serafini M, De\u00a0Francisci\u00a0Morales G, Siganos G (2017) Qfrag: distributed graph search via subgraph isomorphism. In: Proceedings of the 2017 Symposium on Cloud Computing, pp 214\u2013228","DOI":"10.1145\/3127479.3131625"},{"key":"6283_CR40","doi-asserted-by":"crossref","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, pp 1447\u20131462","DOI":"10.1145\/3299869.3300086"},{"key":"6283_CR41","doi-asserted-by":"crossref","unstructured":"Sun S, Luo Q (2018) Parallelizing recursive backtracking based subgraph matching on a single machine. In: 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS), pp 1\u20139 . IEEE","DOI":"10.1109\/PADSW.2018.8644869"},{"key":"6283_CR42","doi-asserted-by":"crossref","unstructured":"Jin X, Lai L (2019) Mpmatch: a multi-core parallel subgraph matching algorithm. In: 2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW), pp 241\u2013248. IEEE","DOI":"10.1109\/ICDEW.2019.000-6"},{"key":"6283_CR43","doi-asserted-by":"crossref","unstructured":"Sun Z, Wang H, Wang H, Shao B, Li J (2012) Efficient subgraph matching on billion node graphs. arXiv preprint arXiv:1205.6691","DOI":"10.14778\/2311906.2311907"},{"issue":"4","key":"6283_CR44","doi-asserted-by":"publisher","first-page":"265","DOI":"10.14778\/2535570.2488333","volume":"6","author":"K Zeng","year":"2013","unstructured":"Zeng K, Yang J, Wang H, Shao B, Wang Z (2013) A distributed graph engine for web scale RDF data. Proc VLDB Endow 6(4):265\u2013276","journal-title":"Proc VLDB Endow"},{"key":"6283_CR45","doi-asserted-by":"crossref","unstructured":"Shao Y, Cui B, Chen L, Ma L, Yao J, Xu N (2014) Parallel subgraph listing in a large-scale graph. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp 625\u2013636","DOI":"10.1145\/2588555.2588557"},{"key":"6283_CR46","doi-asserted-by":"crossref","unstructured":"Gao J, Zhou C, Zhou J, Yu JX (2014) Continuous pattern detection over billion-edge graph using distributed framework. In: 2014 IEEE 30th International Conference on Data Engineering, pp 556\u2013567. IEEE","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"6283_CR47","doi-asserted-by":"crossref","unstructured":"Reza T, Klymko C, Ripeanu M, Sanders G, Pearce R (2017) Towards practical and robust labeled pattern matching in trillion-edge graphs. In: 2017 IEEE International Conference on Cluster Computing (CLUSTER), pp 1\u201312. IEEE","DOI":"10.1109\/CLUSTER.2017.85"},{"key":"6283_CR48","doi-asserted-by":"crossref","unstructured":"Reza T, Ripeanu M, Tripoul N, Sanders G, Pearce R (2018) Prunejuice: pruning trillion-edge graphs to a precise pattern-matching solution. In: SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pp 265\u2013281. IEEE","DOI":"10.1109\/SC.2018.00024"},{"key":"6283_CR49","doi-asserted-by":"crossref","unstructured":"Stein M, Fr\u00f6mmgen A, Kluge R, Wang L, Wilberg A, Koldehofe B, M\u00fchlh\u00e4user M (2018) Scaling topology pattern matching: A distributed approach. In: Proceedings of the 33rd Annual ACM Symposium on Applied Computing, pp 996\u20131005","DOI":"10.1145\/3167132.3167241"},{"key":"6283_CR50","doi-asserted-by":"crossref","unstructured":"Wang Z, Gu R, Hu W, Yuan C, Huang Y (2019) Benu: distributed subgraph enumeration with backtracking-based framework. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 136\u2013147. IEEE","DOI":"10.1109\/ICDE.2019.00021"},{"key":"6283_CR51","doi-asserted-by":"crossref","unstructured":"Wang Z, Hu W, Yuan C, Gu R, Huang Y (2020) Distributed subgraph enumeration via backtracking-based framework. arXiv preprint arXiv:2006.12819","DOI":"10.1109\/ICDE.2019.00021"},{"key":"6283_CR52","doi-asserted-by":"crossref","unstructured":"Yang Z, Lai L, Lin X, Hao K, Zhang W (2021) Huge: an efficient and scalable subgraph enumeration system. In: Proceedings of the 2021 International Conference on Management of Data, pp 2049\u20132062","DOI":"10.1145\/3448016.3457237"},{"key":"6283_CR53","doi-asserted-by":"crossref","unstructured":"Lin X, Zhang R, Wen Z, Wang H, Qi J (2014) Efficient subgraph matching using gpus. In: Databases Theory and Applications: 25th Australasian Database Conference, ADC 2014, Brisbane, QLD, Australia, July 14\u201316, 2014. Proceedings 25, pp 74\u201385. Springer","DOI":"10.1007\/978-3-319-08608-8_7"},{"key":"6283_CR54","doi-asserted-by":"crossref","unstructured":"Tran H.-N, Kim J-j, He B (2015) Fast subgraph matching on large graphs using graphics processors. In: Database Systems for Advanced Applications: 20th International Conference, DASFAA 2015, Hanoi, Vietnam, April 20\u201323, 2015, Proceedings, Part I 20, pp 299\u2013315. Springer","DOI":"10.1007\/978-3-319-18120-2_18"},{"key":"6283_CR55","doi-asserted-by":"crossref","unstructured":"Zeng L, Zou L, \u00d6zsu MT, Hu L, Zhang F (2020) Gsi: Gpu-friendly subgraph isomorphism. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp 1249\u20131260. IEEE","DOI":"10.1109\/ICDE48307.2020.00112"},{"issue":"9","key":"6283_CR56","doi-asserted-by":"publisher","first-page":"4231","DOI":"10.1109\/TKDE.2020.3035564","volume":"34","author":"W Guo","year":"2020","unstructured":"Guo W, Li Y, Tan K-L (2020) Exploiting reuse for gpu subgraph enumeration. IEEE Trans Knowl Data Eng 34(9):4231\u20134244","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6283_CR57","doi-asserted-by":"crossref","unstructured":"Guo W, Li Y, Sha M, He B, Xiao X, Tan K-L (2020) Gpu-accelerated subgraph enumeration on partitioned graphs. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 1067\u20131082","DOI":"10.1145\/3318464.3389699"},{"key":"6283_CR58","doi-asserted-by":"crossref","unstructured":"Chen J, Gu Y, Wang Q, Li C, Yu G (2020) Partition-oriented subgraph matching on gpu. In: Web and Big Data: 4th International Joint Conference, APWeb-WAIM 2020, Tianjin, China, September 18\u201320, 2020, Proceedings, Part I 4, pp 53\u201368. Springer","DOI":"10.1007\/978-3-030-60259-8_5"},{"key":"6283_CR59","doi-asserted-by":"crossref","unstructured":"Xiang L, Khan A, Serra E, Halappanavar M, Sukumaran-Rajam A (2021) cuts: scaling subgraph isomorphism on distributed multi-gpu systems using trie based data structure. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp 1\u201314","DOI":"10.1145\/3458817.3476214"},{"key":"6283_CR60","doi-asserted-by":"crossref","unstructured":"Wei Y, Jiang P (2022) Stmatch: accelerating graph pattern matching on gpu with stack-based loop optimizations. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pp 1\u201313","DOI":"10.1109\/SC41404.2022.00058"},{"key":"6283_CR61","doi-asserted-by":"crossref","unstructured":"Zeng L, Zou L, \u00d6zsu MT (2022) Sgsi\u2013a scalable gpu-friendly subgraph isomorphism algorithm. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2022.3230744"},{"issue":"2","key":"6283_CR62","first-page":"1","volume":"1","author":"X Sun","year":"2023","unstructured":"Sun X, Luo Q (2023) Efficient gpu-accelerated subgraph matching. Proc ACM Manag Data 1(2):1\u201326","journal-title":"Proc ACM Manag Data"},{"key":"6283_CR63","doi-asserted-by":"crossref","unstructured":"Sun S, Luo Q (2020) In-memory subgraph matching: an in-depth study. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 1083\u20131098","DOI":"10.1145\/3318464.3380581"},{"issue":"2","key":"6283_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3439724","volume":"54","author":"S Bouhenni","year":"2021","unstructured":"Bouhenni S, Yahiaoui S, Nouali-Taboudjemat N, Kheddouci H (2021) A survey on distributed graph pattern matching in massive graphs. ACM Comput Surv (CSUR) 54(2):1\u201335","journal-title":"ACM Comput Surv (CSUR)"},{"key":"6283_CR65","doi-asserted-by":"crossref","unstructured":"Henzinger MR, Henzinger TA, Kopke PW (1995) Computing simulations on finite and infinite graphs. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp 453\u2013462. IEEE","DOI":"10.1109\/SFCS.1995.492576"},{"issue":"3","key":"6283_CR66","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2489791","volume":"38","author":"W Fan","year":"2013","unstructured":"Fan W, Wang X, Wu Y (2013) Incremental graph pattern matching. ACM Trans Database Syst (TODS) 38(3):1\u201347","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"13","key":"6283_CR67","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.14778\/2536258.2536263","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan W, Wang X, Wu Y (2013) Diversified top-k graph pattern matching. Proc VLDB Endow 6(13):1510\u20131521","journal-title":"Proc VLDB Endow"},{"key":"6283_CR68","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"issue":"5","key":"6283_CR69","doi-asserted-by":"publisher","first-page":"4791","DOI":"10.1007\/s11227-022-04835-3","volume":"79","author":"A Benachour","year":"2023","unstructured":"Benachour A, Yahiaoui S, El Baz D, Nouali-Taboudjemat N, Kheddouci H (2023) Fast parallel algorithms for finding elementary circuits of a directed graph: a gpu-based approach. J Supercomput 79(5):4791\u20134819","journal-title":"J Supercomput"},{"key":"6283_CR70","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"6283_CR71","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-mat: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp 442\u2013446. SIAM","DOI":"10.1137\/1.9781611972740.43"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06283-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06283-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06283-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T23:27:39Z","timestamp":1732231659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06283-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,16]]},"references-count":72,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["6283"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06283-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,16]]},"assertion":[{"value":"4 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2024","order":2,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}