What is a bitmap index?
Answer Posted / rahul roshan
Bitmap indexes have traditionally been considered to work well for data such as Boolean values, which have a modest number of distinct values – in this case, boolean True and False - but many occurrences of those values. This would happen if, for example, you had data on whether or not each resident in a city has internet access. Bitmap indexes use bit arrays (commonly called bitmaps) and answer queries by performing bitwise logical operations on these bitmaps. Bitmap indexes have a significant space and performance advantage over other structures for query of such data. Their drawback is they are less efficient than the traditional B-tree indexes for columns whose data is frequently updated: consequently, they are more often employed in read-only systems that are specialized for fast query - e.g., data warehouses, and generally unsuitable for online transaction processing applications. However, this drawback appears to apply only to their implementation in relational database management systems: certain non-relational DBMSs, notably Intersystems Cache, a hierarchical database, use bitmap indexes for low-cardinality columns in transactional systems.
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
Define commit, rollback and savepoint?
How to write a query to show the details of a student from students table whose
Explain what is a view?
What does sql stand for?
what are string data types? : Sql dba
Does mysql_real_escape_string prevent sql injection?
How is pl sql different from sql?
How can you tell the difference between an index and a view?
What is prepared statement in sql?
how can you see all indexes defined for a table? : Sql dba
What is sql clause?
Does inner join return duplicate rows?
What is insert command in sql?
What is a loop in sql?
What is crud stand for?