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.

Is it possible to Restore a Dropped Table using Rollback Command in Oracle SQL Plus ?

1228

---

What is aggregate function in sql?

1040

---

What is interval partition?

1057

---

How show all rows in sql?

1014

---

How can one get sql*loader to commit only at the end of the load file? : aql loader

1059

---

Why procedure is used in sql?

1038

---

Should I use mbr or gpt?

1026

---

How do I truncate a word?

1090

---

Explain the steps needed to create the scheduled job?

1039

---

What is varchar used for?

1082

---

Where is all the data on the internet stored?

1014

---

Why do we use sql constraints? Which constraints we can use while creating database in sql?

1043

---

Is big data nosql?

950

---

Does user triggers have entry for trigger with compilation errors?

1035

---

how many values can the set function of mysql take? : Sql dba

989

---