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
- 2. Chuan Xiao
- 3. Xuemin Lin
- 4. Qing Liu
- 5. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,323 | How to Build Templates for RDF Question/Answering —An Uncertain Graph Similarity Join Approach | 2015 | SIGMOD | 6.281058e-05 |
| 6,240 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 5.1362097e-05 |
| 6,835 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD | 4.9065543e-05 |
| 8,072 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 4.5890162e-05 |
| 9,057 | Semantic SPARQL Similarity Search Over RDF Knowledge Graphs | 2016 | VLDB | 4.3997447e-05 |
| 9,596 | Scalable Graph Convolutional Network Training on Distributed-Memory Systems | 2023 | VLDB | 4.3150788e-05 |
| 10,700 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB | 4.1905499e-05 |
| 10,704 | S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |
| 616 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00019068362 |
| 749 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017193776 |
| 949 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.0001510288 |
| 1,444 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011941836 |
| 2,402 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.87387e-05 |
| 2,524 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5993622e-05 |
| 2,557 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5484449e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,588 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB | 8.4872437e-05 |
| 10,704 | S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB | 4.1905499e-05 |
| 3,206 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3855924e-05 |
| 202 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034881375 |
| 4,739 | Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs | 2016 | SIGMOD | 5.9515822e-05 |
| 2,118 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB | 9.5036922e-05 |
| 11,969 | Leveraging Graph Dimensions in Online Graph Search | 2015 | VLDB | 4.1905499e-05 |
| 10,320 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB | 4.1905499e-05 |
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |
| 2,524 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5993622e-05 |