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)
Incoming Non-self Citations Over Time
Authors
- 1. Haichuan Shang (NICTA; University of New South Wales)
- 2. Ying Zhang (NICTA; University of New South Wales)
- 3. Xuemin Lin (NICTA; University of New South Wales)
- 4. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{shang_vldb08,
title = {{Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism}},
author = {Shang, Haichuan and Zhang, Ying and Lin, Xuemin and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '08},
volume = {1},
number = {1},
pages = {364--375},
doi = {10.14778/1453856.1453898},
url = {https://doi.org/10.14778/1453856.1453898},
year = {2008}
}Incoming Citations (Sorted by Pagerank)
Showing 20 of 70 citing papers.
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00027100548 |
| 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00021152829 |
| 591 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.0001603683 |
| 727 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00014565738 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,748 | Taming Subgraph Isomorphism for RDF Query Processing | 2015 | VLDB |
| 2 | 485 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD |
| 3 | 3,194 | GuP: Fast Subgraph Matching by Guard-based Pruning | 2023 | SIGMOD |
| 4 | 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 5 | 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD |
| 6 | 1,237 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD |
| 7 | 1,487 | Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs | 2015 | VLDB |
| 8 | 3,548 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB |
| 9 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 10 | 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |