Received: from qi.com (qi.com [207.87.0.83]) by hub.org (8.8.8/8.8.8) with ESMTP id OAA04783 for ; Wed, 16 Sep 1998 14:21:08 -0400 (EDT) (envelope-from pgiagnoc@qi.com) Received: from gatekeeper.qi.com ([12.15.236.2]) by qi.com (8.8.4/8.7.3) with SMTP id OAA24204; Wed, 16 Sep 1998 14:21:07 -0400 (EDT) Message-ID: <36000133.41FC0EC5@qi.com> Received: from [192.168.1.47] by gatekeeper.qi.com via smtpd (for qi.com [207.87.0.83]) with SMTP; 16 Sep 1998 18:19:29 UT Date: Wed, 16 Sep 1998 14:19:31 -0400 From: Patrick Giagnocavo Organization: Quadrant International X-Mailer: Mozilla 4.06 [en] (Win98; I) MIME-Version: 1.0 To: pgsql-sql@postgresql.org Subject: rtree, btree, hash index methods...should I care? Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Hi Folks, First let me just say that I am very positive about Postgres. I am using it in conjunction with the AOLserver web server and am really glad that it is so stable. It stays up for weeks at a time. I have never had a crash or any data corruption. Actual question: Do I need to care about rtree/btree/hash methods? Is there a performance difference in "normal" operations? What about when using 3 or 4 JOINs together? Obviously the hash index is only useful for equals; and btree does seem useful. How much more of a "cost" is there in terms of inserts and updates if I make 2 indexes (one btree, one rtree) on the same table? ./patrick