Database Theory - ICDT 2005

DOI10.1007/B104421zbMATH Open1108.68448OpenAlexW4232873349MaRDI QIDQ5316619FDOQ5316619

Stijn Vansummeren, D. Van Gucht, Jan Van den Bussche

Publication date: 13 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104421

Recommendations

• Well-definedness and semantic type-checking for the nested relational calculus
• On deciding well-definedness for query languages on trees
• XML with data values: Typechecking revisited.
• Typechecking XML views of relational databases
• Well-defined NRC queries can be typed (extended abstract)

Mathematics Subject Classification ID

Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cited In (3)

• On deciding well-definedness for query languages on trees
• The complexity of higher-order queries
• Well-definedness and semantic type-checking for the nested relational calculus

This page was built for publication: Database Theory - ICDT 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316619)