Re: Avoiding any locks in SQL Servers - read and understand....its magic.

From: Guido Stepken <stepken_at_little-idiot.de>
Date: Tue, 19 Aug 2003 12:53:58 +0200
Message-ID: <bhsvmo$fr2$06$1@news.t-online.com>

Hi quarkman ???

The behaviour of set indexes really has much influence on the performance. Whereas HASH index needs a complete reread of all column data, btree or b+ or avl trees can be reindexed at high load. Note: it has to be programmed with threads, otherwise database hangs. Singe threaded daemons / services have problems with it.

regards, Guido Stepken

>quarkman wrote:
> Strikes me it's all a load of hokum, especially since that documentation
> goes on to say that if there's an index on the table, then lo and behold
> (index) page-level locks are taken (not that I'm surprised) as the index
> is updated to reflect changes on the underlying table. And if the index
> is locked, where does that leave the table?
>
> HJR
>
>
>
Received on Tue Aug 19 2003 - 05:53:58 CDT