ACCELERATING XPATH AXES THROUGH STRUCTURAL PARTITIONING

Olli Luoma

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.

Paper Citation

in Harvard Style

Luoma O. (2007). ACCELERATING XPATH AXES THROUGH STRUCTURAL PARTITIONING . In Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-972-8865-77-1, pages 96-103. DOI: 10.5220/0001283800960103

in Bibtex Style

@conference{webist07,
author={Olli Luoma},
title={ACCELERATING XPATH AXES THROUGH STRUCTURAL PARTITIONING},
booktitle={Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2007},
pages={96-103},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001283800960103},
isbn={978-972-8865-77-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - ACCELERATING XPATH AXES THROUGH STRUCTURAL PARTITIONING
SN - 978-972-8865-77-1
AU - Luoma O.
PY - 2007
SP - 96
EP - 103
DO - 10.5220/0001283800960103