Database Paper Browser

Back to papers

Indexing for Subtree Similarity-Search using Edit Distance

Summary: First index structure for subtree similarity search under tree edit distance with a unit-cost model. Enables pruning-based, fast queries over large T, avoiding full-tree traversal; experiments show large speedups over prior traversal-based approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4649
Venue
SIGMOD
Year
2013
Pagerank
4.9217776e-05
Overall Rank
6,807 | 52.65%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,615 A Scalable Index for Top-k Subtree Similarity Queries 2019 SIGMOD 5.4101086e-05
6,241 Scaling Similarity Joins over Tree-Structured Data 2015 VLDB 5.1411469e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
73 XRANK: Ranked Keyword Search over XML Documents 2003 SIGMOD 0.00058443993
98 XMark: A Benchmark for XML Data Management 2002 VLDB 0.00050023808
3,301 RTED: A Robust Algorithm for the Tree Edit Distance 2012 VLDB 7.2515266e-05
5,273 Correlating XML Data Streams Using Tree-Edit Distance Embeddings 2003 PODS 5.5913399e-05
Previous Page 1 / 1 Next

Semantically Similar Papers