Skip site navigation (1) Skip section navigation (2)

Re: pgsql is 75 times faster with my new index scan

From: devik(at)cdi(dot)cz
To: "Mikheev, Vadim" <vmikheev(at)SECTORBASE(dot)COM>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: pgsql is 75 times faster with my new index scan
Date: 2000-09-27 08:12:10
Message-ID: (view raw, whole thread or download thread mbox)
Lists: pgsql-hackers
> Why not implement *true* CLUSTER?
> With cluster, all heap tuples will be in cluster index.

It would be nice. It's pity that pg AMs are not general.
There is no simple way to use btree instead of heap. But
it would help.
But using values from index is good idea too because you
can have table with many columns and aggregate query which
needs only two columns.
The it will be MUCH faster to create secondary index which
is much smaller than heap and use values from it.

Vadim where can I found some code from upcoming WAL ?
I'm thinking about implementing special ranked b-tree
which will store precomputed aggregate values (like
cnt,min,max,sum) in btree node keys. It can be then
used for extremely fast evaluation of aggregates. But
in case of MVCC it is more complicated and I'd like
to see how it would be affected by WAL.


In response to

pgsql-hackers by date

Next:From: Louis-David MitterrandDate: 2000-09-27 08:13:15
Subject: Re: function crashes backend
Previous:From: Magnus HaganderDate: 2000-09-27 07:31:00
Subject: RE: libpq static link library dowsn't work (M$ VS6)

Privacy Policy | About PostgreSQL
Copyright © 1996-2017 The PostgreSQL Global Development Group