The Community for Technology Leaders
1987 IEEE Third International Conference on Data Engineering (1987)
Los Angeles, CA, USA
Feb. 3, 1987 to Feb. 5, 1987
ISBN: 978-0-8186-0762-2
pp: 96-103
J. Eliot B. Moss , Department of Computer and Information Science, University of Massachusetts, Amherst, 01003, USA
Bruce Leban , Department of Computer and Information Science, University of Massachusetts, Amherst, 01003, USA
Panos K. Chrysanthis , Department of Computer and Information Science, University of Massachusetts, Amherst, 01003, USA
ABSTRACT
The database cache transaction recovery technique as proposed in [Elhard and Bayer 84] offers significant performance advantages for reliable database systems. However, the smallest granularity of locks it provides is the page. Here we present two schemes supporting smaller granularity. The first scheme allows maximal concurrency consistent with physical two-phase locking, with the same per-transaction I/O cost as original database cache scheme. The second scheme offers the same concurrency as the first, but features reduced I/O on commit, at the cost of some increase recovery time.
INDEX TERMS
CITATION

J. E. Moss, B. Leban and P. K. Chrysanthis, "Finer grained concurrency for the database cache," 1987 IEEE Third International Conference on Data Engineering(ICDE), Los Angeles, CA, USA, 1987, pp. 96-103.
doi:10.1109/ICDE.1987.7272362
96 ms
(Ver 3.3 (11022016))