Publication: TASM: Top-k Approximate Subtree Matching
TASM: Top-k Approximate Subtree Matching
Date
Date
Date
Citations
Augsten, N., Böhlen, M., Barbosa, D., & Palpanas, T. (2010). TASM: Top-k Approximate Subtree Matching. ACM Trans. Database Syst., Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach, California, USA, 353–364. https://doi.org/10.1109/ICDE.2010.5447905
Abstract
Abstract
Abstract
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 p
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
Event Title
Event Title
Event Title
Event Location
Event Location
Event Location
Event Country
Event Country
Event Country
Event Start Date
Event Start Date
Event Start Date
Event End Date
Event End Date
Event End Date
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Scope
Scope
Scope
Date available
Date available
Date available
Number
Number
Number
ISBN or e-ISBN
ISBN or e-ISBN
ISBN or e-ISBN
Additional Information
Additional Information
Additional Information
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Other Identification Number
Other Identification Number
Other Identification Number
Metrics
Downloads
Views
Citations
Augsten, N., Böhlen, M., Barbosa, D., & Palpanas, T. (2010). TASM: Top-k Approximate Subtree Matching. ACM Trans. Database Syst., Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach, California, USA, 353–364. https://doi.org/10.1109/ICDE.2010.5447905