Table Of Content

TASM: Top-k Approximate Subtree Matching Nikolaus Augsten1 Denilson Barbosa2 Michael B¨ohlen3 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.
ebook img

TASM: Top-k Approximate Subtree Matching PDF

136 Pages·2010·2.74 MB·English
by  
Save to my drive
Quick download
Download
Upgrade Premium
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview TASM: Top-k Approximate Subtree Matching

TASM: Top-k Approximate Subtree Matching Nikolaus Augsten1 Denilson Barbosa2 Michael B¨ohlen3 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.
See more

The list of books you might like

Upgrade Premium
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
DMCA & Copyright: Dear all, most of the website is community built, users are uploading hundred of books everyday, which makes really hard for us to identify copyrighted material, please contact us if you want any material removed.
Copyright @ PDFdrive.to, 2022 | We love our users