Locking and Latching in a Memory-Resident Database System (1992)
| Venue: | In Proc. of the Int'l Conf. on Very Large Databases |
| Citations: | 30 - 2 self |
BibTeX
@INPROCEEDINGS{Gottemukkala92lockingand,
author = {Vibby Gottemukkala and Tobin J. Lehman},
title = {Locking and Latching in a Memory-Resident Database System},
booktitle = {In Proc. of the Int'l Conf. on Very Large Databases},
year = {1992},
pages = {533--544}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
As part of the Starburst extensible database project developed at the IBM Almaden Research Center, we designed and implemented a memory-resident storage component that co-exists with Starburst's diskoriented storage component. The two storage components share the same common services, such as query optimization, transaction management, etc. However, the memory-resident storage component is faster than the disk-oriented storage component and hence needs faster run-time services. This paper examines two runtime services, the lock manager and the latch mechanism, and investigates possible cost-cutting measures. We propose the use of of a single latch for protecting a table, all of its indexes, and all of its related lock information, in order to reduce storage component latch costs. We then show that although a table-level latch is a large granule latch, it does not significantly restrict concurrency. We also examine traditional lock manager design and suggest a different design that is a...
