SYSTEMS AND METHODS FOR EFFICIENT TOP-k APPROXIMATE SUBTREE MATCHING
AssigneeThe Governors of the University of Alberta
InventorsDenilson Barbosa, Nikolaus Augsten, Michael Böhlen, Themis Palpanas
Life of this patent
Estimating the term…
Loading patent…
AssigneeThe Governors of the University of Alberta
InventorsDenilson Barbosa, Nikolaus Augsten, Michael Böhlen, Themis Palpanas
Estimating the term…
Systems and method for searching for approximate matches in a database of documents represented by a tree structure. A fast solution to the Top-k Approximate Subtree Matching Problem involves determining candidate subtrees which will be considered as possible matches to a query also represented by a tree structure. Once these candidate subtrees are found, a tree edit distance between each candidate subtree and the query tree is calculated. The results are then sorted to find those with the lowest tree edit distance.
A method for sorting nodes in a document tree to determine a number of closest approximations to a query represented by a query tree, the method comprising:
Computer-readable media having encoded thereon computer readable and computer executable instructions which, when executed, executes a method for sorting nodes in a document tree to determine a number of closest approximations to a query represented by a query tree, the method comprising:
A method for determining which subtrees in a document tree most closely approximate a given query tree, the method comprising:
Dependencies are inferred from the claim text.