Re: 335 times faster (!)

On Mon, Feb 03, 2003 at 18:42:31 +0100,
Mikael Carneholm <carniz(at)spray(dot)se> wrote:
> I discovered a strange thing when doing a simple search on a (comparably) large table with ~900K rows today:
>
> When searching for a specific row on the primary key (type: bigint), the search took about 6,5 seconds. The column has a default btree index as created by the primary key constraint. However, when searching for the same row on one of it's columns (type: text) which has a functional index on lower(column name), the same row was retrieved in 19ms! That's ~335 times faster!

This is probably a type coersion issue. You can probably get the first search
to run much faster by including an explicit cast to bigint.