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.
Approximate Subtree Identification in Heterogeneous XML Documents Collections / I. Sanz, M. Mesiti, G. Guerrini, R. Berlanga Llavori1 - In: Database and XML Technologies / [a cura di] S. Bressan, S. Ceri, E. Hunt, Z.G. Ives, Z. Bellahsène, M. Rys, R. Unland. - Berlin : Springer, 2005 Aug 28. - ISBN 9783540285830. - pp. 192-206 (( Intervento presentato al 3. convegno XML Database Symposium tenutosi a Trondheim nel 2005.
Approximate Subtree Identification in Heterogeneous XML Documents Collections
M. Mesiti;
2005
Abstract
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Sanz2005_Chapter_ApproximateSubtreeIdentificati.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
368.32 kB
Formato
Adobe PDF
|
368.32 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
