X-Original-To: pgsql-performance-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [64.117.224.130]) by svr1.postgresql.org (Postfix) with ESMTP id BDE4AD1B4F0 for ; Mon, 1 Sep 2003 21:03:28 +0000 (GMT) Received: from svr1.postgresql.org ([64.117.224.193]) by localhost (neptune.hub.org [64.117.224.130]) (amavisd-new, port 10024) with ESMTP id 78004-05 for ; Mon, 1 Sep 2003 18:03:20 -0300 (ADT) Received: from sss.pgh.pa.us (unknown [192.204.191.242]) by svr1.postgresql.org (Postfix) with ESMTP id 9FCB4D1B8B2 for ; Mon, 1 Sep 2003 18:03:17 -0300 (ADT) Received: from sss2.sss.pgh.pa.us (tgl@localhost [127.0.0.1]) by sss.pgh.pa.us (8.12.9/8.12.9) with ESMTP id h81L3IjX010676; Mon, 1 Sep 2003 17:03:18 -0400 (EDT) To: Ron Johnson Cc: PgSQL Performance ML Subject: Re: How to force Nested Loop plan? In-reply-to: <1062429767.7340.92.camel@haggis> References: <16208.41885.960000.12706@gargle.gargle.HOWL> <24637.1062255721@sss.pgh.pa.us> <16208.50934.351000.90704@gargle.gargle.HOWL> <2074.1062260382@sss.pgh.pa.us> <16209.3105.94000.204936@gargle.gargle.HOWL> <4040.1062281441@sss.pgh.pa.us> <16209.15488.141000.729032@gargle.gargle.HOWL> <29706.1062371570@sss.pgh.pa.us> <1062429767.7340.92.camel@haggis> Comments: In-reply-to Ron Johnson message dated "Mon, 01 Sep 2003 10:22:47 -0500" Date: Mon, 01 Sep 2003 17:03:17 -0400 Message-ID: <10675.1062450197@sss.pgh.pa.us> From: Tom Lane X-Virus-Scanned: by amavisd-new at postgresql.org X-Archive-Number: 200309/3 X-Sequence-Number: 3369 Ron Johnson writes: > How about (if you don't already do it) ranked (or approximately > ranked) b-tree indexes, where each node also stores the (approximate) > count of tuple pointers under it? > This way, the planner would know whether or how skewed a tree is, > and (approximately) how many tuples a given WHERE predicate resolves > to. Why is that better than our existing implementation of column statistics? regards, tom lane