Declarative updates of relational databases
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 20 (1) , 42-70
- https://doi.org/10.1145/202106.202110
Abstract
This article presents a declarative language, called update calculus , of relational database updates. A formula in update calculus involves conditions for the current database, as well as assertions about a new database. Logical connectives and quantifiers become constructors of complex updates, offering flexible specifications of database transformations. Update calculus can express all nondeterministic database transformations that are polynomial time. For set-at-a-time evaluation of updates, we present a corresponding update algebra . Existing techniques of query processing can be incorporated into update evaluation. We show that updates in update calculus can be translated into expressions in update algebra and vice versa.Keywords
This publication has 19 references indexed in Scilit:
- Simplification rules and complete axiomatization for relational update transactionsACM Transactions on Database Systems, 1991
- Datalog extensions for database queries and updatesJournal of Computer and System Sciences, 1991
- Non-determinism in logic-based languagesAnnals of Mathematics and Artificial Intelligence, 1991
- Safety and translation of relational calculusACM Transactions on Database Systems, 1991
- Procedural languages for database queries and updatesJournal of Computer and System Sciences, 1990
- Hypothetical datalog: complexity and expressibilityTheoretical Computer Science, 1990
- Updates of Relational ViewsJournal of the ACM, 1984
- Query Optimization in Database SystemsACM Computing Surveys, 1984
- On the correct translation of update operations on relational viewsACM Transactions on Database Systems, 1982
- Update semantics of relational viewsACM Transactions on Database Systems, 1981