Please use this identifier to cite or link to this item:
Title: Deciding well-definedness of XQuery fragments
Authors: VANSUMMEREN, Stijn 
Issue Date: 2005
Publisher: ACM
Source: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. p. 37-48.
Abstract: Unlike in traditional query languages, expressions in XQuery can have an undefined meaning (i.e., these expressions produce a run-time error). It is hence natural to ask whether we can solve the well-definedness problem for XQuery: given an expression and an input type, check whether the semantics of the expression is defined for all inputs adhering to the input type. In this paper we investigate the welldefinedness problem for non-recursive fragments of XQuery under a bounded-depth type system. We identify properties of base operations which can make the problem undecidable and give conditions which are sufficient to ensure decidability.
Document URI:
Link to publication:
ISBN: 1-59593-062-0
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
decidingwell.pdfPublished version199.26 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 19, 2022


checked on May 19, 2022

Google ScholarTM



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