What is a bitmap index?
- 4 Answers
- 22910 Views
- Choice Solutions, Infosys, I also Faced
- E-Mail Answers
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
What is rank dense_rank and partition in sql?
what is meant by urlencode and urldocode? : Sql dba
Which is faster union or join?
what are the differences between binary and varbinary? : Sql dba
What is the current version of postgresql?
Is there a 64 bit version of ssms?
Why use stored procedures?
What is sql lookup?
what are wild cards used in database for pattern matching ? : Sql dba
Is null operator in sql?
How many types of triggers are there in pl sql?
What is type and rowtype in pl sql?
Why commit is not used in triggers?
What do you mean by rowid?
Show how functions and procedures are called in a pl/sql block.
