Re: B-Tree Locking
From: John Walker <NoMail_at_nowhere.nohow>
Date: Fri, 28 Jun 2002 09:00:47 +0200
Message-ID: <3d1c099a$0$1234$ff467cc4_at_host.example.com>
Date: Fri, 28 Jun 2002 09:00:47 +0200
Message-ID: <3d1c099a$0$1234$ff467cc4_at_host.example.com>
Thanx
"Jan.Hidders" <hidders_at_hcoss.uia.ac.be> wrote in message
news: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,
>
> -- Jan Hidders
>
>
Received on Fri Jun 28 2002 - 09:00:47 CEST