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.
Systems and Methods for Efficient Top-k Approximate Subtree Matching
Palpanas, Themistoklis
2012-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
