Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Nikolaus Augsten , Faculty of Computer Science, Free University of Bozen-Bolzano, Italy
Denilson Barbosa , Department of Computing Science, University of Alberta, Canada
Michael Bohlen , Faculty of Computer Science, Free University of Bozen-Bolzano, Italy
Themis Palpanas , Department of Information Engineering and Computer Science, University of Trento, Italy
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 TASM-postorder, 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.
Nikolaus Augsten, Denilson Barbosa, Michael Bohlen, Themis Palpanas, "TASM: Top-k Approximate Subtree Matching", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 353-364, doi:10.1109/ICDE.2010.5447905