Where academic tradition
meets the exciting future

Accelerating XPath Axes through Structural Partitioning

Olli Luoma, Accelerating XPath Axes through Structural Partitioning. In: Proceedings of the 3rd International Conference on Web Information Systems and Technologies, INSTICC Press, 2007.

Abstract:

The query evaluation algorithms of practically all XML management systems are based on structural joins, i.e., operations which determine all occurrences of parent/child, ancestor/descendant, preceding/following etc. relationships between node sets. In this paper, we present a simple method for accelerating structural joins which is very easy to implement on different platforms. Our idea is to split the nodes into disjoint partitions and use this information to avoid unnecessary structural joins. Despite its simplicity, our proposal can considerably accelerate XPath evaluation on different XML management systems. To exemplify this, we describe two implementation options of our method - one built from the scratch and one based on a relational database - and present the results of our experiments.

Files:

Abstract in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpLuoma07a,
  title = {Accelerating XPath Axes through Structural Partitioning},
  booktitle = {Proceedings of the 3rd International Conference on Web Information Systems and Technologies},
  author = {Luoma, Olli},
  publisher = {INSTICC Press},
  year = {2007},
}

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

Edit publication