Answer Posted / mrityunjay singh

Fully indexing a large table with a traditional B-tree index can be prohibitively expensive in terms of disk space because the indexes can be several times larger than the data in the table. Bitmap indexes are typically only a fraction of the size of the indexed data in the table.

An index provides pointers to the rows in a table that contain a given key value. A regular index stores a list of rowids for each key corresponding to the rows with that key value. In a bitmap index, a bitmap for each key value replaces a list of rowids.

Each bit in the bitmap corresponds to a possible rowid, and if the bit is set, it means that the row with the corresponding rowid contains the key value. A mapping function converts the bit position to an actual rowid, so that the bitmap index provides the same functionality as a regular index. Bitmap indexes store the bitmaps in a compressed way. If the number of distinct key values is small, bitmap indexes compress better and the space saving benefit compared to a B-tree index becomes even better.

What is embedded sql with example?

1099

---

What is materialized view in sql?

959

---

what is 'mysqlimport'? : Sql dba

1115

---

What are all the different normalizations?

1078

---

What is join view in sql?

989

---

What is sql profiling in oracle?

1133

---

How many types of cursors supported in pl/sql?

1260

---

what are all types of user defined functions? : Sql dba

1089

---

what is 'mysqlshow'? : Sql dba

1076

---

What does pragma mean?

1133

---

what are the security recommendations while using mysql? : Sql dba

1181

---

What is the usage of nvl function?

1103

---

What are the two different parts of the pl/sql packages?

1141

---

What is application trigger?

1056

---

What is the difference between sql and mysql?

1181

---