On Tue, 2011-12-20 at 13:22 +0400, Alexander Korotkov wrote:
> Hi!
>
>
> Studying this question little more I found that current approach of
> range indexing can be dramatically inefficient in some cases. It's not
> because of penalty or split implementation, but because of approach
> itself. Mapping intervals to two-dimensional space produce much better
> results in case of high-overlapping ranges and "@>", "<@" operators
> with low selectivity.
>
Thank you for testing this. I agree that your approach is much better
especially dealing with widely varying range sizes, etc. My approach
really only tackled the simple (and hopefully common) case when the
ranges are about the same size.
Regards,Jeff Davis
