Home // DBKDA 2013, The Fifth International Conference on Advances in Databases, Knowledge, and Data Applications // View article

Typing XPath Subexpressions With Respect to an XML Schema

Authors:
Yasunori Ishihara
Kenji Hashimoto
Atsushi Ohno
Takuji Morimoto
Toru Fujiwara

Keywords: XPath, static analysis, type, XML schema

Abstract:
This paper discusses typing XPath subexpressions with respect to an XML schema, which is a new static analysis problem of XPath expressions. More formally, the typing problem is to decide whether there exists an XML document conforming to a given XML schema such that the nodes of the document matching to given subexpressions of a given XPath expression are of the given types. Deciding this problem is useful for query rewriting induced by schema evolution or integration. The contribution of this paper includes a decision algorithm for the typing problem, provided that XPath expressions include no path union operator. Moreover, it is shown that the typing problem is reducible to the XPath satisfiability problem in the presence of DTDs, for which many tractability results are known.

Pages: 128 to 133

Copyright: Copyright (c) IARIA, 2013

Publication date: January 27, 2013

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-247-9

Location: Seville, Spain

Dates: from January 27, 2013 to February 1, 2013