{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:12:23Z","timestamp":1784099543689,"version":"3.55.0"},"reference-count":104,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Franco-Algerian collaborative program PHC Tassili BiGreen N\u00b018 MDU 111"},{"DOI":"10.13039\/501100005307","name":"DGRSDT","doi-asserted-by":"crossref","award":["FNRSDT N\u00b0253"],"award-info":[{"award-number":["FNRSDT N\u00b0253"]}],"id":[{"id":"10.13039\/501100005307","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2022,3,31]]},"abstract":"<jats:p>Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed GPM models have emerged as they yield interesting results in a polynomial time. However, massive graphs generated by mostly social networks require a distributed storing and processing of the data over multiple machines, thus, requiring GPM to be revised by adopting new paradigms of big graphs processing, e.g., Think-Like-A-Vertex and its derivatives. This article discusses and proposes a classification of distributed GPM approaches with a narrow focus on the relaxed models.<\/jats:p>","DOI":"10.1145\/3439724","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T10:47:35Z","timestamp":1612954055000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["A Survey on Distributed Graph Pattern Matching in Massive Graphs"],"prefix":"10.1145","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1091-3909","authenticated-orcid":false,"given":"Sarra","family":"Bouhenni","sequence":"first","affiliation":[{"name":"Ecole nationale Sup\u00e9rieure d\u2019Informatique, Alg\u00e9rie and Universit\u00e9 de Lyon, Universit\u00e9 Lyon 1, LIRIS CNRS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1772-0579","authenticated-orcid":false,"given":"Sa\u00efd","family":"Yahiaoui","sequence":"additional","affiliation":[{"name":"CERIST, Centre de Recherche sur l\u2019Information Scientifique et Technique, Alg\u00e9rie"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadia","family":"Nouali-Taboudjemat","sequence":"additional","affiliation":[{"name":"CERIST, Centre de Recherche sur l\u2019Information Scientifique et Technique, Alg\u00e9rie"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, Universit\u00e9 Lyon 1, LIRIS CNRS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, Brisbane, QLD, 62--73","author":"Afrati Foto N.","unstructured":"Foto N. Afrati , Dimitris Fotakis , and Jeffrey D. Ullman . 2013. Enumerating subgraph instances using map-reduce . In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, Brisbane, QLD, 62--73 . Foto N. Afrati, Dimitris Fotakis, and Jeffrey D. Ullman. 2013. Enumerating subgraph instances using map-reduce. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, Brisbane, QLD, 62--73."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184473"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 2019 International Conference on Management of Data. ACM","author":"Bhattarai Bibek","unstructured":"Bibek Bhattarai , Hang Liu , and H. Howie Huang . 2019. Ceci: Compact embedding cluster index for scalable subgraph matching . In Proceedings of the 2019 International Conference on Management of Data. ACM , Amsterdam, Netherlands, 1447--1462. Bibek Bhattarai, Hang Liu, and H. Howie Huang. 2019. Ceci: Compact embedding cluster index for scalable subgraph matching. In Proceedings of the 2019 International Conference on Management of Data. ACM, Amsterdam, Netherlands, 1447--1462."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"e_1_2_1_6_1","first-page":"21","article-title":"The hadoop distributed file system: Architecture and design","volume":"11","author":"Borthakur Dhruba","year":"2007","unstructured":"Dhruba Borthakur . 2007 . The hadoop distributed file system: Architecture and design . Hadoop Project Website 11 , 2007 (2007), 21 . Dhruba Borthakur. 2007. The hadoop distributed file system: Architecture and design. Hadoop Project Website 11, 2007 (2007), 21.","journal-title":"Hadoop Project Website"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining. IEEE, IEEE","author":"Br\u00f6cheler M.","year":"2010","unstructured":"M. Br\u00f6cheler , A. Pugliese , and V. S. Subrahmanian . 2010. COSI: Cloud oriented subgraph identification in massive social networks . In Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining. IEEE, IEEE , Odense, Denmark, 248--255. DOI:https:\/\/doi.org\/10.1109\/ASONAM. 2010 .80 10.1109\/ASONAM.2010.80 M. Br\u00f6cheler, A. Pugliese, and V. S. Subrahmanian. 2010. COSI: Cloud oriented subgraph identification in massive social networks. In Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining. IEEE, IEEE, Odense, Denmark, 248--255. DOI:https:\/\/doi.org\/10.1109\/ASONAM.2010.80"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.06.025"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.07.001"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_17"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_2_1_13_1","unstructured":"The Apache Software Foundation. 2011. Apache Giraph. https:\/\/giraph.apache.org\/.  The Apache Software Foundation. 2011. Apache Giraph. https:\/\/giraph.apache.org\/."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 3rd IAPR Workshop on Graph-Based Representations in Pattern Recognition 219","author":"Cordella L. P.","year":"2001","unstructured":"L. P. Cordella , P. Foggia , C. Sansone , and M. Vento . 2001. An improved algorithm for matching large graphs . Proceedings of the 3rd IAPR Workshop on Graph-Based Representations in Pattern Recognition 219 , 2 ( 2001 ), 149--159. DOI:https:\/\/doi.org\/10.1.1.101.5342 L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. 2001. An improved algorithm for matching large graphs. Proceedings of the 3rd IAPR Workshop on Graph-Based Representations in Pattern Recognition 219, 2 (2001), 149--159. DOI:https:\/\/doi.org\/10.1.1.101.5342"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2018.8644869"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.11.008"},{"key":"e_1_2_1_20_1","volume-title":"Social Media Statistics 2020: Top Networks By the Numbers. Retrieved","author":"Dustin W. Stout","year":"2020","unstructured":"W. Stout Dustin . 2019. Social Media Statistics 2020: Top Networks By the Numbers. Retrieved March 1, 2020 from https:\/\/dustinstout.com\/social-media-statistics\/. W. Stout Dustin. 2019. Social Media Statistics 2020: Top Networks By the Numbers. Retrieved March 1, 2020 from https:\/\/dustinstout.com\/social-media-statistics\/."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2489791"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732983"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3282488"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.29268\/stbd.2014.1.1.1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691601"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3398682.3399162"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu159"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"e_1_2_1_33_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and intractability: A guide to NP-completeness . Michael R. Garey and David S. Johnson. 1979. Computers and intractability: A guide to NP-completeness."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610511"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201908)","author":"He Huahai","unstructured":"Huahai He and Ambuj K. Singh . 2008. Graphs-at-a-time: Query language and access methods for graph databases . In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201908) . ACM, Vancouver, Canada, 405--418. DOI:https:\/\/doi.org\/10.1145\/1376616.1376660 10.1145\/1376616.1376660 Huahai He and Ambuj K. Singh. 2008. Graphs-at-a-time: Query language and access methods for graph databases. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201908). ACM, Vancouver, Canada, 405--418. DOI:https:\/\/doi.org\/10.1145\/1376616.1376660"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492576"},{"key":"e_1_2_1_40_1","volume-title":"Eine Graphdatenbank f\u00fcr alle. Entwickler","author":"Hunger Michael","unstructured":"Michael Hunger . 2014. Neo4j 2.0 : Eine Graphdatenbank f\u00fcr alle. Entwickler . Press, Eltville , Germany . Michael Hunger. 2014. Neo4j 2.0: Eine Graphdatenbank f\u00fcr alle. Entwickler. Press, Eltville, Germany."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2762294"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2915516.2915519"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_2_1_45_1","volume-title":"Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong.","author":"Kim Kyoungmin","year":"2018","unstructured":"Kyoungmin Kim , In Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong. 2018 . Turboflux : A fast continuous subgraph matching system for streaming graph data. In Proceedings of the 2018 International Conference on Management of Data. ACM, Houston, TX , 411--426. Kyoungmin Kim, In Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong. 2018. Turboflux: A fast continuous subgraph matching system for streaming graph data. In Proceedings of the 2018 International Conference on Management of Data. ACM, Houston, TX, 411--426."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2794367.2794368"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132992"},{"key":"e_1_2_1_51_1","volume-title":"Big Data","author":"Li Jingdong","unstructured":"Jingdong Li , Jin Li , and Xiaoling Wang . 2018. A vertex-centric graph simulation algorithm for large graphs . In Big Data , Zongben Xu, Xinbo Gao, Qiguang Miao, Yunquan Zhang, and Jiajun Bu (Eds.). Springer , Singapore , 238--254. Jingdong Li, Jin Li, and Xiaoling Wang. 2018. A vertex-centric graph simulation algorithm for large graphs. In Big Data, Zongben Xu, Xinbo Gao, Qiguang Miao, Yunquan Zhang, and Jiajun Bu (Eds.). Springer, Singapore, 238--254."},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201906)","author":"Liu Chao","unstructured":"Chao Liu , Chen Chen , Jiawei Han , and Philip S. Yu . 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 (KDD\u201906) . ACM, New York, 872--881. DOI:https:\/\/doi.org\/10.1145\/1150402.1150522 10.1145\/1150402.1150522 Chao Liu, Chen Chen, Jiawei Han, and Philip S. Yu. 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 (KDD\u201906). ACM, New York, 872--881. DOI:https:\/\/doi.org\/10.1145\/1150402.1150522"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095690"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187963"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_2_1_58_1","volume-title":"Discovering patterns in social networks with graph matching algorithms","author":"Ogaard Kirk","unstructured":"Kirk Ogaard , Heather Roy , Sue Kase , Rakesh Nagi , Kedar Sambhoos , and Moises Sudit . 2013. Discovering patterns in social networks with graph matching algorithms . In Social Computing, Behavioral-Cultural Modeling and Prediction, Ariel M. Greenberg, William G. Kennedy, and Nathan D. Bos (Eds.). Springer , Berlin , 341--349. Kirk Ogaard, Heather Roy, Sue Kase, Rakesh Nagi, Kedar Sambhoos, and Moises Sudit. 2013. Discovering patterns in social networks with graph matching algorithms. In Social Computing, Behavioral-Cultural Modeling and Prediction, Ariel M. Greenberg, William G. Kennedy, and Nathan D. Bos (Eds.). Springer, Berlin, 341--349."},{"key":"e_1_2_1_59_1","unstructured":"R. Pearce. 2012. Highly Asynchronous VisitOr Queue Graph Toolkit. Retrieved from https:\/\/www.osti.gov\/\/servlets\/purl\/1231683.  R. Pearce. 2012. Highly Asynchronous VisitOr Queue Graph Toolkit. Retrieved from https:\/\/www.osti.gov\/\/servlets\/purl\/1231683."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0415-0"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.10.005"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149198"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021929"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2017.85"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380566"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00024"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_2_1_70_1","volume-title":"Biomedical Data Management and Graph Online Querying","author":"Sch\u00e4tzle Alexander","unstructured":"Alexander Sch\u00e4tzle , Martin Przyjaciel-Zablocki , Thorsten Berberich , and Georg Lausen . 2016. S2X: Graph-parallel querying of RDF with GraphX . In Biomedical Data Management and Graph Online Querying , Fusheng Wang, Gang Luo, Chunhua Weng, Arijit Khan, Prasenjit Mitra, and Cong Yu (Eds.). Springer International Publishing , Cham , 155--168. Alexander Sch\u00e4tzle, Martin Przyjaciel-Zablocki, Thorsten Berberich, and Georg Lausen. 2016. S2X: Graph-parallel querying of RDF with GraphX. In Biomedical Data Management and Graph Online Querying, Fusheng Wang, Gang Luo, Chunhua Weng, Arijit Khan, Prasenjit Mitra, and Cong Yu (Eds.). Springer International Publishing, Cham, 155--168."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3131625"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.07.009"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2017.69"},{"key":"e_1_2_1_77_1","volume-title":"Euro-Par 2014 Parallel Processing, Fernando Silva, In\u00eas Dutra, and V\u00edtor Santos Costa (Eds.)","author":"Simmhan Yogesh","unstructured":"Yogesh Simmhan , Alok Kumbhare , Charith Wickramaarachchi , Soonil Nagarkar , Santosh Ravi , Cauligi Raghavendra , and Viktor Prasanna . 2014. GoFFish: A sub-graph centric framework for large-scale graph analytics . In Euro-Par 2014 Parallel Processing, Fernando Silva, In\u00eas Dutra, and V\u00edtor Santos Costa (Eds.) . Springer International Publishing , Cham , 451--462. Yogesh Simmhan, Alok Kumbhare, Charith Wickramaarachchi, Soonil Nagarkar, Santosh Ravi, Cauligi Raghavendra, and Viktor Prasanna. 2014. GoFFish: A sub-graph centric framework for large-scale graph analytics. In Euro-Par 2014 Parallel Processing, Fernando Silva, In\u00eas Dutra, and V\u00edtor Santos Costa (Eds.). Springer International Publishing, Cham, 451--462."},{"key":"e_1_2_1_78_1","first-page":"n2","article-title":"Scaling topology pattern matching: A distributed approach","volume":"1","author":"Stein Michael","year":"2018","unstructured":"Michael Stein , Alexander Fr\u00f6mmgen , Roland Kluge , Lin Wang , Augustin Wilberg , Boris Koldehofe , and Max M\u00fchlh\u00e4user . 2018 . Scaling topology pattern matching: A distributed approach . Self 1 (2018), n2 . Michael Stein, Alexander Fr\u00f6mmgen, Roland Kluge, Lin Wang, Augustin Wilberg, Boris Koldehofe, and Max M\u00fchlh\u00e4user. 2018. Scaling topology pattern matching: A distributed approach. Self 1 (2018), n2.","journal-title":"Self"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_2_1_80_1","first-page":"2980257","article-title":"Subgraph matching with effective matching order and indexing","volume":"2020","author":"Sun Shixuan","year":"2020","unstructured":"Shixuan Sun and Qiong Luo . 2020 . Subgraph matching with effective matching order and indexing . IEEE Transactions on Knowledge and Data Engineering (2020), 1--1. DOI:https:\/\/doi.org\/10.1109\/TKDE. 2020 . 2980257 10.1109\/TKDE.2020.2980257 Shixuan Sun and Qiong Luo. 2020. Subgraph matching with effective matching order and indexing. IEEE Transactions on Knowledge and Data Engineering (2020), 1--1. DOI:https:\/\/doi.org\/10.1109\/TKDE.2020.2980257","journal-title":"DOI:https:\/\/doi.org\/10.1109\/TKDE."},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18120-2_18"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_87_1","volume-title":"Leapfrog Triejoin: A worst-case optimal join algorithm. arxiv:cs.DB\/1210.0481","author":"Veldhuizen Todd L.","year":"2012","unstructured":"Todd L. Veldhuizen . 2012 . Leapfrog Triejoin: A worst-case optimal join algorithm. arxiv:cs.DB\/1210.0481 Todd L. Veldhuizen. 2012. Leapfrog Triejoin: A worst-case optimal join algorithm. arxiv:cs.DB\/1210.0481"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.002"},{"key":"e_1_2_1_89_1","volume-title":"Parallel algorithms for flexible pattern matching on big graphs. Information Sciences 436--437","author":"Wang Hongzhi","year":"2018","unstructured":"Hongzhi Wang , Ning Li , Jianzhong Li , and Hong Gao . 2018. Parallel algorithms for flexible pattern matching on big graphs. Information Sciences 436--437 ( 2018 ), 418--440. DOI:https:\/\/doi.org\/10.1016\/j.ins.2018.01.018 10.1016\/j.ins.2018.01.018 Hongzhi Wang, Ning Li, Jianzhong Li, and Hong Gao. 2018. Parallel algorithms for flexible pattern matching on big graphs. Information Sciences 436--437 (2018), 418--440. DOI:https:\/\/doi.org\/10.1016\/j.ins.2018.01.018"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.036"},{"key":"e_1_2_1_91_1","volume-title":"Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201918)","author":"Wang Kai","year":"2018","unstructured":"Kai Wang , Zhiqiang Zuo , John Thorpe , Tien Quang Nguyen , and Guoqing Harry Xu . 2018 . Rstream: Marrying relational algebra with streaming for efficient graph mining on a single machine . In Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201918) . USENIX Association, Carlsbad, CA, 763--782. Kai Wang, Zhiqiang Zuo, John Thorpe, Tien Quang Nguyen, and Guoqing Harry Xu. 2018. Rstream: Marrying relational algebra with streaming for efficient graph mining on a single machine. In Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201918). USENIX Association, Carlsbad, CA, 763--782."},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00021"},{"key":"e_1_2_1_93_1","unstructured":"Maria Winans Dave Faupel Amber Armstrong Jay Henderson Ellen Valentine Loren McDonald Dave Walters Jeremy Waite Michael Trapani and Elizabeth Magill. 2016. 10 Key Marketing Trends for 2017 and Ideas for Exceeding Customer Expectations. 18 pages. ftp:\/\/ftp.www.ibm.com\/software\/in\/pdf\/10_Key_Marketing_Trends_for_2017.pdf.  Maria Winans Dave Faupel Amber Armstrong Jay Henderson Ellen Valentine Loren McDonald Dave Walters Jeremy Waite Michael Trapani and Elizabeth Magill. 2016. 10 Key Marketing Trends for 2017 and Ideas for Exceeding Customer Expectations. 18 pages. ftp:\/\/ftp.www.ibm.com\/software\/in\/pdf\/10_Key_Marketing_Trends_for_2017.pdf."},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680832433"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904488"},{"key":"e_1_2_1_99_1","volume-title":"Proceedings of the 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE","author":"Yan Da","unstructured":"Da Yan , Guimu Guo , Md Mashiur Rahman Chowdhury , M. Tamer \u00d6zsu , Wei-Shinn Ku , and John C. S. Lui . 2020. G-thinker: A distributed framework for mining subgraphs in a big graph . In Proceedings of the 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE , Dallas, TX, 1369--1380. Da Yan, Guimu Guo, Md Mashiur Rahman Chowdhury, M. Tamer \u00d6zsu, Wei-Shinn Ku, and John C. S. Lui. 2020. G-thinker: A distributed framework for mining subgraphs in a big graph. In Proceedings of the 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, Dallas, TX, 1369--1380."},{"key":"e_1_2_1_100_1","unstructured":"Da Yan Yuzhen Huang James Cheng and Huanhuan Wu. 2016. Efficient Processing of Very Large Graphs in a Small Cluster. arxiv:cs.DC\/1601.05590  Da Yan Yuzhen Huang James Cheng and Huanhuan Wu. 2016. Efficient Processing of Very Large Graphs in a Small Cluster. arxiv:cs.DC\/1601.05590"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488333"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/6749561"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00674-0"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_2_1_106_1","first-page":"377","article-title":"MOCgraph: Scalable distributed graph processing using message online computing","volume":"8","author":"Zhou Chang","year":"2014","unstructured":"Chang Zhou , Jun Gao , Binbin Sun , and Jeffrey Xu Yu . 2014 . MOCgraph: Scalable distributed graph processing using message online computing . VLDB 8 , 4 (2014), 377 -- 388 . DOI:https:\/\/doi.org\/10.14778\/2735496.2735501 10.14778\/2735496.2735501 Chang Zhou, Jun Gao, Binbin Sun, and Jeffrey Xu Yu. 2014. MOCgraph: Scalable distributed graph processing using message online computing. VLDB 8, 4 (2014), 377--388. DOI:https:\/\/doi.org\/10.14778\/2735496.2735501","journal-title":"VLDB"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3439724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3439724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:52Z","timestamp":1750197712000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3439724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":104,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3,31]]}},"alternative-id":["10.1145\/3439724"],"URL":"https:\/\/doi.org\/10.1145\/3439724","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"2020-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}