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.

what are the properties and different types of sub-queries? : Sql dba

1034

---

differentiate between float and double. : Sql dba

1060

---

What is the difference between sum and count in sql?

986

---

What is the difference between join and natural join?

927

---

what are the different index configurations a table can have? : Sql dba

997

---

Do ddl statements need commit?

973

---

What are the main features of cursor?

1071

---

Can we use rowid as primary key?

989

---

What is delimiter in pl sql?

1062

---

What is before and after trigger?

959

---

What are the subsets of sql?

1134

---

What is the example of procedure?

928

---

what is subquery? : Sql dba

1135

---

What is data definition language?

1093

---

What is %type in sql?

968

---