XML compression has gained prominence recently because it counters the disadvantage of
the verbose representation XML gives to data. In many applications, such as data exchange …

We describe ShreX, a freely-available system for shredding, loading and querying XML
documents in relational databases. ShreX supports all mapping strategies proposed in the …

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 …

With XML becoming a ubiquitous language for data interoperability purposes in various
domains, efficiently querying XML data is a critical issue. This has lead to the design of …

XML suffers from the major limitation of high redundancy. Even if compression can be
beneficial for XML data, however, once compressed, the data can be seldom browsed and …

Vertical partitioning is a well-known technique for optimizing query performance in relational
databases. An extreme form of this technique, which we call vectorization, is to store each …

A lot of research has been conducted by the database community on methods and
techniques for efficient XPath processing, with great success. Despite the progress made …

We present a complete XPath cost-based optimization and execution framework and
demonstrate its effectiveness and efficiency for a variety of queries and datasets. The …

Abstract Extensible Markup Language (XML), which provides a flexible way to define
semistructured data, is a de facto standard for information exchange in the World Wide Web …

This work describes a method for processing XPath on a relational back-end that
significantly limits the number of SQL joins required, takes advantage of the strengths of …