Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery
Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren
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.
Create a lesson
Related papers
Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Oktie Hassanzadeh, Dharmashankar Subramanian
ProvQML: Efficient Provenance Capture for Machine Learning as Recursive Aggregate SQL [Extended Version]
Nkechi J. Akinwale, Seokki Lee
Benchmarking Content-Defined Chunking Algorithms for Data Deduplication
Marcel Gregoriadis, Leonhard Balduf, Björn Scheuermann et al.
Time-Varying Favorite-Longshot Bias in Polymarket Weather Markets
Shouchen Qiu, Huaijun Qiu
MatQuery: Execution-Grounded Natural-Language Querying over Heterogeneous Materials Databases
Chen Jason Zhang, Qi Chen
CALQA: Conformal Screening of Forecast-Ensemble Configurations from One Mergeable State
Xiufeng Liu, Ruyu Liu, Yusen Liu et al.