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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
