Affiliation:
1. Institut National de Recherche en Informatiwue et en Automatique, Le Chesnay, France
2. Univ. of California at San Diego, La Jolla
Abstract
A large class of relational database update transactions is investigated with respect to equivalence and optimization. The transactions are straight-line programs with inserts, deletes, and modifications using simple selection conditions. Several basic results are obtained. It is shown that transaction equivalence can be decided in polynomial time. A number of optimality criteria for transactions are then proposed, as well as two normal forms. Polynomial-time algorithms for transaction optimization and normalization are exhibited. Also, an intuitively appealing system of axioms for proving transaction equivalence is introduced. Finally, a simple, natural subclass of transactions, called strongly acyclic, is shown to have particularly desirable properties.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries;Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data;2020-06-11
2. The Quest for Data Independence, Minimal Plausibility, and Formalization: The Relational Data Model (RDM);Conceptual Data Modeling and Database Design: A Fully Algorithmic Approach, Volume 1;2015-09-29
3. On the Foundations of Computing Deltas Between RDF Models;The Semantic Web;2007
4. Analysis and optimization of active databases;Data & Knowledge Engineering;2002-03
5. References;Transactional Information Systems;2002