CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year
By Class By Topic By Year
login
J. Van den Bussche, D. Van Gucht, and S. Vansummeren. Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery. In Proceedings of the 10th International Conference on Database Theory, ICDT 2005, volume 3363 of Lecture Notes in Computer Science, pages 99-113, Edinburgh, UK, January 2005. Springer-Verlag.
© Springer-Verlag 2005

Abstract

Two natural decision problems regarding the XML query language XQuery are well-definedness and semantic type-checking. We study these problems in the setting of a relational fragment of XQuery. We show that well-definedness and semantic type-checking are undecidable, even in the positive-existential case. Nevertheless, for a “pure” variant of XQuery, in which no identification is made between an item and the singleton containing that item, the problems become decidable. We also consider the analogous problems in the setting of the nested relational calculus.


Updated: 2017-03-27