Message-ID: <3A41C7EB.8134B661@tm.ee>
Date: Thu, 21 Dec 2000 11:05:47 +0200
From: Hannu Krosing <hannu@tm.ee>
MIME-Version: 1.0
To: Tom Lane <tgl@sss.pgh.pa.us>
CC: Oleg Bartunov <oleg@sai.msu.su>, Bruce Momjian <pgman@candle.pha.pa.us>,
	PostgreSQL-development <pgsql-hackers@postgresql.org>
Subject: Re: Who is a maintainer of GiST code ?
References: <Pine.GSO.3.96.SK.1001219222315.19999H-100000@ra>
	<11222.977342421@sss.pgh.pa.us>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit

Tom Lane wrote:
> 
> Oleg Bartunov <oleg@sai.msu.su> writes:
> > seems rtree doesn't ignore NULL ?
> 
> Hm, maybe not.  There are explicit tests to ignore null inputs in hash
> indexes (hash/hash.c), and I'd just sort of assumed that rtree and gist
> do the same.
> 
> FWIW, your example doesn't seem to provoke an error in current sources;
> but it does take quite a long time (far longer than building a btree
> index on 10000 nulls).  That makes me think that indexing nulls in rtree
> might be a bad idea even if it works.

Or maybe just some optimisations done for large number of similar keys (
probabilistic page-splitting or some such ;) in btree are not done in
rtree ?

----------
Hannu