TreeSpan: Efficiently Computing Similarity All-Matching
Summary: TreeSpan uses a spanning-tree cover QT to span all q subgraphs within theta; exact matching on each tree yields similarity matches. Approach blends with filtering, sharing, and ordered search, yielding 7 orders-of-magnitude speedups over prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Gaoping Zhu (University of New South Wales)
- 2. Xuemin Lin (University of New South Wales)
- 3. Ke Zhu (University of New South Wales)
- 4. Wenjie Zhang (University of New South Wales)
- 5. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{zhu_sigmod12,
title = {{TreeSpan: Efficiently Computing Similarity All-Matching}},
author = {Zhu, Gaoping and Lin, Xuemin and Zhu, Ke and Zhang, Wenjie and Yu, Jeffrey Xu},
series = {{SIGMOD} '12},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2213836.2213896},
url = {https://dl.acm.org/doi/10.1145/2213836.2213896},
year = {2012}
}
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,383 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB |
| 2 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 3 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 4 | 1,006 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 5 | 6,014 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB |
| 6 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 7 | 3,047 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD |
| 8 | 11,762 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 9 | 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 10 | 4,221 | Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs | 2008 | SIGMOD |