IEEE - Institute of Electrical and Electronics Engineers, Inc. - TASM: Top-k Approximate Subtree Matching

2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)

Author(s): Nikolaus Augsten ; Denilson Barbosa ; Michael Bohlen ; Themis Palpanas
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 March 2010
Conference Location: Long Beach, CA, USA
Conference Date: 1 March 2010
Page(s): 353 - 364
ISBN (Electronic): 978-1-4244-5446-4
ISBN (Paper): 978-1-4244-5445-7
ISBN (Online): 978-1-4244-5444-0
ISSN (Electronic): 2375-026X
ISSN (Paper): 1063-6382
DOI: 10.1109/ICDE.2010.5447905
Regular:

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... View More

Advertisement