An Improved Lower Bound for the Elementary Theories of Trees
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A comprehensive XQuery to SQL translation using dynamic interval encoding
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
On the Intersection of XPath Expressions
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Deciding XPath containment with MSO
Data & Knowledge Engineering
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Commutativity analysis for XML updates
ACM Transactions on Database Systems (TODS)
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
Schema-based independence analysis for XML updates
Proceedings of the VLDB Endowment
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
XPathMark: an XPath benchmark for the XMark generated data
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
| Hi-index | 0.00 |
XML transformations can be resource-costly in particular when applied to very large XML documents and document sets. Those transformations usually involve lots of XPath queries and may not need to be entirely re-executed following an update of the input document. In this context, a given query is said to be independent of a given update if, for any XML document, the results of the query are not affected by the update. We revisit Benedikt and Cheney's framework for query-update independence analysis and show that performance can be drastically enhanced, contradicting their initial claims. The essence of our approach and results resides in the use of an appropriate logic, to which queries and updates are both succinctly translated. Compared to previous approaches, ours is more expressive from a theoretical point of view, equally accurate, and more efficient in practice. We illustrate this through practical experiments and comparative figures.