EXPERT RESPONSE
You are correct that you can over-index this type of
application table. Unfortunately, bitmap indexes won't
necessarily help. They might, but they might not help.
So you will have to test for your sepecific
environment. Where bitmap indexes may help the most
would be in the fact that multiple column's indexes
can be used to satisfy the query. Bitmap indexes
cooperate with each other this way, where the standard
B-tree index does not.
Another thing to consider is to cache the entire table
in memory so that indexes don't need to be used. This
isn't exactly a small table, but 500K rows isn't
terribly large either. The KEEP buffer pool can be
used to store the table so that it doesn't get aged
out of the cache. This might be a solution for your
case.
For More Information
|
