Abstract
With the rapidly increasing popularity of XML for data representation, there is a lot of interest in query processing over data that conforms to a labeled-tree data model. A variety of languages have been proposed for this purpose, all of which can be viewed as consisting of a pattern language and construction expressions. Since the data objects are typically trees, tree pattern matching is the central issue. The idea behind evaluating tree pattern queries, sometimes called twig queries, is to find all the ways of embedding the pattern in the data. Because this lies at the core of most languages for processing XML data, efficient evaluation techniques for these languages require appropriate indexing structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zezula, P., Amato, G., Rabitti, F. (2003). Processing XML Queries with Tree Signatures. In: Blanken, H., Grabs, T., Schek, HJ., Schenkel, R., Weikum, G. (eds) Intelligent Search on XML Data. Lecture Notes in Computer Science, vol 2818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45194-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45194-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40768-3
Online ISBN: 978-3-540-45194-5
eBook Packages: Springer Book Archive