Comparing Hierarchical Data in External Memory
Summary: External-memory algorithm for minimum-cost edit script between rooted, ordered, labeled trees; I/O 4*m1*n1 + 7*m1 + 5*n1, RAM 6*S, CPU O((M*N+(M+N)*S)^1.5). Extends sequence-comparison to trees via shortest-path problems in edit graphs; uses surplus RAM to quadratically reduce I/O. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,302 | RTED: A Robust Algorithm for the Tree Edit Distance | 2012 | VLDB | 7.2445358e-05 |
| 12,097 | Synthetising Changes in XML Documents as PULs | 2013 | VLDB | 4.1905499e-05 |
| 12,534 | Automatic Extraction of Dynamic Record Sections From Search Engine Result Pages | 2006 | VLDB | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 724 | Meaningful Change Detection in Structured Data | 1997 | SIGMOD | 0.00017477352 |
| 1,391 | Change Detection in Hierarchically Structured Information | 1996 | SIGMOD | 0.00012236889 |
| 1,432 | Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results | 1994 | SIGMOD | 0.00012000371 |
| 3,134 | Structural Matching and Discovery in Document Databases | 1997 | SIGMOD | 7.4961991e-05 |
| 4,759 | Efficient Snapshot Differential Algorithms for Data Warehousing | 1996 | VLDB | 5.934668e-05 |
| 5,987 | External Memory Algorithms | 1998 | PODS | 5.2399221e-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 |
| 9,499 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD | 4.3300131e-05 |
| 12,365 | The Power of Two Min-Hashes for Similarity Search among Hierarchical Data Objects | 2008 | PODS | 4.1905499e-05 |
| 6,805 | Indexing for Subtree Similarity-Search using Edit Distance | 2013 | SIGMOD | 4.9170518e-05 |
| 11,772 | Write-Optimized Skip Lists | 2017 | PODS | 4.1905499e-05 |
| 5,211 | Sorting Hierarchical Data in External Memory for Archiving | 2008 | VLDB | 5.6244591e-05 |
| 3,675 | Efficient External-Memory Bisimulation on DAGs | 2012 | SIGMOD | 6.8500291e-05 |
| 3,302 | RTED: A Robust Algorithm for the Tree Edit Distance | 2012 | VLDB | 7.2445358e-05 |
| 5,194 | Clustering Techniques for Minimizing External Path Length | 1996 | VLDB | 5.6318244e-05 |
| 3,206 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3855924e-05 |