Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Parallel query execution in PRISMA/DB
Proceedings of the PRISMA workshop on Parallel database systems
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Applying an update method to a set of receivers (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Operating system support for database management
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Deterministic Semantics of Set-Oriented Update Sequences
Proceedings of the Ninth International Conference on Data Engineering
Semantic Concurrency Control in Object-Oriented Database Systems
Proceedings of the Ninth International Conference on Data Engineering
Semantic Query Optimization for Methods in Object-Oriented Database Systems
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
Hi-index | 0.00 |
Efficient evaluation strategies for declarative updates have rarely been investigated. Due to possible dependencies between the resulting database state and the order in which records (objects) are processed, usually declarative updates are evaluated in a set-oriented way in order to ensure a deterministic evaluation. In this paper, we show that such dependencies can be detected by exploiting knowledge about conflicts between the operations that are used to access the database during the update evaluation. Thus most declarative updates can also be evaluated deterministically, and in some cases more efficiently, in a record-oriented way. We show that some of the detected conflicts can be relaxed or even be ignored, while a deterministic evaluation can still be guaranteed.