Considerable effort has been devoted to minimizing XPath queries under the assumption that the minimal query is faster than the original query. However, little attention has been paid to the validity of the assumption. In this paper, we provide a detailed analysis on the effectiveness of XPath query minimization and present an extensive experimental evaluation on the effectiveness using six publicly available XQuery engines. To the best of our knowledge, this is the first work done towards this objective. Experiments on real and synthetic data sets show that although the assumption is valid for some cases, the performance of the minimal query is often lower than or almost equal to that of the original query.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ki-Hoon LEE, "How XPath Query Minimization Impacts Query Processing Performance" in IEICE TRANSACTIONS on Information,
vol. E95-D, no. 9, pp. 2258-2264, September 2012, doi: 10.1587/transinf.E95.D.2258.
Abstract: Considerable effort has been devoted to minimizing XPath queries under the assumption that the minimal query is faster than the original query. However, little attention has been paid to the validity of the assumption. In this paper, we provide a detailed analysis on the effectiveness of XPath query minimization and present an extensive experimental evaluation on the effectiveness using six publicly available XQuery engines. To the best of our knowledge, this is the first work done towards this objective. Experiments on real and synthetic data sets show that although the assumption is valid for some cases, the performance of the minimal query is often lower than or almost equal to that of the original query.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.2258/_p
Copy
@ARTICLE{e95-d_9_2258,
author={Ki-Hoon LEE, },
journal={IEICE TRANSACTIONS on Information},
title={How XPath Query Minimization Impacts Query Processing Performance},
year={2012},
volume={E95-D},
number={9},
pages={2258-2264},
abstract={Considerable effort has been devoted to minimizing XPath queries under the assumption that the minimal query is faster than the original query. However, little attention has been paid to the validity of the assumption. In this paper, we provide a detailed analysis on the effectiveness of XPath query minimization and present an extensive experimental evaluation on the effectiveness using six publicly available XQuery engines. To the best of our knowledge, this is the first work done towards this objective. Experiments on real and synthetic data sets show that although the assumption is valid for some cases, the performance of the minimal query is often lower than or almost equal to that of the original query.},
keywords={},
doi={10.1587/transinf.E95.D.2258},
ISSN={1745-1361},
month={September},}
Copy
TY - JOUR
TI - How XPath Query Minimization Impacts Query Processing Performance
T2 - IEICE TRANSACTIONS on Information
SP - 2258
EP - 2264
AU - Ki-Hoon LEE
PY - 2012
DO - 10.1587/transinf.E95.D.2258
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2012
AB - Considerable effort has been devoted to minimizing XPath queries under the assumption that the minimal query is faster than the original query. However, little attention has been paid to the validity of the assumption. In this paper, we provide a detailed analysis on the effectiveness of XPath query minimization and present an extensive experimental evaluation on the effectiveness using six publicly available XQuery engines. To the best of our knowledge, this is the first work done towards this objective. Experiments on real and synthetic data sets show that although the assumption is valid for some cases, the performance of the minimal query is often lower than or almost equal to that of the original query.
ER -