Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Xeek: An Efficient Method for ...

Xeek: An Efficient Method for Supporting XPath Evaluation with Relational Databases

Olli Luoma, Xeek: An Efficient Method for Supporting XPath Evaluation with Relational Databases. In: Local Proceedings of the 10th East-European Conference on Advances in databases and Information Systems (ADBIS 2006), Thessaloniki, Hellas, September 3-7, 2006., 215, CEUR-WP, 2006.

Abstract:

We introduce Xeek, a method for managing XML documents using relational
databases. Most previous proposals in which the XPath axes are evaluated
using only the pre- and postorder numbers of the nodes have quite
convincingly been shown to suffer from scalability problems. Thus, Xeek
stores some redundant structural information which can be used speed up
XPath evaluation even when a large set of context nodes is used. Our
idea is to select a set of inner nodes to act as proxy nodes and store
the ancestor information only for the proxies. To demonstrate the
effectiveness of our method, we present the results of our experiments
in which Xeek outperformed the previous methods based on relational
databases as well as an established commercial XML database product.

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpLuoma06a,
  title = {Xeek: An Efficient Method for Supporting XPath Evaluation with Relational Databases},
  booktitle = {Local Proceedings of the 10th East-European Conference on Advances in databases and Information Systems (ADBIS 2006), Thessaloniki, Hellas, September 3-7, 2006.},
  author = {Luoma, Olli},
  volume = {215},
  publisher = {CEUR-WP},
  year = {2006},
}

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

Edit publication