Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/964
Title: Deciding Well-Definedness of First-Order, Object-Creating Operations over Tree-Structured
Authors: VANSUMMEREN, Stijn 
Issue Date: 2005
Abstract: The well-definedness problem for a database query language consists of checking, given an expression and an input type, whether the semantics of the expression is defined for all inputs adhering to the input type. In this paper we study the well-definedness problem for a family of first-order, object-creating query languages which are evaluated in a tree-structured, list-based data model. We identify properties of base operations which can make the problem undecidable and give restrictions which are sufficient to ensure decidability. As a direct result, we obtain a large fragment of XQuery for which well-definedness is decidable.
Document URI: http://hdl.handle.net/1942/964
Category: A3
Type: Preprint
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
deciding.pdf555.98 kBAdobe PDFView/Open
Show full item record

Page view(s)

14
checked on Mar 14, 2022

Download(s)

4
checked on Mar 14, 2022

Google ScholarTM

Check


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