X-Original-To: pgsql-performance-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [200.46.204.2]) by svr1.postgresql.org (Postfix) with ESMTP id 15C70D1E60F for ; Thu, 29 Apr 2004 14:37:46 -0300 (ADT) Received: from svr1.postgresql.org ([200.46.204.71]) by localhost (neptune.hub.org [200.46.204.2]) (amavisd-new, port 10024) with ESMTP id 89915-06 for ; Thu, 29 Apr 2004 14:37:25 -0300 (ADT) Received: from tht.net (vista.tht.net [216.126.88.2]) by svr1.postgresql.org (Postfix) with ESMTP id 9C508D1E616 for ; Thu, 29 Apr 2004 14:37:24 -0300 (ADT) Received: from [134.22.68.249] (dyn-68-249.tor.dsl.tht.net [134.22.68.249]) by tht.net (Postfix) with ESMTP id C252276AF3; Thu, 29 Apr 2004 13:37:27 -0400 (EDT) Subject: Re: Simply join in PostrgeSQL takes too long From: Rod Taylor To: Manfred Koizar Cc: Vitaly Belman , Postgresql Performance In-Reply-To: References: <282909734.20040428002740@012.net.il> <1083103293.30065.100.camel@jester> <1083155014.30065.189.camel@jester> Content-Type: text/plain Message-Id: <1083260206.30065.300.camel@jester> Mime-Version: 1.0 X-Mailer: Ximian Evolution 1.4.5 Date: Thu, 29 Apr 2004 13:36:47 -0400 Content-Transfer-Encoding: 7bit X-Virus-Scanned: by amavisd-new at postgresql.org X-Spam-Status: No, hits=0.0 tagged_above=0.0 required=5.0 tests= X-Spam-Level: X-Archive-Number: 200404/495 X-Sequence-Number: 6795 On Thu, 2004-04-29 at 13:13, Manfred Koizar wrote: > On Wed, 28 Apr 2004 08:23:35 -0400, Rod Taylor wrote: > >The below plpgsql forces the kind of algorithm we wish the planner could > >choose. It should be fairly quick irregardless of dataset. > > That reminds me of hash aggregation. So here's another idea for Vitaly: The reason for the function is that the sort routines (hash aggregation included) will not stop in mid-sort, although I believe that feature is on the TODO list. I believe Vitaly will achieve 10ms or less query times using that function.