Document - Tree Signatures for XML Querying and Navigation

2003

Conference article Open Access

Tree Signatures for XML Querying and Navigation

Zezula P., Amato G., Debole F., Rabitti F.

XML query processing H.2.2 Physical Design. Access methods XML Search XML searching Access structure Tree signatures

In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show how to apply tree signatures in query processing and demonstrate that a speedup of up to one order of magnitude can be achieved over the containment join strategy. Other alternatives of using the tree signatures in intelligent XML searching are outlined in the conclusions

Source: Xsym 2003, pp. 149–163, Berlin, Germany, 8 September 2003

Publisher: Springer, Berlin , Germania

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:44098,
	title = {Tree Signatures for XML Querying and Navigation},
	author = {Zezula P. and Amato G. and Debole F. and Rabitti F.},
	publisher = {Springer, Berlin , Germania},
	doi = {10.1007/978-3-540-39429-7_10},
	booktitle = {Xsym 2003, pp. 149–163, Berlin, Germany, 8 September 2003},
	year = {2003}
}