The Escrow transactional method
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The virtues of locking by symbolic names
Journal of Algorithms
Efficient and correct execution of parallel programs that share memory
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using semantic knowledge of transactions to increase concurrency
ACM Transactions on Database Systems (TODS)
Consistency of transactions and random batch
ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Multilevel atomicity—a new correctness criterion for database concurrency control
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Interval hierarchies and their application to predicate files
ACM Transactions on Database Systems (TODS)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
Concurrency Control Problem for Database Systems
Concurrency Control Problem for Database Systems
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
Reducing recovery constraints on locking based protocols
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relative serializability (extended abstract): an approach for relaxing the atomicity of transactions
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Applying formal methods to semantic-based decomposition of transactions
ACM Transactions on Database Systems (TODS)
Dynamic restructuring of transactional workflow activities: a practical implementation method
Proceedings of the seventh international conference on Information and knowledge management
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Global Semantic Serializability: An Approach to Increase Concurrency in Multidatabase Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Supporting Partial Isolation in Flat Transaction
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Versioning concurrency control for hard real-time systems
Journal of Systems and Software
An extended transaction model approach for multilevel secure transaction processing
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
On avoiding remote blocking via real-time concurrency control protocols
Journal of Systems and Software
Applying Semantic Knowledge to Real-Time Update of Access Control Policies
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
Chopping transactions into pieces is good for performance but may lead to non-serializable executions. Many researchers have reacted to this fact by either inventing new concurrency control mechanisms, weakening serializability, or both. We adopt a different approach.We assume a user who• has only the degree 2 and degree 3 consistency options offered by the vast majority of conventional database systems; and •knows the set of transactions that may run during a certain interval (users are likely to have such knowledge for online or real-time transactional applications).Given this information, our algorithm finds the finest partitioning of a set of transactions TranSet with the following property; if the partitioned transactions execute serializably, then TranSet executes serializably. This permits users to obtain more concurrency while preserving correctness. Besides obtaining more inter-transaction concurrency, chopping transactions in this way can enhance intra-transaction parallelism.The algorithm is inexpensive, running in O(n x (e + m)) time using a naive implementation where n is the number of edges in the conflict graph among the transactions, and m is the maximum number of accesses of any transaction. This makes it feasible to add as a tuning knob to practical systems.