- How is the b-tree index stored internally?
- If a query is submitted, how is the query result loaded in memory? Is it block-oriented or column-oriented?
Oracle also has bitmap join indexes:
In general, you will want a bitmap index when:
- Table column is low cardinality -- As a rough guide, consider a bitmap for any index with less than 100 distinct values.
select region, count(*) from sales group by region;
- The table has low DML -- You must have low insert./update/delete activity. Updating bitmapped indexes takes a lot of resources, and bitmapped indexes are best for largely read-only tables and tables that are batch updated nightly.
- Multiple columns -- Your SQL queries reference multiple, low-cardinality values in their where clause. Oracle cost-based SQL optimizer (CBO) will scream when you have bitmap indexes on.
Dig Deeper on Oracle database design and architecture
Related Q&A from Don Burleson
I have created a table, Party, and in it there are two main fields, party_code and party_name, and around 2,500 records are available in it. I passed... Continue Reading
Suppose you have a table which has only two columns, namely locid (not primary) and place. In Oracle, which query should I run to get the output as ... Continue Reading
I have a query that retrieves around 10 records. I have a task to concatenate the values separated with ','. I would like to know if Oracle has any ... Continue Reading
Have a question for an expert?
Please add a title for your question
Get answers from a TechTarget expert on whatever's puzzling you.