Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Introduction to algorithms
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
Locking Protocols: From Exclusive to Shared Locks
Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Query Processing in Embedded Control Programs
DBTel '01 Proceedings of the VLDB 2001 International Workshop on Databases in Telecommunications II
Index selection for compiled database applications in embedded control programs
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
| Hi-index | 0.00 |
We report on initial research in tree locking (TL) schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of software modules operate on a common database in terms of a set of predefined transaction types, an architectural view that is also useful for embedded control programs. Since TL schemes are deadlock free, it becomes possible to entirely decouple concurrency control from any functionality relating to recovery. This property can help in the deployment of database technology to this new application area. Moreover, with knowledge of transaction workload, efficacious lock trees for runtime concurrency control can be determined at the time of system generation. Our experimental results show that TL produces better throughput than traditional two-phase locking (2PL) when transactions are write-only; and for main-memory data, TL performs comparably to 2PL even in workloads with many reads.