An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases
Summary: Re-implements five state-of-the-art subgraph isomorphism algorithms in a unified code base and benchmarks them on real-world datasets. Reveals surprising empirical results, including performance gaps tied to implementation choices and reproducibility concerns in graph-query evaluation. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jinsoo Lee (Kyungpook National University)
- 2. Wook-Shin Han (Kyungpook National University)
- 3. Romans Kasperovics (Kyungpook National University)
- 4. Jeong-Hoon Lee (Kyungpook National University)
BibTeX Citation
@article{lee_vldb13,
title = {{An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases}},
author = {Lee, Jinsoo and Han, Wook-Shin and Kasperovics, Romans and Lee, Jeong-Hoon},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {2},
pages = {133--144},
doi = {10.14778/2732232.2732239},
url = {https://doi.org/10.14778/2732232.2732239},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 37 of 37 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 176 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00026700508 |
| 192 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00025659453 |
| 288 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00021969641 |
| 332 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00020765078 |
| 355 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00020124083 |
| 438 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018286607 |
| 736 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00014363536 |
| 1,374 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00010880336 |
| 3,499 | iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques | 2010 | VLDB | 7.2549774e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,014 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 2 | 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 3 | 4,817 | Taming Subgraph Isomorphism for RDF Query Processing | 2015 | VLDB |
| 4 | 1,180 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD |
| 5 | 5,218 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 6 | 3,506 | Performance and Scalability of Indexed Subgraph Query Processing Methods | 2015 | VLDB |
| 7 | 438 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB |
| 8 | 1,506 | Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs | 2015 | VLDB |
| 9 | 490 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD |
| 10 | 3,767 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |