Database Paper Browser

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
10993
Venue
VLDB
Year
2015
Pagerank
5.1411469e-05
Overall Rank
6,241 | 56.59%
DOI
-

Incoming Non-self Citations Over Time

Authors

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
2,395 Algebraic Properties of Bag Data Types 1991 VLDB 8.8998019e-05
2,592 Pass-Join: A Partition-based Method for Similarity Joins 2012 VLDB 8.4795761e-05
3,199 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.3927291e-05
3,301 RTED: A Robust Algorithm for the Tree Edit Distance 2012 VLDB 7.2515266e-05
3,862 A Partition-Based Approach to Structure Similarity Search 2014 VLDB 6.687769e-05
6,807 Indexing for Subtree Similarity-Search using Edit Distance 2013 SIGMOD 4.9217776e-05
Previous Page 1 / 1 Next

Semantically Similar Papers