TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases
Summary: TurboISO delivers ultra-fast, robust subgraph isomorphism for large graphs via on-the-fly candidate region exploration that locates embeddings and stabilizes per-region order. COMB/PERM uses neighborhood equivalence classes (NEC) to enumerate combinations, prune permutations, and deliver speedups on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wook-Shin Han (Kyungpook National University)
- 2. Jinsoo Lee (Kyungpook National University)
- 3. Jeong-Hoon Lee (Kyungpook National University)
BibTeX Citation
@inproceedings{han_sigmod13,
title = {{TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases}},
author = {Han, Wook-Shin and Lee, Jinsoo and Lee, Jeong-Hoon},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2465300},
url = {https://dl.acm.org/doi/10.1145/2463676.2465300},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 75 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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 |
| 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 |
| 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018197688 |
| 736 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00014363536 |
| 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.00011627329 |
| 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 | 5,218 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 2 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 3 | 5,477 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 4 | 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 5 | 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 6 | 438 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB |
| 7 | 4,817 | Taming Subgraph Isomorphism for RDF Query Processing | 2015 | VLDB |
| 8 | 3,767 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 9 | 1,506 | Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs | 2015 | VLDB |
| 10 | 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |