Re: Block B-Tree concept - Mailing list pgsql-hackers

From Heikki Linnakangas
Subject Re: Block B-Tree concept
Date
Msg-id 451D33D8.30708@enterprisedb.com
Whole thread Raw
In response to Re: Block B-Tree concept  (Tom Lane <tgl@sss.pgh.pa.us>)
Responses Re: Block B-Tree concept  (Jan de Visser <jdevisser@digitalfairway.com>)
Re: Block B-Tree concept  (Tom Lane <tgl@sss.pgh.pa.us>)
List pgsql-hackers
Tom Lane wrote:
> Heikki Linnakangas <heikki@enterprisedb.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



pgsql-hackers by date:

Previous
From: Simon Riggs
Date:
Subject: Re: Block B-Tree concept
Next
From: Tom Lane
Date:
Subject: Re: Faster StrNCpy