Abstract

AbstractTwig based optimisation is one of the current approaches to improving XML query performance. It uses structural joins to find all pairs of elements in the XML documents satisfying the primitive structural relationships specified in the XML queries. They focus on parent-child and ancestor-descendant relationships. Efficient location of all joins is one of the core operations in XML query processing. In this paper, we propose a pattern matching algorithm called OTwig, which extends existing research on twig pattern matching. It demonstrates an improvement over existing pattern matching algorithms while also optimising memory usage.KeywordsTwig pattern matchingxml query processing

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 call

Disclaimer: 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.