Table Of Content

TASM: Top-k Approximate Subtree Matching Nikolaus Augsten1 Denilson Barbosa2 Michael Böhlen3 Themis Palpanas4 1FreeUniversityofBozen-Bolzano,Italy [email protected] 2UniversityofAlberta,Canada [email protected] 3UniversityofZurich,Switzerland [email protected] 4UniversityofTrento,Italy [email protected] ICDE 2010, March 3 Long Beach, CA, USA NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 1/28 Outline 1 Motivation and Problem Definition 2 TASM-Postorder Upper Bound on Subtree Size Prefix Ring Buffer Pruning 3 Experiments 4 Conclusion and Future Work NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 2/28 MotivationandProblemDefinition Outline 1 Motivation and Problem Definition 2 TASM-Postorder Upper Bound on Subtree Size Prefix Ring Buffer Pruning 3 Experiments 4 Conclusion and Future Work NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 3/28 MotivationandProblemDefinition Motivation Query (XML fragment) Document (very large XML) article top-k matches? authors booktitle DBLP authorauthorICDE 28M nodes, 531MB Tim John Rank the top-k matches for the article query in the DBLP document! NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 4/28 MotivationandProblemDefinition Motivation Query (XML fragment) Document (very large XML) article top-k matches? authors booktitle DBLP authorauthorICDE 28M nodes, 531MB Tim John Rank the top-k matches for the article query in the DBLP document! Example Answer: k = 3 inproceedings authors booktitle authorauthorICDE Tim John (1 error) NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 4/28 MotivationandProblemDefinition Motivation Query (XML fragment) Document (very large XML) article top-k matches? authors booktitle DBLP authorauthorICDE 28M nodes, 531MB Tim John Rank the top-k matches for the article query in the DBLP document! Example Answer: k = 3 inproceedings article authors booktitle authors authorauthorICDE author authorbooktitle Tim John Tim John TKDE (1 error) (2 errors) NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 4/28 MotivationandProblemDefinition Motivation Query (XML fragment) Document (very large XML) article top-k matches? authors booktitle DBLP authorauthorICDE 28M nodes, 531MB Tim John Rank the top-k matches for the article query in the DBLP document! Example Answer: k = 3 inproceedings article inproceedings authors booktitle authors booktitle authors authorauthorICDE author authorbooktitle authorauthorauthorICDE Tim John Tim John TKDE Tim John Peter (1 error) (2 errors) (3 errors) NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 4/28 MotivationandProblemDefinition TASM: Top-k Approximate Subtree Matching Definition (TASM: Top-k Approximate Subtree Matching) Given: query tree Q, document tree T, size k of ranking Goal: Compute a top-k ranking R = (T ,T ,...,T ) 1 2 k of all subtrees T of document T i with respect to query Q using the tree edit distance for the ranking. NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 5/28 MotivationandProblemDefinition TASM: Top-k Approximate Subtree Matching Definition (TASM: Top-k Approximate Subtree Matching) Given: query tree Q, document tree T, size k of ranking Goal: Compute a top-k ranking R = (T ,T ,...,T ) 1 2 k of all subtrees T of document T i with respect to query Q using the tree edit distance for the ranking. Subtree T : i a node and all its descendants largest subtree is document itself NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 5/28 MotivationandProblemDefinition TASM: Top-k Approximate Subtree Matching Definition (TASM: Top-k Approximate Subtree Matching) Given: query tree Q, document tree T, size k of ranking Goal: Compute a top-k ranking R = (T ,T ,...,T ) 1 2 k of all subtrees T of document T i with respect to query Q using the tree edit distance for the ranking. Subtree T : i a node and all its descendants largest subtree is document itself top-k ranking R = (T ,T ,..., T ) 1 i k subtrees sorted by distance to query best k subtrees: T ∈/ R ⇒ted(Q, T )≤ted(Q, T ) i k i NikolausAugsten (Bolzano,Italy) TASM:Top-kApprox.SubtreeMatching ICDE2010 5/28

Description:

Rank the top-k matches for the article query in the DBLP document! Nikolaus Augsten (Bolzano, Italy). TASM: Top-k Approx. Subtree Matching.

TASM: Top-k Approximate Subtree Matching PDF

136 Pages·2010·2.74 MB·English

Checking for file health...

Save to my drive

Quick download

Download

Download TASM: Top-k Approximate Subtree Matching PDF Free - Full Version

by Unknow| 2010| 136 pages| 2.74| English

Download TASM: Top-k Approximate Subtree Matching by in PDF format completely FREE. No registration required, no payment needed. Get instant access to this valuable resource on PDFdrive.to!

Free Download PDF

About TASM: Top-k Approximate Subtree Matching

Rank the top-k matches for the article query in the DBLP document! Nikolaus Augsten (Bolzano, Italy). TASM: Top-k Approx. Subtree Matching.

Detailed Information

Author:	Unknown
Publication Year:	2010
Pages:	136
Language:	English
File Size:	2.74
Format:	PDF
Price:	FREE

Download Free PDF

Safe & Secure Download - No registration required

Why Choose PDFdrive for Your Free TASM: Top-k Approximate Subtree Matching Download?

100% Free: No hidden fees or subscriptions required for one book every day.
No Registration: Immediate access is available without creating accounts for one book every day.
Safe and Secure: Clean downloads without malware or viruses
Multiple Formats: PDF, MOBI, Mpub,... optimized for all devices
Educational Resource: Supporting knowledge sharing and learning

Frequently Asked Questions

Is it really free to download TASM: Top-k Approximate Subtree Matching PDF?

Yes, on https://PDFdrive.to you can download TASM: Top-k Approximate Subtree Matching by completely free. We don't require any payment, subscription, or registration to access this PDF file. For 3 books every day.

How can I read TASM: Top-k Approximate Subtree Matching on my mobile device?

After downloading TASM: Top-k Approximate Subtree Matching PDF, you can open it with any PDF reader app on your phone or tablet. We recommend using Adobe Acrobat Reader, Apple Books, or Google Play Books for the best reading experience.

Is this the full version of TASM: Top-k Approximate Subtree Matching?

Yes, this is the complete PDF version of TASM: Top-k Approximate Subtree Matching by Unknow. You will be able to read the entire content as in the printed version without missing any pages.

Is it legal to download TASM: Top-k Approximate Subtree Matching PDF for free?

https://PDFdrive.to provides links to free educational resources available online. We do not store any files on our servers. Please be aware of copyright laws in your country before downloading.

The materials shared are intended for research, educational, and personal use in accordance with fair use principles.