Year: 2004
Type: conference-paper
Abstract: This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to \\speak" °uently. Given suitable relational encodings of sequences and or-dered, unranked trees|the two data structures that form the backbone of the XML and XQuery data models|we de-scribe a compiler that translates XQuery expressions into a simple and quite standard relational algebra which we ex-pect to be e±ciently implementable on top of any relational query engine. The compilation procedure is fully composi-tional and emits algebraic code that strictly adheres to the XQuery language semantics: document and sequence order as well as node identity are obeyed. We exercise special care in translating arbitrarily nested XQuery FLWOR iteration constructs into equi-joins, an operation which RDBMSs can perform particularly fast. The resulting purely relational XQuery processor shows promising performance ¯gures in experiments.
Source: KOPS (University of Konstanz)
Authors: Torsten Grust, Jens Teubner
Institution: University of Konstanz
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2139705615
