An algebraic approach for incremental maintenance of materialized XQuery views
Proceedings of the 4th international workshop on Web information and data management
Tree logical classes for efficient evaluation of XQuery
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Compiling XSLT 2.0 into XQuery 1.0
WWW '05 Proceedings of the 14th international conference on World Wide Web
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
XQuery implementation in a relational database system
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Pathfinder: XQuery---the relational way
VLDB '05 Proceedings of the 31st international conference on Very large data bases
LiXQuery: a formal foundation for XQuery research
ACM SIGMOD Record
R-Programs: A Framework for Distributing XML Structural Joins across Function Calls
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
The creation, maintenance and disposal of tree fragments during XQuery execution form a significant issue in the design of XQuery processors. The problem is further complicated by the definition of node identity which violates the functional nature of the XQuery language. This paper presents a novel mathematical model of XQuery execution that reflects temporary tree construction and manipulation, including navigation. Using this model as reference, an efficient algorithm of static analysis is presented that determines the level of information required at a particular place of the XQuery program. As a side effect, the algorithm also decides on the ordered/unordered context as defined by the XQuery language. Based on this algorithm, the amount of information stored during the execution as well as the complexity of operations may be significantly reduced.