Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery

Details Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery

2004-06-29

arxiv.org/abs/cs/0406060v1

Computer Science

Databases

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-525669