Procedural languages for database queries and updates (Q751799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:751799 |
scientific article; zbMATH DE number 4178753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Procedural languages for database queries and updates |
scientific article; zbMATH DE number 4178753 |
Statements
Procedural languages for database queries and updates (English)
0 references
1990
0 references
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.
0 references
procedural languages
0 references
Relational database
0 references
query completeness
0 references
query languages
0 references
0.7659289240837097
0 references
0.7659289240837097
0 references
0.7444525361061096
0 references
0.7418948411941528
0 references
