Query rewriting rules for versioned XML documents

Tetsutaro Motomura, Mizuho Iwaihara, Masatoshi Yoshikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages364-371
Number of pages8
Volume5690 LNCS
DOIs
Publication statusPublished - 2009
Event20th International Conference on Database and Expert Systems Applications, DEXA 2009 - Linz
Duration: 2009 Aug 312009 Sep 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5690 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other20th International Conference on Database and Expert Systems Applications, DEXA 2009
CityLinz
Period09/8/3109/9/4

Fingerprint

Query Rewriting
XML
XPath
Semantics
Query
Equivalence Problem
Swap
Rewriting
Trace
Optimise
Path
Necessary

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Motomura, T., Iwaihara, M., & Yoshikawa, M. (2009). Query rewriting rules for versioned XML documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5690 LNCS, pp. 364-371). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5690 LNCS). https://doi.org/10.1007/978-3-642-03573-9_31

Query rewriting rules for versioned XML documents. / Motomura, Tetsutaro; Iwaihara, Mizuho; Yoshikawa, Masatoshi.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5690 LNCS 2009. p. 364-371 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5690 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Motomura, T, Iwaihara, M & Yoshikawa, M 2009, Query rewriting rules for versioned XML documents. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5690 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5690 LNCS, pp. 364-371, 20th International Conference on Database and Expert Systems Applications, DEXA 2009, Linz, 09/8/31. https://doi.org/10.1007/978-3-642-03573-9_31
Motomura T, Iwaihara M, Yoshikawa M. Query rewriting rules for versioned XML documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5690 LNCS. 2009. p. 364-371. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-03573-9_31
Motomura, Tetsutaro ; Iwaihara, Mizuho ; Yoshikawa, Masatoshi. / Query rewriting rules for versioned XML documents. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5690 LNCS 2009. pp. 364-371 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3abcee56e2f048ad9b57988c56c0fc8c,
title = "Query rewriting rules for versioned XML documents",
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.",
author = "Tetsutaro Motomura and Mizuho Iwaihara and Masatoshi Yoshikawa",
year = "2009",
doi = "10.1007/978-3-642-03573-9_31",
language = "English",
isbn = "3642035728",
volume = "5690 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "364--371",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Query rewriting rules for versioned XML documents

AU - Motomura, Tetsutaro

AU - Iwaihara, Mizuho

AU - Yoshikawa, Masatoshi

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70349339350&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349339350&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03573-9_31

DO - 10.1007/978-3-642-03573-9_31

M3 - Conference contribution

SN - 3642035728

SN - 9783642035722

VL - 5690 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 364

EP - 371

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -