DISCOVERING VEILED UNSATISFIABLE XPATH QUERIES

Jinghua Groppe, Volker Linnemann

2008

Abstract

The satisfiability problem of queries is an important determinant in query optimization. The application of a satisfiability test can avoid the submission and the unnecessary evaluation of unsatisfiable queries, and thus save processing time and query costs. If an XPath query does not conform to constraints in a given schema, or constraints from the query itself are inconsistent with each other, the evaluation of the query will return an empty result for any valid XML document, and thus the query is unsatisfiable. Therefore, we propose a schema-based approach to filtering the XPath queries not conforming to the constraints in the schema and the XPath queries with conflicting constraints. We present a complexity analysis of our approach, which proves that our approach is efficient at typical cases. We present an experimental analysis of our prototype, which shows the optimization potential of avoiding the evaluation of unsatisfiable queries.

Paper Citation

in Harvard Style

Groppe J. and Linnemann V. (2008). DISCOVERING VEILED UNSATISFIABLE XPATH QUERIES . In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8111-36-4, pages 149-158. DOI: 10.5220/0001684301490158

in Bibtex Style

@conference{iceis08,
author={Jinghua Groppe and Volker Linnemann},
title={DISCOVERING VEILED UNSATISFIABLE XPATH QUERIES},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2008},
pages={149-158},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001684301490158},
isbn={978-989-8111-36-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - DISCOVERING VEILED UNSATISFIABLE XPATH QUERIES
SN - 978-989-8111-36-4
AU - Groppe J.
AU - Linnemann V.
PY - 2008
SP - 149
EP - 158
DO - 10.5220/0001684301490158