Back to papers
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)
- Paper ID
- 4707
- Venue
- SIGMOD
- Year
- 2013
- Pagerank
- 0.00017018712
- Overall Rank
- 764 | 94.69%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 22 of 72 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 9,934 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
4.2496728e-05 |
| 9,935 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2482599e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,139 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,308 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.1945683e-05 |
| 10,632 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,708 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,848 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
4.1945683e-05 |
| 10,851 |
Mix & Match: Subgraph Matching for Absolute Coverage |
2025 |
VLDB |
4.1945683e-05 |
| 10,979 |
Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching |
2024 |
SIGMOD |
4.1945683e-05 |
| 10,994 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,469 |
Graph Iso/Auto-morphism: A Divide-&-Conquer Approach |
2021 |
SIGMOD |
4.1945683e-05 |
| 11,565 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1945683e-05 |
| 11,570 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
4.1945683e-05 |
| 11,598 |
IDAR: Fast Supergraph Search Using DAG Integration |
2020 |
VLDB |
4.1945683e-05 |
| 11,734 |
PANDA: A System for Partial Topology-based Search on Large Networks |
2018 |
VLDB |
4.1945683e-05 |
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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,521 |
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks |
2021 |
VLDB |
5.4614637e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 5,854 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.3006473e-05 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 5,877 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2916612e-05 |
| 4,494 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1414196e-05 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 1,635 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.0001105793 |