Thanks Tom!
I just tried a query for cooktimes over 1 million to test your theory,
as it would almost instantly be able to tell from the index that there
are zero rows matching that condition. Indeed, it hits the index
which is what I would expect, and the total runtime is 0.163ms.
Thank
Mike Christensen <[EMAIL PROTECTED]> writes:
> As you can see the index is not being used and it's doing a seq scan
> on the table directly. I would think if Postgres is indeed keeping a
> btree index on the column, meaning the values would be stored in
> numerical order, the index would be
On Wed, Oct 1, 2008 at 1:57 PM, Mike Christensen <[EMAIL PROTECTED]> wrote:
> Hi guys, I'm very new to PostgreSQL so please excuse me if this is an easy
> question..
>
> I have a table called Recipes which has a column called CookTime. I have
> an index on the CookTime column as such:
>
> CREATE
Hi guys, I'm very new to PostgreSQL so please excuse me if this is an
easy question..
I have a table called Recipes which has a column called CookTime. I
have an index on the CookTime column as such:
CREATE INDEX idx_recipes_cooktime
ON recipes
USING btree
(cooktime);
If I run the f
