On deciding well-definedness for query languages on trees

DOI10.1145/1255443.1255447zbMATH Open1312.68084OpenAlexW2055069928WikidataQ130988333 ScholiaQ130988333MaRDI QIDQ3546341FDOQ3546341

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

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

Mathematics Subject Classification ID

Database theory (68P15)

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

Uses Software

• CDuce
• XDuce

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)