Connected Substructure Similarity Search
Summary: Proposes GrafD-Index for connected substructure search, indexing graphs by feature-distance and deriving a tight distance-triangle inequality. Derives bounds to prune candidates and accelerate verification, with strong experimental gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Haichuan Shang
- 2. Xuemin Lin
- 3. Ying Zhang
- 4. Jeffrey Xu Yu
- 5. Wei Wang
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,402 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.87387e-05 |
| 2,418 | VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework | 2013 | CIDR | 8.8499974e-05 |
| 3,864 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.6813849e-05 |
| 5,593 | GBLENDER: Visual Subgraph Query Formulation Meets Query Processing | 2011 | SIGMOD | 5.4172045e-05 |
| 6,080 | Pigeonring: A Principle for Faster Thresholded Similarity Search | 2019 | VLDB | 5.219249e-05 |
| 6,835 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD | 4.9065543e-05 |
| 7,292 | Data-driven Visual Graph Query Interface Construction and Maintenance: Challenges and Opportunities | 2016 | VLDB | 4.7676734e-05 |
| 11,477 | MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces | 2021 | SIGMOD | 4.1905499e-05 |
| 11,650 | CATAPULT: Data-driven Selection of Canned Patterns for Efficient Visual Graph Query Formulation | 2019 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 202 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034881375 |
| 351 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026351742 |
| 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 |
| 895 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00015498104 |
| 949 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.0001510288 |
| 2,432 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8247178e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,969 | Leveraging Graph Dimensions in Online Graph Search | 2015 | VLDB | 4.1905499e-05 |
| 6,835 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD | 4.9065543e-05 |
| 10,704 | S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB | 4.1905499e-05 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.673504e-05 |
| 202 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034881375 |
| 6,386 | Mining and Indexing Graphs for Supergraph Search | 2013 | VLDB | 5.0820608e-05 |
| 2,432 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8247178e-05 |
| 3,864 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.6813849e-05 |
| 4,959 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.7992713e-05 |
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |