Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents in a collection that are similar to a given pattern. In this paper we discuss different similarity measures between a pattern and subtrees of documents in the collection. An efficient algorithm for the identification of document subtrees, approximately conforming to the pattern, by indexing structures is then introduced.
|Titolo:||Approximate Subtree Identification in Heterogeneous XML Documents Collections|
|Autori interni:||MESITI, MARCO|
|Parole Chiave:||XML ; Approximate retrieval ; subtree matching|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||28-ago-2005|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|