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 a ddl command?

1151

---

Is it possible to update views?

1005

---

what are different types of collation sensitivity? : Sql dba

1114

---

What are stuff and replace function?

1141

---

What does count (*) mean in sql?

1651

---

how to convert character strings to dates? : Sql dba

1094

---

How many types of cursors supported in pl/sql?

1252

---

Is grant a ddl statement?

939

---

Can we use update in sql function?

1112

---

How do you rank data in sql?

1065

---

Explain the select statement in sql?

1177

---

What is the purpose of cursors in pl/sql?

1200

---

How can we make an if statement within a select statement?

1061

---

How does sql*loader handles newline characters in a record? : aql loader

1089

---

What is pl sql in oracle?

1092

---