Procedural languages for database queries and updates
type: Item
instance of: scholarly article
title: Procedural languages for database queries and updates
zbMATH Open document ID: 0715.68019
DOI: 10.1016/0022-0000(90)90036-K
author: Serge Abiteboul
author: Victor Vianu
published in: Journal of Computer and System Sciences
publication date: 1990-01-01T00:00:00Z
review text: Relational database transformations, encompassing database queries and updates, are studied. A completeness criterion for database languages is introduced, based on their capability to express database transformations. Specific deterministic and non-deterministic transformation languages are defined and shown to be complete. Restrictions on their languages a re also considered and their expressive power characterized. The classes of transformation captured by these languages include the transformations computable in polynomial time and space (in the non-deterministic case), and the fixpoint queries and the while queries (in the deterministic case). Connections with existing notions of query completeness, and corresponding query languages, are exhibited.
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 4178753
zbMATH Keywords: procedural languages
zbMATH Keywords: Relational database
zbMATH Keywords: query completeness
zbMATH Keywords: query languages
reviewed by: Horst Zeitler
MaRDI profile type: Publication
cites work: Datalog extensions for database queries and updates
cites work: Q3204028
cites work: Q4172944
cites work: Computable queries for relational data bases
cites work: Q3798292
cites work: Q5592246
cites work: The Format Model
cites work: Relational queries computable in polynomial time
cites work: Q3668890
cites work: On the expressive power of the relational algebra
cites work: Relationships between nondeterministic and deterministic tape complexities
description: scientific article; zbMATH DE number 4178753