DBScholar

Back to papers

Scaling Similarity Joins over Tree-Structured Data

Summary: Dynamic decomposition of tree objects into threshold-guided subgraphs, enabling pruning without computing full tree edit distance when no common subgraph. Two-layer subgraph index yields scalable similarity joins, delivering up to an order-of-magnitude speedup over prior methods on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11181
Venue
VLDB
Year
2015
Pagerank
6.0084322e-05
Overall Rank
6,014 | 58.74%
DOI
10.14778/2809974.2809976

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{tang_vldb15,
        title = {{Scaling Similarity Joins over Tree-Structured Data}},
        author = {Tang, Yu and Cai, Yilun and Mamoulis, Nikos},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {11},
        doi = {10.14778/2809974.2809976},
        url = {https://doi.org/10.14778/2809974.2809976},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,886 Pass-Join: A Partition-based Method for Similarity Joins 2012 VLDB 9.5358137e-05
2,423 Algebraic Properties of Bag Data Types 1991 VLDB 8.6016807e-05
3,047 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.8155543e-05
3,165 RTED: A Robust Algorithm for the Tree Edit Distance 2012 VLDB 7.6759052e-05
3,522 A Partition-Based Approach to Structure Similarity Search 2014 VLDB 7.3491042e-05
6,947 Indexing for Subtree Similarity-Search using Edit Distance 2013 SIGMOD 5.7309645e-05
Previous Page 1 / 1 Next

Semantically Similar Papers