Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
TJFast: effective processing of XML twig pattern matching
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Holistically processing XML twig queries with AND, OR, and NOT predicates
Proceedings of the 2nd international conference on Scalable information systems
Reducing Temporary Trees in XQuery
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
On the efficient search of an XML twig query in large DataGuide trees
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Journal of Systems and Software
XQuery Join Graph Isolation: Celebrating 30+ Years of XQuery Processing Technology
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Twiglist: make twig pattern matching fast
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
TwigBuffer: avoiding useless intermediate solutions completely in twig joins
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
| Hi-index | 0.00 |
Structural joins and, in particular, twig joins are essential operations in XML query processing. Algorithms presented so far treat a twig join as a single operator with multiple inputs. However, in XQuery and XSLT, a twig pattern may be scattered across several functions (templates); thus, function integration is required before the application of a twig join operator. This paper presents R-programs --- a novel evaluation framework based on an expanding network of operators. In this environment, a function may repeatedly and bidirectionally interact with its caller; consequently, a structural join algorithm may be distributed across the boundary of a function. Given this ability, function integration is no longer required and twig join algorithms become applicable even in the presence of recursive functions.