Computer Science – Databases
Scientific paper
2008-10-27
Computer Science
Databases
extended version of a paper published in the ICDE 2009 proceedings (13 pages, 13 figures, 9 tables)
Scientific paper
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional XQuery language, however, yields odd algebraic plan shapes featuring scattered distributions of join operators that currently overwhelm commercial SQL query optimizers. This work rewrites such plans before submission to the relational database back-end. Once cast into the shape of join graphs, we have found off-the-shelf relational query optimizers--the B-tree indexing subsystem and join tree planner, in particular--to cope and even be autonomously capable of "reinventing" advanced processing strategies that have originally been devised specifically for the XQuery domain, e.g., XPath step reordering, axis reversal, and path stitching. Performance assessments provide evidence that relational query engines are among the most versatile and efficient XQuery processors readily available today.
Grust Torsten
Mayr Matthias
Rittinger Jan
No associations
LandOfFree
XQuery Join Graph Isolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with XQuery Join Graph Isolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and XQuery Join Graph Isolation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-324113