Received: from sss.pgh.pa.us (unknown [192.204.191.242]) by postgresql.org (Postfix) with ESMTP id 7854E474E4B for ; Fri, 15 Mar 2002 12:06:48 -0500 (EST) Received: from sss2.sss.pgh.pa.us (tgl@localhost [127.0.0.1]) by sss.pgh.pa.us (8.11.4/8.11.4) with ESMTP id g2FH6TS22174; Fri, 15 Mar 2002 12:06:29 -0500 (EST) To: Dmitry Tkach Cc: pgsql-sql@postgresql.org Subject: Re: Btree index extension question In-reply-to: <3C923B8B.7040705@openratings.com> References: <3C923B8B.7040705@openratings.com> Comments: In-reply-to Dmitry Tkach message dated "Fri, 15 Mar 2002 13:20:59 -0500" Date: Fri, 15 Mar 2002 12:06:29 -0500 Message-ID: <22171.1016211989@sss.pgh.pa.us> From: Tom Lane X-Archive-Number: 200203/199 X-Sequence-Number: 7079 Dmitry Tkach writes: > Does btree require a complete order defined? Yes, absolutely. I do not think that btree is a useful index type for your problem. Nor rtree (our rtree implementation can only do 2-D AFAIK). You might have better luck with GIST. In particular contrib/intarray would be worth looking at for inspiration. (You could even use it directly if you cared to change your data representation, I think.) regards, tom lane