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 01:36:57
Message-ID: 39A71F39.6931B3B@alumni.caltech.edu (view raw or flat)
Thread:
Lists: pgsql-hackers
> Comments?  Is there a better way?  What's the best probability to use?

For this particular example, "partial indices" seems to be the best fit.
The index can be chosen to omit the most common value(s), since those
would indicate a sequential scan anyway.

Other DBs allow a parameter to set the "fill ratio" of index pages,
which might also help. But probably not as much as you might like when
one is doing a large number of inserts at a time.

Your "randomized" algorithm looks very promising. What is the status of
partial indices? Are they functional now, or have they been broken
forever (I'm not recalling)?

                 - Thomas

In response to

Responses

pgsql-hackers by date

Next:From: Tom LaneDate: 2000-08-26 01:44:36
Subject: Re: Performance on inserts
Previous:From: Tom LaneDate: 2000-08-25 23:00:22
Subject: Re: Performance on inserts

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