Amir,
The index lacks much specificity so it probably won't help very much at all. ideally an indexed column has to have a
widerange of values to be usefull.
1000000 rows with one value --> all rows are in the same "bucket"
1000000 rows with 2 values --> if evenly split, 500000 in each division; if not you might have 10 in one and 9999990 in
theother. Hence, an index on a boolean column would be of little use ...
I would suspect that in your case a query against the value with only 5 values might be fast as the planner would use
theindex. If the planner sees that it needs 5000000 rows of data its not going to use the index since that would
greatlyincrease the amount of work needed (e.g. get the index value, get the real data instead of simply getting data
insequentail reads and discarding the non-interesting data).
HTH clarify things, altho not much help in speeding your queries ...
Greg Williamson
DBA
GlobeXplorer LLC
-----Original Message-----
From: Amir Zicherman [mailto:amir.zicherman@gmail.com]
Sent: Tue 8/17/2004 4:24 PM
To: pgsql-general@postgresql.org
Cc:
Subject: [GENERAL] indexed column not working as fast as expected
hi,
i have a btree index on col1 in table1. The column has either values
1,2,3, or 4. 4 does not appear that much in the table (only 5 times).
there are about 20 million rows in the table. when i do a "select *
from table1 where col1=4" it takes very long time to get back to me
(around 4 minutes). why is it taking so long if i have an index on
it? I also tried this with a hash index and it was still slow.
thanx, amir
---------------------------(end of broadcast)---------------------------
TIP 3: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to majordomo@postgresql.org so that your
message can get through to the mailing list cleanly