Procedural languages for database queries and updates (Q751799): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Horst Zeitler / rank | |||
Property / reviewed by | |||
Property / reviewed by: Horst Zeitler / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Datalog extensions for database queries and updates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3204028 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4172944 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computable queries for relational data bases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3798292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Format Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relational queries computable in polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3668890 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the expressive power of the relational algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:05, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Procedural languages for database queries and updates |
scientific article |
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