Upon inspection of the SQL, I noted complex combinational WHERE clauses: The distinct values for each of these columns were less than 200, and concatenated indexes were employed.
Replacing the b-tree indexes with bitmap indexes resulted in a stunning performance improvement for the entire system, taking queries from 3 seconds down to under one-tenth of a second.
I have a Word document with a table with columns of numbers, with a cell for totals at the bottom of each column.
It would be nice if after entering the numbers in each column, Word would automatically show the total.
I do not want to have to tell the user "just insert SUM(ABOVE)".
So will this reindexing have a impact on the query performance? statement could be used to speed the search for matching rows when the field in question is part of an index.
In this example, where you have a boolean field present in 100 million rows means the selectivity of the field is so poor that a table scan will likely be required anyway.