Procedural languages for database queries and updates
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.
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 4064537 (Why is no real title available?)
- scientific article; zbMATH DE number 3607517 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On the expressive power of the relational algebra
- Relational queries computable in polynomial time
- Relationships between nondeterministic and deterministic tape complexities
- The Format Model
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- Datalog extensions for database queries and updates
- Semantics and expressiveness issues in active databases
- The expressive power of stratified logic programs with value invention
- Verifiable properties of database transactions
- Complete geometric query languages
- Extended nested relations
- A semantics for a class of non-deterministic and causal production system programs
- Non-determinism in logic-based languages
- The expressive powers of stable models for bound and unbound DATALOG queries
- A first step towards implementing dynamic algebraic dependences
- Abstract state machines and computationally complete query languages
- On the decidability of the termination problem of active database systems
- XML database transformations
- The algebraic structure of a semigroup of sets of transformations with restricted range
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- On the completeness of object-creating database transformation languages
- Computing on structures
- scientific article; zbMATH DE number 219233 (Why is no real title available?)
- scientific article; zbMATH DE number 871233 (Why is no real title available?)
- When can we answer queries using result-bounded data interfaces?
- Semantics and expressive power of nondeterministic constructs in deductive databases
- The expressive power of cardinality-bounded set values in object-based data models
- A semideterministic approach to object creation and nondeterminism in database queries
- Knowledgebase transformations
- Algebraic and calculus query languages for recursively typed complex objects
This page was built for publication: Procedural languages for database queries and updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751799)
