Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Conference or Workshop Paper |
| Scope | Discipline-based scholarship |
| Published in Proceedings | No |
| Title | TASM: Top-k Approximate Subtree Matching |
| Organization Unit | |
| Authors |
|
| Presentation Type | other |
| Item Subtype | Original Work |
| Refereed | Yes |
| Status | Published in final form |
| ISBN | E: 978-1-4244-5444-0 P: 978-1-4244-5445-7 |
| Page Range | 353 - 364 |
| Event Title | IEEE 26th International Conference on Data Engineering (ICDE), 2010 |
| Event Type | conference |
| Event Location | Long Beach, California, USA |
| Event Start Date | March 1 - 2010 |
| Event End Date | March 6 - 2010 |
| Number | 1 |
| Abstract Text | We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large document tree, e.g., DBLP with 26M nodes, using the canonical tree edit distance as a similarity measure between subtrees. Evaluating the tree edit distance for large XML trees is difficult: the best known algorithms have cubic runtime and quadratic space complexity, and, thus, do not scale. Our solution is TASMpostorder, a memory-efficient and scalable TASM algorithm. We prove an upper-bound for the maximum subtree size for which the tree edit distance needs to be evaluated. The upper bound depends on the query and is independent of the document size and structure. A core problem is to efficiently prune subtrees that are above this size threshold. We develop an algorithm based on the prefix ring buffer that allows us to prune all subtrees above the threshold in a single postorder scan of the document. The size of the prefix ring buffer is linear in the threshold. As a result, the space complexity of TASM-postorder depends only on k and the query size, and the runtime of TASM-postorder is linear in the size of the document. Our experimental evaluation on large synthetic and real XML documents confirms our analytic results. |
| Digital Object Identifier | 10.1109/ICDE.2010.5447905 |
| Other Identification Number | 1439; merlin-id:91 |
| PDF File |
Download from ZORA
|
| Export |
BibTeX
EP3 XML (ZORA)
|
| Additional Information | © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |