Publication:

TASM: Top-k Approximate Subtree Matching

Date

Date

Date
2010
Conference or Workshop Item
Published version

Citations

Citation copied

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

3 since deposited on 2011-02-11
Acq. date: 2025-11-13

Views

1 since deposited on 2011-02-11
Acq. date: 2025-11-13

Additional indexing

Creators (Authors)

Event Title

Event Title

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

Event Location

Event Location

Event Location
Long Beach

Event Country

Event Country

Event Country
California, USA

Event Start Date

Event Start Date

Event Start Date
2010-03-01

Event End Date

Event End Date

Event End Date
2010-03-06

Page range/Item number

Page range/Item number

Page range/Item number
353

Page end

Page end

Page end
364

Item Type

Item Type

Item Type
Conference or Workshop Item

Dewey Decimal Classifikation

Dewey Decimal Classifikation

Dewey Decimal Classifikation

Scope

Scope

Scope
Discipline-based scholarship (basic research)

Date available

Date available

Date available
2011-02-11

Number

Number

Number
1

ISBN or e-ISBN

ISBN or e-ISBN

ISBN or e-ISBN
978-1-4244-5445-7

Additional Information

Additional Information

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.

OA Status

OA Status

OA Status
Green

Free Access at

Free Access at

Free Access at
Unspecified

Other Identification Number

Other Identification Number

Other Identification Number
1439; merlin-id:91

Metrics

Downloads

3 since deposited on 2011-02-11
Acq. date: 2025-11-13

Views

1 since deposited on 2011-02-11
Acq. date: 2025-11-13

Citations

Citation copied

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

Green Open Access
Loading...
Thumbnail Image

Files

Files

Files
Files available to download:1

Files

Files

Files
Files available to download:1
Loading...
Thumbnail Image