On deciding well-definedness for query languages on trees

DOI10.1145/1255443.1255447MaRDI QIDQ3546341zbMATH OpenOpenAlexWikidataFDO

Authors Stijn Vansummeren

Publication date 21 December 2008

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1255443.1255447

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Database Theory - ICDT 2005
• Well-definedness and semantic type-checking for the nested relational calculus
• Logical definability and query languages over ranked and unranked trees
• XML with data values: Typechecking revisited.
• Highly expressive query languages for unordered data trees

Cited in

(4)

• Logical definability and query languages over ranked and unranked trees
• Conjunctive query containment over trees
• Database Theory - ICDT 2005
• Well-definedness and semantic type-checking for the nested relational calculus

Describes a project that uses

Uses Software

• XDuce
• CDuce

This page was built for publication: On deciding well-definedness for query languages on trees

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