Locking Granularity in Multiprocessor Database Systems
نویسندگان
چکیده
Locking is a common approach to solve integrity problems that arise from multiple concurrent accesses to a database system. Locking granularity refers to the size of a lockable data unit, called a "granule", in a database system. Fine granularity improves system performance by increasing concurrency level but it also increases lock management overhead. Coarse granularity, on the other hand, sacrifices system performance but lowers the lock management cost. This paper explores the impact of granule size on performance of multiprocessor database systems.
منابع مشابه
A Performance Study of Locking Granularity in Shared-Nothing Parallel Database Systems
Locking granularity refers to the size of a lockable data unit, called a "granule", in a database system. Fine granularity improves system performance by increasing concurrency level but it also increases lock management overhead. Coarse granularity, on the other hand, sacrifices system performance but lowers the lock management cost. This paper explores the impact of granule size on performanc...
متن کاملLocking Protocols for Large - ScaleCache - Coherent Shared Memory
Signiicant performance advantages can be realized by implementing a database system on a cache-coherent shared memory multiprocessor. An eecient implementation of a lock manager is a prerequisite for eecient transaction processing in multiprocessor database systems. To this end, we examine two approaches to the implementation of locking in a cache-coherent shared memory multiprocessor database ...
متن کاملcient Locking for Shared Memory Database Systems 1
Signi cant performance advantages can be realized by implementing a database system on a shared memory multiprocessor. An e cient implementation of a lock manager is a prerequisite for e cient transaction processing in multiprocessor database systems. To this end, we advocate adopting an autonomous locking strategy. In autonomous locking, transactions acquire and release locks via operations on...
متن کاملHierarchical locking in B-tree indexes
Three designs of hierarchical locking suitable for B-tree indexes are explored in detail and their advantages and disadvantages compared. Traditional hierarchies include index, leaf page, and key range or key value. Alternatively, locks on separator keys in interior B-tree pages can protect key ranges of different sizes. Finally, for keys consisting of multiple columns, key prefixes of differen...
متن کاملEfficient Locking and Caching of Data in the Multisystem Shard Disks Transaction Environment
This paper describes a technique for use when multiple instances of a data base management system (DBMS), each with its own cache (buffer pool), can directly read and modify any data stored on a set of shared disks. Global locking and coherency control protocols are necessary in this context for assuring transaction consistency and for maintaining coherency of the data cached in the multiple ca...
متن کامل