Skip site navigation (1) Skip section navigation (2)

minimum operators for b-tree, r-tree

From: elein <elein(at)varlena(dot)com>
To: pgsql-general(at)postgresql(dot)org
Cc: elein <elein(at)varlena(dot)com>
Subject: minimum operators for b-tree, r-tree
Date: 2004-06-30 05:03:09
Message-ID: 20040629220309.P30062@cookie.varlena.com (view raw or flat)
Thread:
Lists: pgsql-general
When creating a new data type, what are
the operators absolutely necessary for that
type to particpate in a btree index?

I know you need a "compare" that says = < or >=
so does that mean that those three operators
are the ones required?  

If you also know that answer for our implementation
of R-trees that would also be helpful.
I believe it is intersects and overlaps but
it would be nice to get confirmation.

Thanks,
elein
============================================================
elein(at)varlena(dot)com        Varlena, LLC        www.varlena.com

          PostgreSQL Consulting, Support & Training   

PostgreSQL General Bits   http://www.varlena.com/GeneralBits/
=============================================================
I have always depended on the [QA] of strangers.


Responses

pgsql-general by date

Next:From: Tom LaneDate: 2004-06-30 05:20:23
Subject: Re: FULL JOIN and mergjoinable conditions...
Previous:From: Tom LaneDate: 2004-06-30 04:19:42
Subject: Re: postgresql install: jdbc: No such file or directory.

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group