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
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,845 | On Repairing Structural Problems In Semi-structured Data | 2013 | VLDB | 6.7073366e-05 |
| 6,241 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 5.1411469e-05 |
| 6,807 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD | 4.9217776e-05 |
| 7,215 | SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins | 2023 | VLDB | 4.7985991e-05 |
| 7,678 | To Not Miss the Forest for the Trees - A Holistic Approach for Explaining Missing Answers over Nested Data | 2021 | SIGMOD | 4.6813062e-05 |
| 11,013 | X-TED: Massive Parallelization of Tree Edit Distance | 2024 | VLDB | 4.1945683e-05 |
| 11,818 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB | 4.1945683e-05 |
| 12,089 | Synthetising Changes in XML Documents as PULs | 2013 | VLDB | 4.1945683e-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,390 | Change Detection in Hierarchically Structured Information | 1996 | SIGMOD | 0.00012248349 |
| 2,784 | Approximate XML Joins | 2002 | SIGMOD | 8.128931e-05 |
| 3,199 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3927291e-05 |
| 4,941 | Comparing Hierarchical Data in External Memory | 1999 | VLDB | 5.8179899e-05 |
| 6,732 | An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data | 2006 | VLDB | 4.9477058e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,615 | A Scalable Index for Top-k Subtree Similarity Queries | 2019 | SIGMOD | 5.4101086e-05 |
| 8,069 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 4.5934204e-05 |
| 10,487 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD | 4.1945683e-05 |
| 2,376 | Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance | 2010 | SIGMOD | 8.9424361e-05 |
| 11,818 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB | 4.1945683e-05 |
| 5,273 | Correlating XML Data Streams Using Tree-Edit Distance Embeddings | 2003 | PODS | 5.5913399e-05 |
| 4,941 | Comparing Hierarchical Data in External Memory | 1999 | VLDB | 5.8179899e-05 |
| 6,807 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD | 4.9217776e-05 |
| 11,013 | X-TED: Massive Parallelization of Tree Edit Distance | 2024 | VLDB | 4.1945683e-05 |
| 3,199 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3927291e-05 |