Back to papers
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)
- Paper ID
- 4552
- Venue
- SIGMOD
- Year
- 2012
- Pagerank
- 8.87387e-05
- Overall Rank
- 2,402 | 83.31%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 3,864 |
A Partition-Based Approach to Structure Similarity Search |
2014 |
VLDB |
6.6813849e-05 |
| 5,017 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
5.7505967e-05 |
| 6,313 |
QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks |
2013 |
SIGMOD |
5.1108902e-05 |
| 6,835 |
Boosting Graph Similarity Search through Pre-Computation |
2021 |
SIGMOD |
4.9065543e-05 |
| 6,965 |
BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks |
2018 |
SIGMOD |
4.8759021e-05 |
| 7,456 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.7205339e-05 |
| 7,761 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6543114e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1905499e-05 |
| 10,715 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1905499e-05 |
| 11,569 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1905499e-05 |
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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1905499e-05 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 6,240 |
Scaling Similarity Joins over Tree-Structured Data |
2015 |
VLDB |
5.1362097e-05 |
| 11,563 |
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees |
2020 |
SIGMOD |
4.1905499e-05 |
| 3,206 |
Similarity Evaluation on Tree-structured Data |
2005 |
SIGMOD |
7.3855924e-05 |
| 11,569 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1905499e-05 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 4,143 |
Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs |
2008 |
SIGMOD |
6.4096394e-05 |