Relational completeness of query languages for annotated databases

DOI10.1016/j.jcss.2010.04.007zbMath1215.68089OpenAlexW2156919279MaRDI QIDQ532367

Floris Geerts, Jan Van den Bussche

Publication date: 4 May 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/11849

zbMATH Keywords

expressive powerquery languagesannotated relational databases

Mathematics Subject Classification ID

Database theory (68P15) Theory of programming languages (68N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Computable queries for relational data bases
• Converting untyped formulas to typed ones
• Solvable cases of the decision problem

This page was built for publication: Relational completeness of query languages for annotated databases