Re: Performance on inserts

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us>
Cc: Jules Bean <jules(at)jellybean(dot)co(dot)uk>, Alfred Perlstein <bright(at)wintelcom(dot)net>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Performance on inserts
Date: 2000-10-15 22:30:54
Message-ID: 5905.971649054@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us> writes:
> What I am more concerned about is a join that uses the most common
> value. We do an index scan in that case.

No, we do whichever plan looks cheapest. Again, it's all about
statistics.

Right now, eqjoinsel() is just a stub that returns a constant
selectivity estimate. It might be useful to compute some more
sophisticated value based on pg_statistic entries for the two
columns, but right now I doubt you could tell much. Should keep
the join case in mind when we extend the statistics...

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Franck Martin 2000-10-15 23:09:15 RE: Performance on inserts
Previous Message Bruce Momjian 2000-10-15 22:22:28 Re: Performance on inserts