ACM Home Page
Please provide us with feedback. Feedback
A SQL: 1999 code generator for the pathfinder xquery compiler
Full text PdfPdf (118 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2007 ACM SIGMOD international conference on Management of data table of contents
Beijing, China
SESSION: Group 4 table of contents
Pages: 1162 - 1164  
Year of Publication: 2007
ISBN:978-1-59593-686-8
Authors
Torsten Grust  Technische Universität München, Munich, Germany
Manuel Mayr  Technische Universität München, Munich, Germany
Jan Rittinger  Technische Universität München, Munich, Germany
Sherif Sakr  University of Konstanz, Konstanz, Germany
Jens Teubner  Technische Universität München, Munich, Germany
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 48,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1247480.1247642
What is a DOI?

ABSTRACT

The Pathfinder XQuery compiler has been enhanced by a new code generator that can target any SQL:1999-compliant relational database system(RDBMS). This code generator marks an important next step towards truly relational XQuery processing, a branch of database technology that aims to turn RDBMSs into highly efficient XML and XQuery processors without the need to invade the relational database kernel. Pathfinder, a retargetable front-end compiler, translates input XQuery expressions into DAG-shaped relational algebra plans. The code generator then turns these plans into sequences of either SQL:1999 statements or view definitions which jointly implement the (sometimes intricate) XQuery semantics. In a sense, this demonstration thus lets relational algebra and SQL swap their traditional roles in database query processing. The result is a code generator that (1) supports an almost complete dialect of XQuery, (2) can target any RDBMS with a SQL:1999 language interface, and (3) exhibits quite promising performance characteristics when run against high-volume XML data as well as complex XQuery expressions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Boag, D. Chamberlin, M. F. Fernàndez, D. Florescu, J. Robie, and J. Siméon. XQuery 1.0: An XML Query Language. W3 Consortium, June 2006.
2
 
3
G. Graefe. Sorting and Indexing with Partitioned B-trees. In Proc. CIDR, Asilomar, CA, USA, 2003.
 
4
T. Grust, J. Rittinger, and J. Teubner. eXrQuy: Order Indifference in XQuery. In Proc. ICDE, Istanbul, Turkey, 2007.
5
 
6
T. Grust, S. Sakr, and J. Teubner. XQuery on SQL Hosts. In Proc. VLDB, Toronto, Canada, 2004.
 
7
 
8
A. R. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse. XMark: A Benchmark for XML Data Management. In Proc. VLDB, Hong Kong, China, 2002.


Collaborative Colleagues:
Torsten Grust: colleagues
Manuel Mayr: colleagues
Jan Rittinger: colleagues
Sherif Sakr: colleagues
Jens Teubner: colleagues