Re: No heap lookups on index - Mailing list pgsql-hackers

From Simon Riggs
Subject Re: No heap lookups on index
Date
Msg-id 1137621124.3069.60.camel@localhost.localdomain
Whole thread Raw
In response to No heap lookups on index  (David Scott <davids@apptechsys.com>)
Responses Re: No heap lookups on index  (Tom Lane <tgl@sss.pgh.pa.us>)
List pgsql-hackers
On Wed, 2006-01-18 at 12:14 -0800, David Scott wrote:
> Is the additional overhead of keeping full tuple visibility 
> information inside of the index so odious to the Postgres community
> as 
> to prevent a patch with this solution from being applied back to the 
> head?  Maybe as an optional use feature?

You might want to consider the thought of "organised heaps" as an
alternative thought to index improvements. That way there is no heap to
avoid visiting because the index is also the main data structure.

Teradata provides hash or value-ordered tables
Oracle offers index organised tables
DB2 offers multi-dimensional clustering
Tandem offered value ordered tables

This would offer performance, but would be one of the largest patches
seen in recent times. You may find some co-backers.

Best Regards, Simon Riggs




pgsql-hackers by date:

Previous
From: Martijn van Oosterhout
Date:
Subject: Re: Unique constraints for non-btree indexes
Next
From: Tom Lane
Date:
Subject: Re: Unique constraints for non-btree indexes