Relational database systems may be turned into efficient XML and XPath processors if the
system is provided with a suitable relational tree encoding. This paper extends this relational …

We present the first complete translation of XPath into an algebra, paving the way for a
comprehensive, state-of-the-art XPath (and later on, XQuery) compiler based on algebraic …

The performance of XML query processing in persistent XML databases crucially depends
on the chosen data access paths, and on the efficiency of the remaining query processing …

We present a native XML database management system, Sedna, which is implemented from
scratch as a full-featured database management system for storing large amounts of XML …

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" …

XQuery expressions can manipulate two kinds of order: document order and sequence
order. While the user can impose or observe the order of items within a sequence, the …

XML and XQuery semantics are very sensitive to the order of the produced output. Although
pattern-tree based algebraic approaches are becoming more and more popular for …

Node-selecting queries over trees lie at the core of several important XML languages for the
web, such as the node-selection language XPath, the query language XQuery, and the …

There has been a lot of research and industrial effort on building XQuery engines with
different kinds of XML storage and index models. However, most of these efforts focus on …

We present a method to evaluate path queries based on the novel concept of partial path
instances. Our method (1) maximizes performance by means of sequential scans or …