A calculus for complex objects
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Hilbert's tenth problem
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Containment of conjunctive queries: beyond relations as sets
ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Declarative specification of Web sites with S
The VLDB Journal — The International Journal on Very Large Data Bases
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
Querying nested collections
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Containment of nested XML queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Well-definedness and semantic type-checking in the nested relational calculus and XQuery
ICDT'05 Proceedings of the 10th international conference on Database Theory
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Well-definedness and semantic type-checking for the nested relational calculus
Theoretical Computer Science
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the expressibility of functions in XQuery fragments
Information Systems
On the expressive power of XQuery fragments
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
| Hi-index | 0.00 |
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 well-definedness 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.