Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs
Summary: BoostIso exploits vertex relationships to prune duplicate work in backtracking-based subgraph isomorphism. Experiments on real graphs show speedups for existing algorithms, up to orders of magnitude on graphs with dense vertex relationships. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xuguang Ren (Griffith University)
- 2. Junhu Wang (Griffith University)
BibTeX Citation
@article{ren_vldb15,
title = {{Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs}},
author = {Ren, Xuguang and Wang, Junhu},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {9},
number = {8},
pages = {617--628},
doi = {10.14778/2935470.2935478},
url = {https://doi.org/10.14778/2935470.2935478},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 29 of 29 citing papers.
Previous
Page 1 / 1
Next
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 288 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022009138 |
| 356 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00020086045 |
| 439 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018247958 |
| 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018235529 |
| 485 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017479773 |
| 499 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017292147 |
| 563 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016294243 |
| 1,027 | D(K)-Index: An Adaptive Structural Summary for Graph-Structured Data | 2003 | SIGMOD | 0.00012391703 |
| 1,180 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.00011600363 |
| 1,376 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00010857788 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,486 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 2 | 4,835 | Taming Subgraph Isomorphism for RDF Query Processing | 2015 | VLDB |
| 3 | 439 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB |
| 4 | 952 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 5 | 658 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 6 | 5,224 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 7 | 1,907 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 8 | 485 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD |
| 9 | 3,771 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 10 | 1,180 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |