X-Original-To: pgsql-general-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [200.46.204.144]) by svr1.postgresql.org (Postfix) with ESMTP id B43C354469 for ; Tue, 10 May 2005 15:07:09 -0300 (ADT) Received: from svr1.postgresql.org ([200.46.204.71]) by localhost (av.hub.org [200.46.204.144]) (amavisd-new, port 10024) with ESMTP id 30677-04 for ; Tue, 10 May 2005 18:07:06 +0000 (GMT) Received: from sss.pgh.pa.us (sss.pgh.pa.us [66.207.139.130]) by svr1.postgresql.org (Postfix) with ESMTP id 4B8D0542BE for ; Tue, 10 May 2005 15:07:04 -0300 (ADT) Received: from sss2.sss.pgh.pa.us (tgl@localhost [127.0.0.1]) by sss.pgh.pa.us (8.13.1/8.13.1) with ESMTP id j4AI70Ep020885; Tue, 10 May 2005 14:07:00 -0400 (EDT) To: "Jim C. Nasby" Cc: Neil Conway , Christopher Petrilli , Ying Lu , pgsql-general@postgresql.org, pgsql-performance@postgresql.org Subject: Re: [PERFORM] "Hash index" vs. "b-tree index" (PostgreSQL In-reply-to: <20050510153245.GA31103@decibel.org> References: <427F6853.90308@cs.concordia.ca> <427F757A.8000407@samurai.com> <59d991c405050908271b55e673@mail.gmail.com> <427F8321.5030702@samurai.com> <20050509163423.GH35026@decibel.org> <427F9211.2090008@samurai.com> <20050509165133.GJ35026@decibel.org> <427FFCD3.1010803@samurai.com> <20050510153245.GA31103@decibel.org> Comments: In-reply-to "Jim C. Nasby" message dated "Tue, 10 May 2005 10:32:45 -0500" Date: Tue, 10 May 2005 14:07:00 -0400 Message-ID: <20884.1115748420@sss.pgh.pa.us> From: Tom Lane X-Virus-Scanned: by amavisd-new at hub.org X-Spam-Status: No, hits=0.007 tagged_above=0 required=5 tests=AWL X-Spam-Level: X-Archive-Number: 200505/498 X-Sequence-Number: 77846 "Jim C. Nasby" writes: > Well, in a hash-join right now you normally end up feeding at least one > side of the join with a seqscan. Wouldn't it speed things up > considerably if you could look up hashes in the hash index instead? That's called a "nestloop with inner index scan", not a hash join. regards, tom lane