A Partition-Based Approach to Structure Similarity Search
Summary: Partition-based, var-size partitions convert edit-distance search to graph containment for candidate generation, addressing vertex degrees. Adds pruning, improved GED, and cost-aware partitioning, yielding gains vs fixed-substructure methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiang Zhao (University of New South Wales)
- 2. Chuan Xiao (Nagoya University)
- 3. Xuemin Lin (East China Normal University; University of New South Wales)
- 4. Qing Liu (Commonwealth Scientific and Industrial Research Organisation)
- 5. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@article{zhao_vldb14,
title = {{A Partition-Based Approach to Structure Similarity Search}},
author = {Zhao, Xiang and Xiao, Chuan and Lin, Xuemin and Liu, Qing and Zhang, Wenjie},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {3},
pages = {169--180},
doi = {10.14778/2732232.2732235},
url = {https://doi.org/10.14778/2732232.2732235},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,293 | How to Build Templates for RDF Question/Answering —An Uncertain Graph Similarity Join Approach | 2015 | SIGMOD | 6.1908657e-05 |
| 6,140 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 5.8708494e-05 |
| 7,208 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD | 5.5836037e-05 |
| 8,237 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 5.3697463e-05 |
| 9,245 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB | 5.2032182e-05 |
| 9,332 | Semantic SPARQL Similarity Search Over RDF Knowledge Graphs | 2016 | VLDB | 5.1917722e-05 |
| 9,576 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB | 5.154741e-05 |
| 9,907 | Scalable Graph Convolutional Network Training on Distributed-Memory Systems | 2023 | VLDB | 5.1092231e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 438 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018278591 |
| 489 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017440023 |
| 601 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00015725619 |
| 1,133 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00011892544 |
| 1,247 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011348258 |
| 2,238 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.7738068e-05 |
| 2,701 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.114832e-05 |
| 3,369 | Connected Substructure Similarity Search | 2010 | SIGMOD | 7.3663492e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,934 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB |
| 2 | 9,576 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB |
| 3 | 3,110 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD |
| 4 | 176 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD |
| 5 | 4,140 | Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs | 2016 | SIGMOD |
| 6 | 1,866 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB |
| 7 | 12,456 | Leveraging Graph Dimensions in Online Graph Search | 2015 | VLDB |
| 8 | 11,062 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB |
| 9 | 601 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD |
| 10 | 3,369 | Connected Substructure Similarity Search | 2010 | SIGMOD |