Ron Johnson <[EMAIL PROTECTED]> writes:
> How about (if you don't already do it) ranked (or approximately
> ranked) b-tree indexes, where each node also stores the (approximate)
> count of tuple pointers under it?
> This way, the planner would know whether or how skewed a tree is,
> and (approxima
On Sun, 2003-08-31 at 18:12, Tom Lane wrote:
> Rob Nagler <[EMAIL PROTECTED]> writes:
> > Are there plans for explicit hints to the planner?
>
> Personally, I'm philosophically opposed to planner hints; see previous
> discussions in the archives.
How about (if you don't already do it) ranked (or
On Mon, 01-09-2003 at 13:42, Rhaoni Chiu Pereira wrote:
> I've done that but it didn't make much difference.
> Do you know some documentation on explain ? I don't understand the results..
>
http://developer.postgresql.org/docs/postgres/sql-explain.html
http://developer.postgresql.org/docs/postgr
