[SQL] several questions about R-tree index

2005-04-26 Thread TJ O'Donnell
According to the manual at: http://www.postgresql.org/docs/7.4/static/functions-geometry.html The PostgreSQL query planner will consider using an R-tree index whenever an indexed column is involved in a comparison using one of these operators: , , , , @, ~=, (Refer to Section 9.9 about the

Re: [SQL] several questions about R-tree index

2005-04-26 Thread Andrew - Supernews
On 2005-04-26, TJ O'Donnell [EMAIL PROTECTED] wrote: But I think I might be able to do better (faster) using R-trees. Bitstrings can be thought of as containing when one bitstring has all the same bits set as another, even if it has other bits set too - this is the gist of the first

Re: [SQL] several questions about R-tree index

2005-04-26 Thread Tom Lane
TJ O'Donnell [EMAIL PROTECTED] writes: Shouldn't the ~ (contains) operator be included also? Isn't ~ the commutator of @ ? Yeah, it looks like the documentation is in error: regression=# select amopopr::regoperator,amopstrategy from pg_amop where amopclaid in regression-# (select oid from