Database survivability under dynamic constraints
From MaRDI portal
The connection between static constraints satisfied by a database and its future evolution under dynamic constraints is investigated using the notions of survivability and survivability-closure. The static constraints considered here are functional dependencies (fd's). The dynamic constraints are restricted to commonly arising analogs of fd's, called dynamic fd's. The results provide new tools for the design of database schemas containing both static and dynamic constraints.
Recommendations
Cites work
- A variant of a recursively unsolvable problem
- Characterizations for functional dependency and Boyce-Codd normal form families
- Finitely Specifiable Implicational Dependency Families
- Formal semantics for time in databases
- Functional Dependencies in a Relational Database and Propositional Logic
- Horn clauses and database dependencies
- scientific article; zbMATH DE number 3648167 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- On the Structure of Armstrong Relations for Functional Dependencies
- Properties of functional-dependency families
Cited in
(7)- A first step towards implementing dynamic algebraic dependences
- Dynamic constraints and object migration
- scientific article; zbMATH DE number 4058916 (Why is no real title available?)
- Patterns of self-stabilization in database consistency maintenance
- scientific article; zbMATH DE number 1755580 (Why is no real title available?)
- scientific article; zbMATH DE number 2100558 (Why is no real title available?)
- On homeostatic behavior of dynamic deductive data bases
This page was built for publication: Database survivability under dynamic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087339)
