X-Original-To: pgsql-performance-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [200.46.204.144]) by svr1.postgresql.org (Postfix) with ESMTP id C0B0C5E46EC for ; Thu, 26 Aug 2004 19:01:58 -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 39426-01 for ; Thu, 26 Aug 2004 22:01:51 +0000 (GMT) Received: from news.hub.org (news.hub.org [200.46.204.72]) by svr1.postgresql.org (Postfix) with ESMTP id E0C3D5E46F3 for ; Thu, 26 Aug 2004 19:01:50 -0300 (ADT) Received: from news.hub.org (news.hub.org [200.46.204.72]) by news.hub.org (8.12.9/8.12.9) with ESMTP id i7QM1oLq039915 for ; Thu, 26 Aug 2004 22:01:50 GMT (envelope-from news@news.hub.org) Received: (from news@localhost) by news.hub.org (8.12.9/8.12.9/Submit) id i7QLkBNP035025 for pgsql-performance@postgresql.org; Thu, 26 Aug 2004 21:46:11 GMT From: Mischa Sandberg Reply-To: ischamay.andbergsay@activestateway.com User-Agent: Mozilla Thunderbird 0.7.3 (X11/20040803) X-Accept-Language: en-us, en MIME-Version: 1.0 X-Newsgroups: comp.databases.postgresql.performance Subject: Re: Equivalent praxis to CLUSTERED INDEX? References: <200408261818.i7QIIrr09640@candle.pha.pa.us> <1093547088.349.134.camel@vulture.corp.neopolitan.com> In-Reply-To: <1093547088.349.134.camel@vulture.corp.neopolitan.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Lines: 16 Message-ID: Date: Thu, 26 Aug 2004 21:46:13 GMT To: pgsql-performance@postgresql.org X-Virus-Scanned: by amavisd-new at hub.org X-Spam-Status: No, hits=1.1 tagged_above=0.0 required=5.0 tests=NO_DNS_FOR_FROM X-Spam-Level: * X-Archive-Number: 200408/420 X-Sequence-Number: 8056 Sheer nitpick here... A B-tree is where the records (data) live at all levels of the tree; B+ tree is where the records are only at the leaf level. That's what Knuth calls them, anyway. Clustered indexes for all known dbs are true B+ trees. Nonclustered indexes could be B-trees (probably aren't), since there's no big fanout penalty for storing the little (heap) row locators everywhere at all levels. J. Andrew Rogers wrote: > As far as I know, Oracle does it by having a B-Tree organized heap (a > feature introduced around v8 IIRC), basically making the primary key > index and the heap the same physical structure. ...