Where academic tradition
meets the exciting future

Supporting XPath Axes with Relational Databases Using a Proxy Index

Olli Luoma, Supporting XPath Axes with Relational Databases Using a Proxy Index. In: Database and XML Technologies, Proceedings of the 3rd International XML Database Symposium, Lecture Notes in Computer Science 3671, 99–113, Springer-Verlag Berlin Heidelberg, 2005.

Abstract:

In recent years, a plethora of work has been done to develop methods
for managing XML documents using relational databases. In order to
support XPath or any other XML query language, the relational schema
must allow fast retrieval of the parents, children, ancestors, or descendants
of a given set of nodes. Most of the previous work has aimed at this goal
using pre-/postorder encoding. Relying on this method, however, may
lead to scalability problems, since the structural relationships have to be
checked using nonequijoins, i.e., joins using < or > as their join condition.
Thus, we discuss alternative methods, such as ancestor/descendant and
ancestor/leaf indexes, and present a novel method, namely a so called
proxy index. Our method allows us to replace nonequijoins with equijoins,
i.e., joins using = as their join condition. The results of our comprehensive
performance experiments demonstrate the effectiveness of the proxy index.

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpLuoma05b,
  title = {Supporting XPath Axes with Relational Databases Using a Proxy Index},
  booktitle = {Database and XML Technologies, Proceedings of the 3rd International XML Database Symposium},
  author = {Luoma, Olli},
  volume = {3671},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag Berlin Heidelberg},
  pages = {99–113},
  year = {2005},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Publication Forum rating of this publication: level 1

Edit publication