Query Rewriting Rules for Versioned XML Documents

Authors:
Tetsutaro Motomura;Mizuho Iwaihara;Masatoshi Yoshikawa
Affiliations:
Department of Social Informatics, Kyoto University,;Graduate School of Information, Production, and Systems, Waseda University,;Department of Social Informatics, Kyoto University,
Venue:
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Year:
2009

Citing 8
Cited 0

Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Comparing Hierarchical Data in External Memory

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Change-Centric Management of Versions in an XML Warehouse

Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Management of Multiversion Documents by Object Referencing

Proceedings of the 27th International Conference on Very Large Data Bases
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Supporting complex queries on multiversion XML documents

ACM Transactions on Internet Technology (TOIT)
Relevancy-based access control and its evaluation on versioned XML documents

ACM Transactions on Information and System Security (TISSEC)
XANADUE: a system for detecting changes to XML data in tree-unaware relational databases

Proceedings of the 2007 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shared and/or interactive contents such as office documents and wiki contents are often provided with both the latest version and all past versions. It is necessary to add version axes to XPath in order to trace version histories of fine-grained subdocuments of XML. Although research has been done on the containment and equivalence problems for XPath, which is a basic property of optimizing queries, there has been no research in the case for XPath extended with version axes. In this paper, we will propose query rewriting rules which can exchange between document axes and version axes, and prove that they are preserving query semantics. The rewriting rules enable us to swap path subexpressions between document axes and version axes to optimize queries.