Re: Remove hacks for old bad qsort() implementations?

From: "Zeugswetter Andreas OSB SD" <Andreas(dot)Zeugswetter(at)s-itsolutions(dot)at>
To: "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us>, <pgsql-hackers(at)postgreSQL(dot)org>
Subject: Re: Remove hacks for old bad qsort() implementations?
Date: 2008-03-17 10:55:58
Message-ID: E1539E0ED7043848906A8FF995BDA57902DD360B@m0143.s-mxs.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


> 2. If you've got lots of equal keys, it's conceivable that having the
> index entries sorted by TID offers some advantage in indexscan speed.
> I'm dubious that that's useful, mainly because the planner should
prefer
> a bitmap scan in such a case; and anyway the ordering is unlikely to
> be preserved for long. But it's something to think about.

How about always adding the TID as last key when using qsort for create
index ?

Andreas

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Mike Aubury 2008-03-17 11:26:59 Request for feature - ECPGget_PGconn
Previous Message Hannu Krosing 2008-03-17 10:28:45 Re: Rewriting Free Space Map