Back to papers
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism
Summary: QuickSI: an efficient subgraph isomorphism tester that lowers verification cost in graph search. A feature-based index accelerates filtering for scalable retrieval from large graph collections; experiments show gains over prior methods.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 9681
- Venue
- VLDB
- Year
- 2008
- Pagerank
- 0.0001920234
- Overall Rank
- 612 | 95.75%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 20 of 70 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 7,934 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.613363e-05 |
| 8,726 |
GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases |
2010 |
SIGMOD |
4.4593116e-05 |
| 9,580 |
ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs |
2020 |
VLDB |
4.3234342e-05 |
| 9,730 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2942813e-05 |
| 9,764 |
View-based Explanations for Graph Neural Networks |
2024 |
SIGMOD |
4.2856106e-05 |
| 9,788 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
4.2818172e-05 |
| 9,845 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
4.2721228e-05 |
| 9,935 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2482599e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,096 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,199 |
R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
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,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,948 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1945683e-05 |
| 10,994 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
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 |
| 12,180 |
iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques |
2011 |
SIGMOD |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers