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

Re: Performance on inserts

From: Thomas Lockhart <lockhart(at)alumni(dot)caltech(dot)edu>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: Jules Bean <jules(at)jellybean(dot)co(dot)uk>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Performance on inserts
Date: 2000-08-26 07:27:28
Message-ID: 39A77160.FB43FC8F@alumni.caltech.edu (view raw or flat)
Thread:
Lists: pgsql-hackers
> I have no good way to guess how much bit-rot has occurred in all that
> unexercised code ... but it'd be interesting to try to get it going
> again.

Yes, it is a *great* feature, since it directly addresses the problems
associates with one of the most common non-random data distributions
(the index can be constructed to completely ignore those most common
values, and hence be smaller, less often updated, and holding only those
values which might actually be used in an index scan). If we don't get
to outer joins, this would be a good second choice for 7.1 ;)

                     - Thomas

In response to

pgsql-hackers by date

Next:From: Mario WeilguniDate: 2000-08-26 09:08:10
Subject: TNS Services like Oracle?
Previous:From: Hannu KrosingDate: 2000-08-26 07:26:26
Subject: Re: Performance on inserts

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