Filters








10 Hits in 2.7 sec

TASM: Top-k Approximate Subtree Matching

Nikolaus Augsten, Denilson Barbosa, Michael Bohlen, Themis Palpanas
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
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  ...  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.  ...  In this paper we consider the Top-k Approximate Subtree Matching problem (TASM), i.e., the problem of ranking the k best approximate matches of a small query tree in a large document tree.  ... 
doi:10.1109/icde.2010.5447905 dblp:conf/icde/AugstenBBP10 fatcat:b6roqaf6ubd7bkj5dljekvu43i

Efficient Top-k Approximate Subtree Matching in Small Memory

Nikolaus Augsten, Denilson Barbosa, Michael Bohlen, Themis Palpanas
2011 IEEE Transactions on Knowledge and Data Engineering  
We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree within a large document tree using the canonical tree edit distance as a similarity measure  ...  Abstract-We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree within a large document tree using the canonical tree edit distance as a similarity  ...  Top-k approximate subtree matching (TASM) is the problem of computing a top-k ranking of the subtrees of a document T with respect to a query Q.  ... 
doi:10.1109/tkde.2010.245 fatcat:jayqk472jncnxhqvksmjeogr5a

A general algorithm for subtree similarity-search

Sara Cohen, Nerya Or
2014 2014 IEEE 30th International Conference on Data Engineering  
The subtree similarity-search problem is that of finding, given a tree Q and a large set of trees Γ = {T1, . . . , Tn}, the subtrees of trees among Γ that are most similar to Q.  ...  While subtree similarity-search has been studied in the past, solutions mostly focused on specific tree distance functions, and were usually applicable only to ordered trees.  ...  We choose k = 3, and thus, find the top-3 subtrees of T , which are most similar to Q.  ... 
doi:10.1109/icde.2014.6816712 dblp:conf/icde/CohenO14 fatcat:n2f5fwqht5hjle4laq6fpr4rfu

Program chairs and general chairs

2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
"TASM: Top-k Approximate Subtree Matching" by Augsten, Barbosa, Böhlen and Palpanas received the Best Paper award for providing an elegant solution to the classical problem of identifying subtrees in a  ...  The success of ICDE 2010 is a result of collegial teamwork from many individuals, who worked tirelessly to make the conference a top research forum.  ... 
doi:10.1109/icde.2010.5447672 fatcat:5zvwldcuxvgnncdpwzbsjvteuq

RTED

Mateusz Pawlik, Nikolaus Augsten
2011 Proceedings of the VLDB Endowment  
The TASM (top-k approximate subtree matching) algorithm by Augsten et al. [2] identifies the top-k subtrees in a data tree with the smallest edit distances from a given query tree.  ...  The pruning makes use of the top-k guarantee, which is not given in our scenario.  ... 
doi:10.14778/2095686.2095692 fatcat:nqkvyha4lnfzjhnterea6ajkmq

RTED: A Robust Algorithm for the Tree Edit Distance [article]

Mateusz Pawlik, Nikolaus Augsten
2011 arXiv   pre-print
The TASM (top-k approximate subtree matching) algorithm by Augsten et al. [2] identifies the top-k subtrees in a data tree with the smallest edit distances from a given query tree.  ...  The pruning makes use of the top-k guarantee, which is not given in our scenario.  ... 
arXiv:1201.0230v1 fatcat:pnqvtjfgrjbytf5smgy5wxuwqm

Similarity Joins in Relational Database Systems

Nikolaus Augsten, Michael H. Böhlen
2013 Synthesis Lectures on Data Management  
Token-based distances are used to compute an approximation of the edit distance and prune expensive edit distance calculations.  ...  e TASM (top-k approximate subtree matching) algorithm [Augsten et al., 2010a] computes the top-k closest subtrees (w.r.t. the tree edit distance) of a small query tree with m nodes in a large document  ...  approximate subtree matching, 23 top-down distance, 23 traversal string lower bound, 70 tree, 7 tree decomposition, 30 tree edit distance, 15 tree permutation, 8 1.  ... 
doi:10.2200/s00544ed1v01y201310dtm038 fatcat:ekjzaou2xjckroqhcdm72zqzky

Program book

2010 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)  
Research Session 11: Top-K Queries Regency B, 10:30 -12:00, Wednesday Chair: Ralf Schenkel TASM: Top-k Approximate Subtree Matching Nikolaus Augsten 1 , Denilson Barbosa 2 , Michael Böhlen 1 , Themis  ...  Palpanas 3 ; 1 Free University of Bozen-Bolzano, Italy; 2 University of Alberta, Canada; 3 University of Trento, Italy We consider the Top-k Approximate Subtree Matching (tasm) problem: finding the k  ... 
doi:10.1109/icdew.2010.5452773 fatcat:oyq2tujbvjfpxjlyixux5q57vu

Hidden Markov models for malware classification

Chinmayee Annachhatre, Thomas H. Austin, Mark Stamp
2014 Journal in Computer Virology and Hacking Techniques  
The authors have proposed a malware classification system using approximate matching of control flow graphs.  ...  We can match an observation sequence against a trained HMM to determine the probability of seeing such a sequence.  ... 
doi:10.1007/s11416-014-0215-x fatcat:qcfqhsr3gjeedj6fqzsyi4ynze

Proceedings of the Second Program Visualization Workshop, 2002

Mordechai Ben-Ari
2002 DAIMI Report Series  
The range (x1, x2) is reserved for the x coordinates of a subtree.  ...  For instance, in both the animations in Figure 2 we have K=2.  ... 
doi:10.7146/dpb.v31i567.7124 fatcat:xkgclvxh3rc6xaqb4xlppumu2u