Re: Block B-Tree concept

Tom Lane wrote:
> Heikki Linnakangas <heikki(at)enterprisedb(dot)com> writes:
>
>> I'm not very interested in the case where you have a lot of equal keys,
>> I think the bitmap index am is more suitable for that.
>>
>
> that indeed you meant to write "consecutive", and I've got a problem
> with that: define "consecutive". In a datatype independent fashion,
> please. I also wonder how you are going to implement splitting and
> merging of runs, which will certainly be necessary if this isn't to be
> a constantly-requires-REINDEX thing.
>

I don't mean consecutive as in "1, 2, 3, 4, ... without gaps" but as in
"A and B are consecutive in the index, if there's no value X in the
index so that A < X < B". Maybe there's a better word for that.

--
Heikki Linnakangas
EnterpriseDB http://www.enterprisedb.com