RTED: A Robust Algorithm for the Tree Edit Distance
Summary: RTED delivers a robust tree edit distance for ordered labeled trees, eliminating worst-case unpredictability. LRH-wise, RTED is worst-case optimal with competitive asymptotics; experiments on synthetic and real data favor it against the state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mateusz Pawlik (Free University of Bolzano)
- 2. Nikolaus Augsten (Free University of Bolzano)
BibTeX Citation
@article{pawlik_vldb12,
title = {{RTED: A Robust Algorithm for the Tree Edit Distance}},
author = {Pawlik, Mateusz and Augsten, Nikolaus},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {4},
pages = {334--345},
doi = {10.14778/2095686.2095691},
url = {https://doi.org/10.14778/2095686.2095691},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,338 | On Repairing Structural Problems In Semi-structured Data | 2013 | VLDB | 6.2609275e-05 |
| 6,014 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 6.0084322e-05 |
| 6,947 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD | 5.7309645e-05 |
| 7,476 | SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins | 2023 | VLDB | 5.6090634e-05 |
| 7,748 | To Not Miss the Forest for the Trees - A Holistic Approach for Explaining Missing Answers over Nested Data | 2021 | SIGMOD | 5.5528084e-05 |
| 11,224 | X-TED: Massive Parallelization of Tree Edit Distance | 2024 | VLDB | 5.093636e-05 |
| 12,021 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB | 5.093636e-05 |
| 12,286 | Synthetising Changes in XML Documents as PULs | 2013 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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,496 | Change Detection in Hierarchically Structured Information | 1996 | SIGMOD | 0.00010569165 |
| 2,699 | Approximate XML Joins | 2002 | SIGMOD | 8.2433011e-05 |
| 3,047 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.8155543e-05 |
| 5,061 | Comparing Hierarchical Data in External Memory | 1999 | VLDB | 6.3801057e-05 |
| 7,559 | An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data | 2006 | VLDB | 5.5985266e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,832 | A Scalable Index for Top-k Subtree Similarity Queries | 2019 | SIGMOD |
| 2 | 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD |
| 3 | 10,764 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD |
| 4 | 2,036 | Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance | 2010 | SIGMOD |
| 5 | 12,021 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 6 | 5,332 | Correlating XML Data Streams Using Tree-Edit Distance Embeddings | 2003 | PODS |
| 7 | 5,061 | Comparing Hierarchical Data in External Memory | 1999 | VLDB |
| 8 | 6,947 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD |
| 9 | 11,224 | X-TED: Massive Parallelization of Tree Edit Distance | 2024 | VLDB |
| 10 | 3,047 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD |