Abstract
Although holistic twig join approach algorithm has been proven an efficient way to match twig pattern, it cannot deal with some special patterns efficiently such as ordered XML tree pattern, generalized tree pattern, and extended XML tree pattern. Ordered XML twig query means a twig query which cares the order of the matching elements. In this chapter, we propose a holistic-processing algorithm called OrderedTJ to guarantee the I/O optimality. Generalized tree pattern is modeled by XQuery statements with multiple path expressions, and we introduce GTJFast to process this kind of patterns to reduce the I/O cost. Finally, extended XML tree pattern includes not only P-C/A-D relationships but also negation functions, wildcards, and order restriction. We also show holistic algorithms to efficiently process such patterns in details.
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 call
