ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Performance results on multiversion timestamp concurrency control with predeclared writesets
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Distributed and Multi-Database Systems
Distributed and Multi-Database Systems
Database Concurrency Control: Methods, Performance, and Analysis
Database Concurrency Control: Methods, Performance, and Analysis
An operational model for database system reliability
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The Time Warp Mechanism for Database Concurrency Control
Proceedings of the Second International Conference on Data Engineering
Improving Concurrency Control in Distributed Databases with Predeclared Tables
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
T3C: A Temporally Correct Concurrency Control Algorithm for Distributed Databases
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
| Hi-index | 0.00 |
In this paper, we focus on the temporary return of data values that are incorrect for given transactional semantics and could have catastrophic effects similar to those in parallel and discrete event simulation. In many applications using OLTP environments, for instance, it is best to delay the response to a transaction's read request until it is either known or unlikely that a write message from an older update transaction will not make the response incorrect. Examples of such applications are those where aberrant behavior is too costly, and those in which pre-committed data is visible to some reactive entity. In light of the avoidance of risk in this approach, we propose a Risk-free Multiversion Temporally Correct (RFMVTC) concurrency control algorithm. We discuss the algorithm, its implementation and report on the performance results of simulation models using a cluster of workstations.