Computer Science – Databases
Scientific paper
2011-12-31
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 4, pp. 334-345 (2011)
Computer Science
Databases
VLDB2012
Scientific paper
We consider the classical tree edit distance between ordered labeled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity, but the worst case happens frequently, or they are very efficient for some tree shapes, but degenerate for others. This leads to unpredictable and often infeasible runtimes. There is no obvious way to choose between the algorithms. In this paper we present RTED, a robust tree edit distance algorithm. The asymptotic complexity of RTED is smaller or equal to the complexity of the best competitors for any input instance, i.e., RTED is both efficient and worst-case optimal. We introduce the class of LRH (Left-Right-Heavy) algorithms, which includes RTED and the fastest tree edit distance algorithms presented in literature. We prove that RTED outperforms all previously proposed LRH algorithms in terms of runtime complexity. In our experiments on synthetic and real world data we empirically evaluate our solution and compare it to the state-of-the-art.
Augsten Nikolaus
Pawlik Mateusz
No associations
LandOfFree
RTED: A Robust Algorithm for the Tree Edit Distance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with RTED: A Robust Algorithm for the Tree Edit Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and RTED: A Robust Algorithm for the Tree Edit Distance will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-672817