Review - Efficient Locking for Concurrent Operations on B-Trees.
Dennis Shasha:
Review - Efficient Locking for Concurrent Operations on B-Trees.
ACM SIGMOD Digital Review 1: (1999) BibTeX
Review
My favorite papers have always been the ones that cause me to change my
intellectual prejudices. I read Lehman and Yao's paper on B-trees while
trying to find a thesis topic in 1981. I had
just studied concurrency control theory with Phil Bernstein and Nat Goodman
while they were both at Harvard and was convinced that conflict-preserving
serializability was the end of the story. Lehman and Yao's paper showed
executions that were clearly correct, but didn't seem to fit this model.
After trying to stretch the model for the next year, I realized a new one
was needed and wrote my thesis on a generalized model
for concurrency in index structures.
Copyright © 1999 by the author(s).
Review published with permission.
References
- [1]
- Philip L. Lehman, S. Bing Yao:
Efficient Locking for Concurrent Operations on B-Trees.
ACM Trans. Database Syst. 6(4): 650-670(1981) BibTeX
BibTeX
Digital Review - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Digital Review: Copyright © by ACM (info@acm.org),
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:57:24 2009
