Re: B-Tree Locking
From: Jan.Hidders <hidders_at_hcoss.uia.ac.be>
Date: 26 Jun 2002 17:39:54 +0200
Message-ID: <3d19e04a$1_at_news.uia.ac.be>
Date: 26 Jun 2002 17:39:54 +0200
Message-ID: <3d19e04a$1_at_news.uia.ac.be>
In article <3d19d65e$0$1234$ff467cc4_at_host.example.com>,
John Walker <NoMail_at_nowhere.nohow> wrote:
>
>Please point me to some information on B-Tree locking protocols.
There is a good overview in
V. Srinivasan, Michael J. Carey: Performance of B+ Tree Concurrency Algorithms. VLDB Journal 2(4): 361-406(1993)
It's on-line:
http://www.informatik.uni-trier.de/~ley/db/journals/vldb/SrinivasanC93.html
Kind regards,
Received on Wed Jun 26 2002 - 17:39:54 CEST