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.7008873e-05 |
| 6,240 | Scaling Similarity Joins over Tree-Structured Data | 2015 | VLDB | 5.1362097e-05 |
| 6,805 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD | 4.9170518e-05 |
| 7,215 | SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins | 2023 | VLDB | 4.7939964e-05 |
| 7,678 | To Not Miss the Forest for the Trees - A Holistic Approach for Explaining Missing Answers over Nested Data | 2021 | SIGMOD | 4.6768157e-05 |
| 11,016 | X-TED: Massive Parallelization of Tree Edit Distance | 2024 | VLDB | 4.1905499e-05 |
| 11,826 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB | 4.1905499e-05 |
| 12,097 | Synthetising Changes in XML Documents as PULs | 2013 | VLDB | 4.1905499e-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,391 | Change Detection in Hierarchically Structured Information | 1996 | SIGMOD | 0.00012236889 |
| 2,786 | Approximate XML Joins | 2002 | SIGMOD | 8.1223413e-05 |
| 3,206 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3855924e-05 |
| 4,943 | Comparing Hierarchical Data in External Memory | 1999 | VLDB | 5.8123762e-05 |
| 6,734 | An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data | 2006 | VLDB | 4.9434384e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,624 | A Scalable Index for Top-k Subtree Similarity Queries | 2019 | SIGMOD | 5.4049016e-05 |
| 8,072 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 4.5890162e-05 |
| 10,497 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD | 4.1905499e-05 |
| 2,387 | Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance | 2010 | SIGMOD | 8.9075095e-05 |
| 11,826 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB | 4.1905499e-05 |
| 5,277 | Correlating XML Data Streams Using Tree-Edit Distance Embeddings | 2003 | PODS | 5.5859557e-05 |
| 4,943 | Comparing Hierarchical Data in External Memory | 1999 | VLDB | 5.8123762e-05 |
| 6,805 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD | 4.9170518e-05 |
| 11,016 | X-TED: Massive Parallelization of Tree Edit Distance | 2024 | VLDB | 4.1905499e-05 |
| 3,206 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3855924e-05 |