Performance and Scalability of Indexed Subgraph Query Processing Methods
Summary: Systematic empirical study of six indexed subgraph query methods (Grapes, CT-Index, GraphGrepSX, gIndex, Tree+Delta, gCode) over real (AIDS, PDBS, PCM, PPI) and synthetic graphs. Analyzes sensitivity to graph size, density, label diversity, dataset size, and query size to reveal index construction costs, query time, and false-positive behavior, with scalability insights. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,924 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD | 0.00010077055 |
| 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,646 | G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching | 2020 | SIGMOD | 6.8853079e-05 |
| 5,410 | PICASSO: Exploratory Search of Connected Subgraph Substructures in Graph Databases | 2017 | VLDB | 5.5235453e-05 |
| 5,521 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB | 5.4614637e-05 |
| 7,100 | BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification | 2023 | VLDB | 4.8326259e-05 |
| 7,775 | Graph Querying Meets HCI: State of the Art and Future Directions | 2017 | SIGMOD | 4.653773e-05 |
| 9,942 | VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases | 2022 | VLDB | 4.2456408e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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 |
| 612 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.0001920234 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 900 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00015495155 |
| 1,454 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011913289 |
| 2,438 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8214248e-05 |
| 3,720 | iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques | 2010 | VLDB | 6.8192237e-05 |
| 6,406 | Mining and Indexing Graphs for Supergraph Search | 2013 | VLDB | 5.0765917e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 350 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026365067 |
| 3,720 | iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques | 2010 | VLDB | 6.8192237e-05 |
| 506 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021475362 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027081079 |
| 2,438 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8214248e-05 |
| 1,635 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.0001105793 |
| 6,801 | Updating Graph Indices with a One-Pass Algorithm | 2015 | SIGMOD | 4.9226813e-05 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 203 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034889335 |
| 900 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00015495155 |