On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
The Escrow transactional method
ACM Transactions on Database Systems (TODS)
Semantics based transaction management techniques for replicated data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
High contention in a stock trading database: a case study
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Using histories to implement atomic objects
ACM Transactions on Computer Systems (TOCS)
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Consistency and orderability: semantics-based correctness criteria for databases
ACM Transactions on Database Systems (TODS)
Bounded Inconsistency for Type-Specific Concurrency Control
Distributed and Parallel Databases
Concurrency control issues in nested transactions
The VLDB Journal — The International Journal on Very Large Data Bases
A Practical and Modular Implementation of Extended Transaction Models
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Empirical Comparison of Database Concurrency Schemes
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Confirmation: increasing resource availability for transactional workflows
Information Sciences: an International Journal
Locking Protocols for Materialized Aggregate Join Views
IEEE Transactions on Knowledge and Data Engineering
Locking protocols for materialized aggregate join views
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Democratizing transactional programming
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Democratizing transactional programming
Proceedings of the 12th International Middleware Conference
Democratizing transactional programming
Communications of the ACM
| Hi-index | 0.02 |
In many large database applications there are certain elements mostly containing aggregate information, which are very frequently referred to (read and modified) by many transactions. If access to such fields has to obey to conventional two-phase lock protocols (1,2), transactions will be serialized in front of these "hot spots", i.e. the degree of parallelism is reduced. To avoid this kind of lock contention some improved lock protocols have been proposed, the most interesting of which is the one implemented in IMS Fast Path (3,4), where add and subtract may be performed concurrently on numerical fields, since backout is always possible with the unique inverse of each operand. A similar scheme is proposed in (10). We expand this idea to parallel readers and writers on numerical data types, proving that under certain conditions the result of such concurrent operations is consistent in the sense that it is equal to some serial schedule (2,5).