Database Paper Browser

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 50 of 70 citing papers.

Rank Citing Paper Year Venue Pagerank
506 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021475362
764 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017018712
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,285 Neighborhood Based Fast Graph Search in Large Networks 2011 SIGMOD 0.00012833377
1,333 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012523806
1,454 SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs 2010 VLDB 0.00011913289
1,561 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00011358946
1,635 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001105793
1,775 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010602927
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
2,007 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 9.8081235e-05
2,409 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.8776858e-05
2,525 Connected Substructure Similarity Search 2010 SIGMOD 8.5981082e-05
2,551 NeMa: Fast Graph Search with Label Similarity 2013 VLDB 8.5572574e-05
2,801 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.0992955e-05
2,912 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 7.9130459e-05
3,001 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 7.7404487e-05
3,036 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 7.6735171e-05
3,187 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.4136521e-05
3,604 Spatial and Temporal Constrained Ranked Retrieval over Videos 2022 VLDB 6.9301368e-05
3,641 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 6.8884895e-05
3,646 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 6.8853079e-05
3,720 iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques 2010 VLDB 6.8192237e-05
3,778 A Learned Sketch for Subgraph Counting 2021 SIGMOD 6.7747398e-05
3,862 A Partition-Based Approach to Structure Similarity Search 2014 VLDB 6.687769e-05
3,873 Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases 2012 VLDB 6.6779082e-05
4,072 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 6.4727847e-05
4,211 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.3563454e-05
4,459 Efficient Bi-triangle Counting for Large Bipartite Networks 2021 VLDB 6.1651553e-05
4,470 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 6.1557462e-05
4,494 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 6.1414196e-05
4,556 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0883757e-05
4,958 Efficient Subgraph Search over Large Uncertain Graphs 2011 VLDB 5.8031038e-05
4,968 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 5.7956205e-05
5,009 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 5.761237e-05
5,499 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 5.4750222e-05
5,521 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 5.4614637e-05
5,728 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 5.3507988e-05
5,854 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.3006473e-05
5,877 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 5.2916612e-05
5,926 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 5.271318e-05
6,081 Subgraph Matching over Graph Federation 2022 VLDB 5.2208051e-05
6,395 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.0829204e-05
6,406 Mining and Indexing Graphs for Supergraph Search 2013 VLDB 5.0765917e-05
6,441 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.0603113e-05
6,801 Updating Graph Indices with a One-Pass Algorithm 2015 SIGMOD 4.9226813e-05
7,100 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 4.8326259e-05
7,307 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 4.7674113e-05
7,641 Extending Graph Patterns with Conditions 2020 SIGMOD 4.6902655e-05
7,762 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 4.6583829e-05
Previous Page 1 / 2 Next

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
203 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00034889335
350 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00026365067
572 Substructure Similarity Search in Graph Databases 2005 SIGMOD 0.00019887011
900 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00015495155
Previous Page 1 / 1 Next

Semantically Similar Papers