Re: Query Hints? No thanks. Data hints?

From: Peter Eisentraut <peter_e(at)gmx(dot)net>
To: pgsql-hackers(at)postgresql(dot)org, Martijn van Oosterhout <kleptog(at)svana(dot)org>
Cc: Dimitri Fontaine <dim(at)hi-media(dot)com>
Subject: Re: Query Hints? No thanks. Data hints?
Date: 2008-05-06 12:44:52
Message-ID: 200805061444.53225.peter_e@gmx.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Am Dienstag, 6. Mai 2008 schrieb Martijn van Oosterhout:
> Cross-table correlations are easy for the second part, because it's
> fairly simple to see where it could be used. However, no-one has come
> up with an algorithm to produce a useful number to use. For others it's
> harder.

For an algorithm, principal components analysis would be my guess. It is
designed to answer the question "this column value is tied to this other
column value in this way" [quote Simon], at least for the sort of data that a
B-tree would cover. For nonlinear data, it is of course harder.

> In general postgres could use many bits of information not currently
> available. For example: A=B implies lower(A)=lower(B), hence an index
> on lower(A) could be used to optimise comparisons against A. Certain
> operations preserve order, which may also be useful.

Locale horrors looming ... ;-)

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Gregory Stark 2008-05-06 12:55:22 Re: Proposed patch - psql wraps at window width
Previous Message Martijn van Oosterhout 2008-05-06 11:00:13 Re: Query Hints? No thanks. Data hints?