論文

査読有り
2017年9月1日

DDO-free xquery

ACM International Conference Proceeding Series
  • Hiroyuki Kato
  • ,
  • Yasunori Ishihara
  • ,
  • Torsten Grust

130653
記述言語
英語
掲載種別
研究論文(国際会議プロシーディングス)
DOI
10.1145/3122831.3122832
出版者・発行元
Association for Computing Machinery

XQuery has an order-sensitive semantics in the sense that it requires nodes to be sorted in document order without duplicates (or in Distinct Document Order, DDO for short). This paper shows that for a given XQuery expression and a nested-relational DTD, the input expression can be transformed into an expression that can be evaluated withoutpotentially costlyordering operations even if the input query requires its result to be in DDO. To this end, we propose an XQuery transformation algorithm that consists of simple rewriting rules. The basic idea is inspired by a generate-andtest approach as commonly used for solving search problems. We apply this approach when constructing the transformed expression: first, a skeleton query is prepared for the generate phase. This skeleton query can be evaluated without DDO, but it has the ability to return all nodes in DDO for all XML documents that conform to the input DTD. Second, an output expression is generated by injecting conditions for the test phase, which are extracted from the input expression, into the skeleton query. The key to performing both the extraction and injection of conditions in a systematic way is to utilize XQuery transformations that preserve equivalence up to DDO.

リンク情報
DOI
https://doi.org/10.1145/3122831.3122832
ID情報
  • DOI : 10.1145/3122831.3122832
  • SCOPUS ID : 85030530408

エクスポート
BibTeX RIS