ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Performance evaluation of the time warp distributed simulation mechanism
Performance evaluation of the time warp distributed simulation mechanism
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Semantics based transaction management techniques for replicated data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Formal model of correctness without serializabilty
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using semantic knowledge of transactions to increase concurrency
ACM Transactions on Database Systems (TODS)
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Quasi serializability: a correctness criterion for global concurrency control in InterBase
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Organizing long-running activities with triggers and transactions
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On rigorous Transaction Scheduling
IEEE Transactions on Software Engineering
Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Extending the transaction model to capture more meaning
ACM SIGMOD Record
On Serializability of Multidatabase Transactions Through Forced Local Conflicts
Proceedings of the Seventh International Conference on Data Engineering
The Time Warp Mechanism for Database Concurrency Control
Proceedings of the Second International Conference on Data Engineering
Transactions on typed objects
IEEE Transactions on Knowledge and Data Engineering
Temporally Faithful Execution of Business Transactions
CAiSE '00 Proceedings of the 12th International Conference on Advanced Information Systems Engineering
A Delayed-Initiation Risk-Free Multiversion Temporally Correct Algorithm (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Hi-index | 0.00 |
Database applications often impose temporal dependencies between transactions that must be satisfied to preserve data consistency. The extant correctness criteria used to schedule the execution of concurrent transactions are either time independent or use strict, difficult to satisfy real-time constraints. On one end of the spectrum, serializability completely ignores time. On the other end, deadline scheduling approaches consider the outcome of each transaction execution correct only if the transaction meets its real-time deadline. In this article, we explore new correctness criteria and scheduling methods that capture temporal transaction dependencies and belong to the broad area between these two extreme approaches. We introduce the concepts of succession dependency and chronological dependency and define correctness criteria under which temporal dependencies between transactions are preserved even if the dependent transactions execute concurrently. We also propose a chronological scheduler that can guarantee that transaction executions satisfy their chronological constraints. The advantages of chronological scheduling over traditional scheduling methods, as well as the main issues in the implementation and performance of the proposed scheduler, are discussed.