Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/962
Title: Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract
Authors: VAN DEN BUSSCHE, Jan 
Van Gucht, Dirk
VANSUMMEREN, Stijn 
Issue Date: 2005
Publisher: Springer
Source: DATABASE THEORY - ICDT 2005, PROCEEDINGS. p. 99-113
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE
Series/Report no.: 3363
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 ldquopurerdquo 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.
Document URI: http://hdl.handle.net/1942/962
ISSN: 0302-9743
DOI: 10.1007/b104421
ISI #: 000227472000007
Category: A1
Type: Journal Contribution
Validations: ecoom 2006
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
Welldefinedness.pdfPublished version412.93 kBAdobe PDFView/Open
Show full item record

WEB OF SCIENCETM
Citations

3
checked on May 21, 2022

Page view(s)

14
checked on May 27, 2022

Download(s)

6
checked on May 27, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.