We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find qualifying patterns through integration of structurally consistent query path qualifications. An efficient algorithm is proposed and its implementation tested on real-life data collections.
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find qualifying patterns through integration of structurally consistent query path qualifications. An efficient algorithm is proposed and its implementation tested on real-life data collections.
Tree Signatures and Unordered XML Pattern Matching / Mandreoli, Federica; Martoglia, Riccardo; P., Zezula. - STAMPA. - 2932:(2004), pp. 122-139. (Intervento presentato al convegno 30th Conference on Current Trends in Theory and Practice of Computer Science tenutosi a MERIN, CZECH REPUBLIC nel JAN 24-30, 2004) [10.1007/978-3-540-24618-3_10].
Tree Signatures and Unordered XML Pattern Matching
MANDREOLI, Federica;MARTOGLIA, Riccardo;
2004
Abstract
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find qualifying patterns through integration of structurally consistent query path qualifications. An efficient algorithm is proposed and its implementation tested on real-life data collections.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
