Zhijie Zhang
Skip Abstract Section
Abstract
Subgraph matching is a fundamental problem in graph analysis. In recent years, many subgraph matching algorithms have been proposed, making it pressing and challenging to compare their performance and identify their strengths and weaknesses. We observe that (1) The embedding enumeration in the classic filtering-ordering-enumerating framework dominates the overall performance, and thus enhancing the backtracking paradigm is becoming a current research trend; (2) Simply changing the limitation of output size results in a substantial variation in the ranking of different methods, leading to biased performance evaluation; (3) The techniques employed at different stages of subgraph matching interact with each other, making it less feasible to replace and evaluate a single technique in isolation. Therefore, a comprehensive survey and experimental study of subgraph matching is necessary to identify the current trends, ensure unbiasedness, and investigate the potential interactions. In this paper, we comprehensively review the methods in the current trend and experimentally confirm their advantage over prior approaches. We unbiasedly evaluate the performance of these algorithms by using an effective metric, namely embeddings per second. To fully investigate the interactions between various techniques, we select 10 representative techniques for each stage and evaluate all the feasible combinations.
- Christopher R. Aberger, Andrew Lamb, Susan Tu, Andres Nötzli, Kunle Olukotun, and Christopher Ré. 2017. Empty-Headed: A Relational Engine for Graph Processing. ACM Trans. Database Syst. 42, 4, Article 20 (oct 2017), 44 pages. https://doi.org/10.1145/3129246Google Scholar
Digital Library
- Noga Alon, Raphael Yuster, and Uri Zwick. 1995. Color-Coding. J. ACM 42, 4 (jul 1995), 844--856. https://doi.org/10.1145/210332.210337Google ScholarDigital Library
- Khaled Ammar, Frank McSherry, Semih Salihoglu, and Manas Joglekar. 2018. Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows. Proceedings of the VLDB Endowment (2018).Google Scholar
- Junya Arai, Yasuhiro Fujiwara, and Makoto Onizuka. 2023. GuP: Fast Subgraph Matching by Guard-Based Pruning. Proc. ACM Manag. Data 1, 2, Article 167 (jun 2023), 26 pages. https://doi.org/10.1145/3589312Google ScholarDigital Library
- Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, and Geoffrey Washburn. 2015. Design and Implementation of the LogicBlox System. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (Melbourne, Victoria, Australia) (SIGMOD '15). Association for Computing Machinery, New York, NY, USA, 1371--1382. https://doi.org/10.1145/2723372.2742796Google ScholarDigital Library
- 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 (Amsterdam, Netherlands) (SIGMOD '19). Association for Computing Machinery, New York, NY, USA, 1447--1462.Google Scholar
- Fei Bi, Lijun Chang, Xuemin Lin, Lu Qin, and Wenjie Zhang. 2016. Efficient Subgraph Matching by Postponing Cartesian Products. In Proceedings of the 2016 International Conference on Management of Data (San Francisco, California, USA) (SIGMOD '16). Association for Computing Machinery, New York, NY, USA, 1199--1214. https://doi.org/10.1145/2882903.2915236Google ScholarDigital Library
- Vincenzo Bonnici, Alfredo Ferro, Rosalba Giugno, Alfredo Pulvirenti, and Dennis Shasha. 2010. Enhancing Graph Database Indexing by Suffix Tree Structure. In Proceedings of the 5th IAPR International Conference on Pattern Recognition in Bioinformatics (Nijmegen, The Netherlands) (PRIB'10). Springer-Verlag, Berlin, Heidelberg, 195--203.Google ScholarDigital Library
- Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis Shasha, and Alfredo Ferro. 2013. A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinformatics 14, 7 (22 Apr 2013), S13. https://doi.org/10.1186/1471--2105--14-S7-S13Google ScholarCross Ref
- Antoine Bordes, Nicolas Usunier, Alberto Garcia-Durán, Jason Weston, and Oksana Yakhnenko. 2013. Translating Embeddings for Modeling Multi-Relational Data. In Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2 (Lake Tahoe, Nevada) (NIPS'13). Curran Associates Inc., Red Hook, NY, USA, 2787--2795.Google ScholarDigital Library
- Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, and Mario Vento. 2018. Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3. IEEE Transactions on Pattern Analysis and Machine Intelligence 40, 4 (2018), 804--818. https://doi.org/10.1109/TPAMI.2017.2696940Google ScholarCross Ref
- Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. Society for Industrial and Applied Mathematics, 442--446. https://doi.org/10.1137/1.9781611972740.43 0.Google ScholarCross Ref
- Peter Pin-Shan Chen. 1976. The Entity-Relationship Model-toward a Unified View of Data. ACM Trans. Database Syst. 1, 1 (mar 1976), 9--36. https://doi.org/10.1145/320434.320440Google ScholarDigital Library
- Xuhao Chen, Roshan Dathathri, Gurbinder Gill, Loc Hoang, and Keshav Pingali. 2021. Sandslash: A Two-Level Framework for Efficient Graph Pattern Mining. In Proceedings of the ACM International Conference on Supercomputing (Virtual Event, USA) (ICS '21). Association for Computing Machinery, New York, NY, USA, 378--391. https://doi.org/10.1145/3447818.3460359Google ScholarDigital Library
- Xuhao Chen, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. 2020. Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU. Proc. VLDB Endow. 13, 8 (apr 2020), 1190--1205. https://doi.org/10.14778/3389133.3389137Google ScholarDigital Library
- Xuhao Chen, Tianhao Huang, Shuotao Xu, Thomas Bourgeat, Chanwoo Chung, and Arvind Arvind. 2021. FlexMiner: A Pattern-Aware Accelerator for Graph Pattern Mining. In 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA). 581--594. https://doi.org/10.1109/ISCA52012.2021.00052Google ScholarDigital Library
- Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno, Misael Mongiovì, Alfredo Pulvirenti, and Dennis Shasha. 2010. SING: Subgraph search In Non-homogeneous Graphs. BMC Bioinformatics 11, 1 (19 Feb 2010), 96. https://doi.org/10.1186/1471--2105--11--96Google ScholarCross Ref
- Vinicius Dias, Carlos H. C. Teixeira, Dorgival Guedes, Wagner Meira, and Srinivasan Parthasarathy. 2019. Fractal: A General-Purpose Graph Pattern Mining System. In Proceedings of the 2019 International Conference on Management of Data (Amsterdam, Netherlands) (SIGMOD '19). Association for Computing Machinery, New York, NY, USA, 1357--1374. https://doi.org/10.1145/3299869.3319875Google ScholarDigital Library
- Wenfei Fan. 2012. Graph Pattern Matching Revised for Social Network Analysis. In Proceedings of the 15th International Conference on Database Theory (Berlin, Germany) (ICDT '12). Association for Computing Machinery, New York, NY, USA, 8--21. https://doi.org/10.1145/2274576.2274578Google ScholarDigital Library
- Wenfei Fan, Tao He, Longbin Lai, Xue Li, Yong Li, Zhao Li, Zhengping Qian, Chao Tian, Lei Wang, Jingbo Xu, Youyang Yao, Qiang Yin, Wenyuan Yu, Jingren Zhou, Diwen Zhu, and Rong Zhu. 2021. GraphScope: A Unified Engine for Big Graph Processing. Proc. VLDB Endow. 14, 12 (jul 2021), 2879--2892. https://doi.org/10.14778/3476311.3476369Google ScholarDigital Library
- Milton Friedman. 1937. The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance. J. Amer. Statist. Assoc. 32, 200 (1937), 675--701. https://doi.org/10.1080/01621459.1937.10503522 arXiv:https://www.tandfonline.com/doi/pdf/10.1080/01621459.1937.10503522Google ScholarCross Ref
- Michael R. Garey and David S. Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA.Google ScholarDigital Library
- Rosalba Giugno, Vincenzo Bonnici, Nicola Bombieri, Alfredo Pulvirenti, Alfredo Ferro, and Dennis Shasha. 2013. Grapes: A software for parallel searching on biological graphs targeting multi-core architectures. PloS one 8, 10 (2013), e76911.Google ScholarCross Ref
- Wentian Guo, Yuchen Li, and Kian-Lee Tan. 2022. Exploiting Reuse for GPU Subgraph Enumeration. IEEE Transactions on Knowledge and Data Engineering 34, 9 (2022), 4231--4244. https://doi.org/10.1109/TKDE.2020.3035564Google ScholarCross Ref
- Myoungji Han, Hyunjoon Kim, Geonmo Gu, Kunsoo Park, and Wook Shin Han. 2019. Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together. In SIGMOD 2019 - Proceedings of the 2019 International Conference on Management of Data. 1429--1446.Google ScholarDigital Library
- Wook-Shin Han, Jinsoo Lee, and Jeong-Hoon Lee. 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 (New York, New York, USA) (SIGMOD '13). Association for Computing Machinery, New York, NY, USA, 337--348. https://doi.org/10.1145/2463676.2465300Google ScholarDigital Library
- W. K. Hastings. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 1 (04 1970), 97--109. https://doi.org/10.1093/biomet/57.1.97 arXiv:https://academic.oup.com/biomet/article-pdf/57/1/97/23940249/57--1--97.pdfGoogle ScholarCross Ref
- 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 (Vancouver, Canada) (SIGMOD '08). Association for Computing Machinery, New York, NY, USA, 405--418. https://doi.org/10.1145/1376616.1376660Google ScholarDigital Library
- Maarten Houbraken, Sofie Demeyer, Tom Michoel, Pieter Audenaert, Didier Colle, and Mario Pickavet. 2014. The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration. PLOS ONE 9, 5 (05 2014), 1--15. https://doi.org/10.1371/journal.pone.0097896Google ScholarCross Ref
- Kasra Jamshidi, Rakesh Mahadasa, and Keval Vora. 2020. Peregrine: A Pattern-Aware Graph Mining System. In Proceedings of the Fifteenth European Conference on Computer Systems (Heraklion, Greece) (EuroSys '20). Association for Computing Machinery, New York, NY, USA, Article 13, 16 pages. https://doi.org/10.1145/3342195.3387548Google ScholarDigital Library
- Tatiana Jin, Boyang Li, Yichao Li, Qihui Zhou, Qianli Ma, Yunjian Zhao, Hongzhi Chen, and James Cheng. 2023. Circinus: Fast Redundancy-Reduced Subgraph Matching. Proc. ACM Manag. Data 1, 1, Article 12 (may 2023), 26 pages. https://doi.org/10.1145/3588692Google ScholarDigital Library
- Xin Jin and Longbin Lai. 2019. MPMatch: A Multi-core Parallel Subgraph Matching Algorithm. In 2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW). 241--248. https://doi.org/10.1109/ICDEW.2019.000--6Google ScholarCross Ref
- Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, and You Peng. 2021. FAST: FPGA-based Subgraph Matching on Massive Graphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). 1452--1463. https://doi.org/10.1109/ICDE51399.2021.00129Google ScholarCross Ref
- Alpár Jüttner and Péter Madarasi. 2018. VF2-An improved subgraph isomorphism algorithm. Discrete Applied Mathematics 242 (2018), 69--81. https://doi.org/10.1016/j.dam.2018.02.018 Computational Advances in Combinatorial Optimization.Google ScholarCross Ref
- Alpár Jüttner and Péter Madarasi. 2018. VF2-An improved subgraph isomorphism algorithm. Discrete Applied Mathematics 242 (2018), 69--81. https://doi.org/10.1016/j.dam.2018.02.018 Computational Advances in Combinatorial Optimization.Google ScholarCross Ref
- Chathura Kankanamge, Siddhartha Sahu, Amine Mhedbhi, Jeremy Chen, and Semih Salihoglu. 2017. Graphflow: An Active Graph Database. In Proceedings of the 2017 ACM International Conference on Management of Data (Chicago, Illinois, USA) (SIGMOD '17). Association for Computing Machinery, New York, NY, USA, 1695--1698. https://doi.org/10.1145/3035918.3056445Google ScholarDigital Library
- Farzad Khorasani, Rajiv Gupta, and Laxmi N. Bhuyan. 2015. Scalable SIMD-Efficient Graph Processing on GPUs. In Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT '15). 39--50.Google Scholar
- Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, and Wook-Shin Han. 2021. Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. In Proceedings of the 2021 International Conference on Management of Data (Virtual Event, China) (SIGMOD '21). Association for Computing Machinery, New York, NY, USA, 925--937. https://doi.org/10.1145/3448016.3457265Google ScholarDigital Library
- Hyeonji Kim, Juneyoung Lee, Sourav S. Bhowmick, Wook-Shin Han, JeongHoon Lee, Seongyun Ko, and Moath H.A. Jarrah. 2016. DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine. In Proceedings of the 2016 International Conference on Management of Data (San Francisco, California, USA) (SIGMOD '16). Association for Computing Machinery, New York, NY, USA, 1231--1245. https://doi.org/10.1145/2882903.2915209Google ScholarDigital Library
- Jinha Kim, Hyungyu Shin, Wook-Shin Han, Sungpack Hong, and Hassan Chafi. 2015. Taming Subgraph Isomorphism for RDF Query Processing. Proc. VLDB Endow. 8, 11 (jul 2015), 1238--1249. https://doi.org/10.14778/2809974.2809985Google ScholarDigital Library
- 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. 411--426.Google Scholar
- Raphael Kimmig, Henning Meyerhenke, and Darren Strash. 2017. Shared Memory Parallel Subgraph Enumeration. 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2017), 519--529.Google Scholar
- Karsten Klein, Nils Kriege, and Petra Mutzel. 2011. CT-Index: Fingerprint-Based Graph Indexing Combining Cycles and Trees. In Proceedings of the 2011 IEEE 27th International Conference on Data Engineering (ICDE '11). IEEE Computer Society, USA, 1115--1126. https://doi.org/10.1109/ICDE.2011.5767909Google ScholarDigital Library
- Longbin Lai, Lu Qin, Xuemin Lin, and Lijun Chang. 2015. Scalable subgraph enumeration in mapreduce. Proceedings of the VLDB Endowment 8, 10 (2015), 974--985.Google ScholarDigital Library
- Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang, and Shiyu Yang. 2016. Scalable distributed subgraph enumeration. Proceedings of the VLDB Endowment 10, 3 (2016), 217--228.Google ScholarDigital Library
- Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, et al . 2019. Distributed subgraph matching on timely dataflow. Proceedings of the VLDB Endowment 12, 10 (2019), 1099--1112.Google ScholarDigital Library
- Jinsoo Lee, Wook-Shin Han, Romans Kasperovics, and Jeong-Hoon Lee. 2012. An In-Depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases. Proc. VLDB Endow. 6, 2 (dec 2012), 133--144. https://doi.org/10.14778/2535568.2448946Google ScholarDigital Library
- Guanfeng Li, Li Yan, and Zongmin Ma. 2019. An approach for approximate subgraph matching in fuzzy RDF graph. Fuzzy Sets and Systems 376 (2019), 106--126. https://doi.org/10.1016/j.fss.2019.02.021 Theme: Computer Science.Google ScholarDigital Library
- TingHuai Ma, Siyang Yu, Jie Cao, Yuan Tian, Abdullah Al-Dhelaan, and Mznah Al-Rodhaan. 2018. A Comparative Study of Subgraph Matching Isomorphic Methods in Social Networks. IEEE Access 6 (2018), 66621--66631. https://doi.org/10.1109/ACCESS.2018.2875262Google ScholarCross Ref
- Grzegorz Malewicz, Matthew H. Austern, Aart J.C Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: A System for Large-Scale Graph Processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data (Indianapolis, Indiana, USA) (SIGMOD '10). Association for Computing Machinery, New York, NY, USA, 135--146. https://doi.org/10.1145/1807167.1807184Google ScholarDigital Library
- Daniel Mawhirter and Bo Wu. 2019. AutoMine: Harmonizing High-Level Abstraction and High Performance for Graph Mining. In Proceedings of the 27th ACM Symposium on Operating Systems Principles (Huntsville, Ontario, Canada) (SOSP '19). Association for Computing Machinery, New York, NY, USA, 509--523. https://doi.org/10.1145/3341301.3359633Google ScholarDigital Library
- Ciaran McCreesh, Patrick Prosser, Christine Solnon, and James Trimble. 2018. When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. J. Artif. Int. Res. 61, 1 (jan 2018), 723--759.Google Scholar
- Robert Ryan McCune, Tim Weninger, and Greg Madey. 2015. Thinking Like a Vertex: A Survey of Vertex-Centric Frameworks for Large-Scale Distributed Graph Processing. ACM Comput. Surv. 48, 2, Article 25 (oct 2015), 39 pages. https://doi.org/10.1145/2818185Google ScholarDigital Library
- Amine Mhedhbi and Semih Salihoglu. 2019. Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins. Proc. VLDB Endow. 12, 11 (jul 2019), 1692--1704. https://doi.org/10.14778/3342263.3342643Google ScholarDigital Library
- Seunghwan Min, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, and Wook-Shin Han. 2021. Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. Proc. VLDB Endow. 14, 8 (2021), 1298--1310.Google ScholarDigital Library
- Peter Bjorn Nemenyi. 1963. Distribution-free multiple comparisons. Princeton University.Google Scholar
- Hung Q. Ngo. 2018. Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (Houston, TX, USA) (PODS '18). Association for Computing Machinery, New York, NY, USA, 111--124. https://doi.org/10.1145/3196959.3196990Google ScholarDigital Library
- Hung Q Ngo, Ely Porat, Christopher Ré, and Atri Rudra. 2012. Worst-case optimal join algorithms. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. 37--48.Google ScholarDigital Library
- H. Q. Ngo, C Ré, and A. Rudra. 2014. Skew Strikes Back: New Developments in the Theory of Join Algorithms. Acm Sigmod Record 42, 4 (2014), 5--16.Google ScholarDigital Library
- Jorge Pérez, Marcelo Arenas, and Claudio Gutierrez. 2009. Semantics and Complexity of SPARQL. ACM Trans. Database Syst. 34, 3, Article 16 (sep 2009), 45 pages. https://doi.org/10.1145/1567274.1567278Google ScholarDigital Library
- Miao Qiao, Hao Zhang, and Hong Cheng. 2017. Subgraph matching: on compression and computation. Proceedings of the VLDB Endowment 11, 2 (2017), 176--188.Google ScholarDigital Library
- Xiafei Qiu, Wubin Cen, Zhengping Qian, You Peng, Ying Zhang, Xuemin Lin, and Jingren Zhou. 2018. Real-Time Constrained Cycle Detection in Large Dynamic Graphs. Proc. VLDB Endow. 11, 12 (aug 2018), 1876--1888. https://doi.org/10.14778/3229863.3229874Google ScholarDigital Library
- Abdul Quamar, Amol Deshpande, and Jimmy Lin. 2016. NScale: Neighborhood-Centric Large-Scale Graph Analytics in the Cloud. The VLDB Journal 25, 2 (apr 2016), 125--150. https://doi.org/10.1007/s00778-015-0405--2Google ScholarDigital Library
- Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva, David Aparicio, and Fernando Silva. 2021. A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets. ACM Comput. Surv. 54, 2, Article 28 (mar 2021), 36 pages. https://doi.org/10.1145/3433652Google ScholarDigital Library
- Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, and M. Tamer Özsu. 2017. The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing. Proc. VLDB Endow. 11, 4 (dec 2017), 420--431.Google ScholarDigital Library
- Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, and M. Tamer Özsu. 2018. The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing. Proc. VLDB Endow. 11, 4 (oct 2018), 420--431. https://doi.org/10.1145/3164135.3164139Google ScholarCross Ref
- Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar, and Umit V. Catalyurek. 2015. Finding the Hierarchy of Dense Subgraphs Using Nucleus Decompositions. In Proceedings of the 24th International Conference on World Wide Web (Florence, Italy) (WWW '15). International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, 927--937. https://doi.org/10.1145/2736277.2741640Google ScholarDigital Library
- C. Seshadhri. 2023. Some Vignettes on Subgraph Counting Using Graph Orientations. In 26th International Conference on Database Theory (ICDT 2023) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 255), Floris Geerts and Brecht Vandevoort (Eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 3:1--3:10. https://doi.org/10.4230/LIPIcs.ICDT.2023.3Google ScholarCross Ref
- Yingxia Shao, Bin Cui, Lei Chen, Lin Ma, Junjie Yao, and Ning Xu. 2014. Parallel subgraph listing in a large-scale graph. In Proceedings of the 2014 ACM SIGMOD international conference on Management of Data. 625--636.Google ScholarDigital Library
- Tianhui Shi, Mingshu Zhai, Yi Xu, and Jidong Zhai. 2020. GraphPi: High Performance Graph Pattern Matching through Effective Redundancy Elimination. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (Atlanta, Georgia) (SC '20). IEEE Press, Article 100, 14 pages.Google Scholar
- Richard M. Stallman and Gerald J. Sussman. 1976. Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. Artif. Intell. 9 (1976), 135--196.Google ScholarCross Ref
- Shixuan Sun, Yulin Che, Lipeng Wang, and Qiong Luo. 2019. Efficient Parallel Subgraph Enumeration on a Single Machine. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). 232--243. https://doi.org/10.1109/ICDE.2019.00029Google ScholarCross Ref
- Shixuan Sun and Qiong Luo. 2019. Scaling up subgraph query processing with efficient subgraph matching. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 220--231.Google ScholarCross Ref
- Shixuan Sun and Qiong Luo. 2020. In-Memory Subgraph Matching: An In-Depth Study. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data (Portland, OR, USA) (SIGMOD '20). Association for Computing Machinery, New York, NY, USA, 1083--1098. https://doi.org/10.1145/3318464.3380581Google ScholarDigital Library
- Shixuan Sun, Xibo Sun, Yulin Che, Qiong Luo, and Bingsheng He. 2020. RapidMatch: A Holistic Approach to Subgraph Query Processing. Proc. VLDB Endow. 14, 2 (oct 2020), 176--188. https://doi.org/10.14778/3425879.3425888Google ScholarDigital Library
- Shixuan Sun, Xibo Sun, Bingsheng He, and Qiong Luo. 2022. RapidFlow: An Efficient Approach to Continuous Subgraph Matching. Proc. VLDB Endow. 15, 11 (jul 2022), 2415--2427. https://doi.org/10.14778/3551793.3551803Google ScholarDigital Library
- Xibo Sun and Qiong Luo. 2023. Efficient GPU-Accelerated Subgraph Matching. Proc. ACM Manag. Data 1, 2, Article 181 (jun 2023), 26 pages. https://doi.org/10.1145/3589326Google ScholarDigital Library
- Zhao Sun, Hongzhi Wang, Haixun Wang, Bin Shao, and Jianzhong Li. 2012. Efficient subgraph matching on billion node graphs. Proceedings of the VLDB Endowment (2012).Google ScholarDigital Library
- Carlos H. C. Teixeira, Alexandre J. Fonseca, Marco Serafini, Georgos Siganos, Mohammed J. Zaki, and Ashraf Aboulnaga. 2015. Arabesque: A System for Distributed Graph Mining. In Proceedings of the 25th Symposium on Operating Systems Principles (Monterey, California) (SOSP '15). Association for Computing Machinery, New York, NY, USA, 425--440. https://doi.org/10.1145/2815400.2815410Google ScholarDigital Library
- Priyansh Trivedi, Gaurav Maheshwari, Mohnish Dubey, and Jens Lehmann. 2017. Lc-quad: A corpus for complex question answering over knowledge graphs. In International Semantic Web Conference. Springer, 210--218.Google ScholarDigital Library
- J. R. Ullmann. 1976. An Algorithm for Subgraph Isomorphism. J. ACM 23, 1 (jan 1976), 31--42. https://doi.org/10.1145/321921.321925Google ScholarDigital Library
- T. Veldhuizen. 2014. Triejoin: A Simple, Worst-Case Optimal Join Algorithm. In ICDT.Google Scholar
- Todd L Veldhuizen. 2012. Leapfrog triejoin: a worst-case optimal join algorithm. arXiv preprint arXiv:1210.0481 (2012).Google Scholar
- Carletti Vincenzo, Pasquale Foggia, Pierluigi Ritrovato, Mario Vento, and Vincenzo Vigilante. 2019. A Parallel Algorithm for Subgraph Isomorphism. 141--151. https://doi.org/10.1007/978--3-030--20081--7_14Google ScholarCross Ref
- 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 Conference on Operating Systems Design and Implementation (Carlsbad, CA, USA) (OSDI'18). USENIX Association, USA, 763--782.Google Scholar
- Zhaokang Wang, Rong Gu, Weiwei Hu, Chunfeng Yuan, and Yihua Huang. 2019. BENU: Distributed subgraph enumeration with backtracking-based framework. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 136--147.Google ScholarCross Ref
- Zhaokang Wang, Weiwei Hu, Guowang Chen, Chunfeng Yuan, Rong Gu, and Yihua Huang. 2021. Towards Efficient Distributed Subgraph Enumeration Via Backtracking-Based Framework. IEEE Transactions on Parallel and Distributed Systems 32, 12 (2021), 2953--2969. https://doi.org/10.1109/TPDS.2021.3076246Google ScholarCross Ref
- Lizhi Xiang, Arif Khan, Edoardo Serra, Mahantesh Halappanavar, and Aravind Sukumaran-Rajam. 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 (St. Louis, Missouri) (SC '21). Association for Computing Machinery, New York, NY, USA, Article 69, 14 pages. https://doi.org/10.1145/3458817.3476214Google ScholarDigital Library
- Su Xunbin, Lin Yinnian, and Lei Zou. 2023. FASI: FPGA-friendly Subgraph Isomorphism on Massive Graphs. In 2023 IEEE 39th International Conference on Data Engineering (ICDE).Google Scholar
- Da Yan, Yingyi Bu, Yuanyuan Tian, and Amol Deshpande. 2017. Big graph analytics platforms. Foundations and Trends in Databases 7, 1--2 (2017), 1--195.Google ScholarDigital Library
- Da Yan, Yingyi Bu, Yuanyuan Tian, Amol Deshpande, and James Cheng. 2016. Big Graph Analytics Systems. In Proceedings of the 2016 International Conference on Management of Data (San Francisco, California, USA) (SIGMOD '16). Association for Computing Machinery, New York, NY, USA, 2241--2243. https://doi.org/10.1145/2882903.2912566Google ScholarDigital Library
- Da Yan, James Cheng, Kai Xing, Yi Lu, Wilfred Ng, and Yingyi Bu. 2014. Pregel: A Distributed Graph Computing Framework with Effective Message Reduction. The Chinese University of Hong Kong, Hong Kong, China. http://www.cse.cuhk.edu.hk/pregelplus/Google Scholar
- Da Yan, Guimu Guo, Md Mashiur Rahman Chowdhury, M. Tamer Özsu, Wei-Shinn Ku, and John C. S. Lui. 2020. G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). 1369--1380. https://doi.org/10.1109/ICDE48307.2020.00122Google ScholarCross Ref
- Xifeng Yan, Philip S. Yu, and Jiawei Han. 2004. Graph Indexing: A Frequent Structure-Based Approach. In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (Paris, France) (SIGMOD '04). Association for Computing Machinery, New York, NY, USA, 335--346. https://doi.org/10.1145/1007568.1007607Google ScholarDigital Library
- Rongjian Yang, Zhijie Zhang, Weiguo Zheng, and Jeffrey Xu Yu. 2023. Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction. Proc. ACM Manag. Data 1, 1, Article 15 (may 2023), 26 pages. https://doi.org/10.1145/3588695Google ScholarDigital Library
- Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, and Wenjie Zhang. 2021. HUGE: An Efficient and Scalable Subgraph Enumeration System. In Proceedings of the 2021 International Conference on Management of Data (Virtual Event, China) (SIGMOD '21). Association for Computing Machinery, New York, NY, USA, 2049--2062. https://doi.org/10.1145/3448016.3457237Google ScholarDigital Library
- Li Zeng, Lei Zou, M. Tamer Özsu, Lin Hu, and Fan Zhang. 2020. GSI: GPU-friendly Subgraph Isomorphism. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). 1249--1260. https://doi.org/10.1109/ICDE48307.2020.00112Google ScholarCross Ref
- Yuejia Zhang, Weiguo Zheng, Zhijie Zhang, Peng Peng, and Xuecang Zhang. 2022. Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). 1031--1043. https://doi.org/10.1109/ICDE53745.2022.00082Google ScholarCross Ref
- Yuejia Zhang, Weiguo Zheng, Zhijie Zhang, Peng Peng, and Xuecang Zhang. 2022. Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). 1031--1043. https://doi.org/10.1109/ICDE53745.2022.00082Google ScholarCross Ref
- Cheng Zhao, Zhibin Zhang, Peng Xu, Tianqi Zheng, and Jiafeng Guo. 2020. Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). 673--684. https://doi.org/10.1109/ICDE48307.2020.00064Google ScholarCross Ref
- Peixiang Zhao, Jeffrey Xu Yu, and Philip S. Yu. 2007. Graph Indexing: Tree Delta >= Graph. In Proceedings of the 33rd International Conference on Very Large Data Bases (Vienna, Austria) (VLDB '07). VLDB Endowment, 938--949.Google Scholar
Index Terms
- A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
Recommendations
Circinus: Fast Redundancy-Reduced Subgraph Matching
PACMMODSubgraph matching is one of the most important problems in graph analytics. Many algorithms and systems have been proposed for subgraph matching. Most of these works follow Ullmann's backtracking approach as it is memory-efficient in handling an ...
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
SIGMOD '19: Proceedings of the 2019 International Conference on Management of DataSubgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph analysis. Extensive research has been done to develop practical solutions for subgraph matching. The state-of-the-art algorithms such as \textsfCFL-Match and \...
A subgraph matching algorithm based on subgraph index for knowledge graph
AbstractThe problem of subgraph matching is one fundamental issue in graph search, which is NP-Complete problem. Recently, subgraph matching has become a popular research topic in the field of knowledge graph analysis, which has a wide range of ...
Comments