Algebraic Optimization of Nested XPath Expressions

Atlanta, Georgia April 03-April 07

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.15

22nd International Conference on Data ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Matthias Brantner Articles by Carl-Christian Kanne Articles by Guido Moerkotte Articles by Sven Helmer

	ASCII Text	x
	Matthias Brantner, Carl-Christian Kanne, Guido Moerkotte, Sven Helmer, "Algebraic Optimization of Nested XPath Expressions," Data Engineering, International Conference on, pp. 128, 22nd International Conference on Data Engineering (ICDE'06), 2006.

	BibTex	x
	@article{ 10.1109/ICDE.2006.15, author = {Matthias Brantner and Carl-Christian Kanne and Guido Moerkotte and Sven Helmer}, title = {Algebraic Optimization of Nested XPath Expressions}, journal ={Data Engineering, International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2570-9}, pages = {128}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.15}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Engineering, International Conference on TI - Algebraic Optimization of Nested XPath Expressions SN - 0-7695-2570-9 SP EP A1 - Matthias Brantner, A1 - Carl-Christian Kanne, A1 - Guido Moerkotte, A1 - Sven Helmer, PY - 2006 KW - null VL - 0 JA - Data Engineering, International Conference on ER -

Matthias Brantner, Universitat Mannheim, Gemany

Carl-Christian Kanne, Universitat Mannheim, Germany

Guido Moerkotte, Universitat Mannheim, Germany

Sven Helmer, Birkbeck College, University of London, UK

The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the best published approaches for evaluating XPath have unsatisfactory performance when applied to nested queries.

We examine optimization techniques that unnest complex XPath queries. For this purpose, we classify XPath expressions particularly with regard to properties that are relevant for unnesting. We present algebraic equivalences that transform nested expressions into unnested expressions. In our experiments we compare the evaluation times with existing XPath evaluators and the naive evaluation.

Citation:

Matthias Brantner, Carl-Christian Kanne, Guido Moerkotte, Sven Helmer, "Algebraic Optimization of Nested XPath Expressions," icde, pp.128, 22nd International Conference on Data Engineering (ICDE'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.