| From: | Simon Riggs <simon(at)2ndquadrant(dot)com> |
|---|---|
| To: | David Scott <davids(at)apptechsys(dot)com> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: No heap lookups on index |
| Date: | 2006-01-18 21:52:04 |
| Message-ID: | 1137621124.3069.60.camel@localhost.localdomain |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general 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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | vishal saberwal | 2006-01-18 21:56:47 | Rollback to Previous Version |
| Previous Message | Assad Jarrahian | 2006-01-18 21:26:28 | Updating rows (automatically) that are selected |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2006-01-18 22:27:29 | Re: Unique constraints for non-btree indexes |
| Previous Message | Martijn van Oosterhout | 2006-01-18 21:47:23 | Re: Unique constraints for non-btree indexes |