Relational completeness of query languages for annotated databases
type: Item
instance of: scholarly article
title: Relational completeness of query languages for annotated databases
zbMATH Open document ID: 1215.68089
author: Floris Geerts
author: Jan Van den Bussche
published in: Journal of Computer and System Sciences
publication date: 2011-05-04T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/11849
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 5883943
zbMATH Keywords: annotated relational databases
zbMATH Keywords: expressive power
zbMATH Keywords: query languages
MaRDI profile type: Publication
OpenAlex ID: W2156919279
cites work: Q4864249
cites work: Solvable cases of the decision problem
cites work: Q5691140
cites work: Computable queries for relational data bases
cites work: Converting untyped formulas to typed ones
DOI: 10.1016/J.JCSS.2010.04.007
description: scientific article; zbMATH DE number 5883943