Lukas Barton said:
> Obnoxio The Clown wrote:
>> Lukas Barton said:
>>
>>> It does not, because Informix locks also previous and next row in all
>>> indexes. So that the probability of locking rows that other user want
>>> to
>>> read is more than zero.
>>>
>>
>> I'm fascinated by this assertion. I guess I've just been unbelievably
>> lucky all my working life.
>>
> See
> -
> http://publib.boulder.ibm.com/infoce...64%65%78%22%20
> (2 per changed key value)

But you're saying there would be 3 per changed key value.

> - http://docs.rinet.ru/InforSmes/ch15/ch15.htm ( For an index, three
> more locks are necessary--one lock for the accessed row, one for the row
> before the accessed row, and one for the row after the accessed row)

Which version of IDS does this refer to?

In any event, I never realised I was this lucky before. <preen> Maybe I'll
enter the Lottery this weekend.

--
Bye now,
Obnoxio

"... no bill is required as no value was provided."
-- Christine Normile

--
This message has been scanned for viruses and
dangerous content by OpenProtect(http://www.openprotect.com), and is
believed to be clean.