Analysis of Tree Edit Distance on XML Data
碩士 === 國立臺灣大學 === 電機工程學研究所 === 95 === The problem of comparing tree structures occurs in various areas in computer science and engineering, including the application to XML data processing. To solve this problem, tree edit distance is a common and significant measurement defining the difference betw...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65891997083046091318 |
| Summary: | 碩士 === 國立臺灣大學 === 電機工程學研究所 === 95 === The problem of comparing tree structures occurs in various areas in computer science and engineering, including the application to XML data processing. To solve this problem, tree edit distance is a common and significant measurement defining the difference between two tree structures quantitatively. Efficient tree edit distance embedding algorithms are therefore of significant importance in comparing large streaming XML document trees. In this thesis, we propose a new algorithm to obtain edit distance between unlabeled ordered trees derived from streaming XML data. In comparison with the previous work, our contribution lies in simplifying the procedure of obtaining the tree edit distance without increasing the time and space complexities. The upper and lower bounds as well as the error probability of our algorithm are also analyzed in this thesis.
|
|---|