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 behavioral trigger?

972

---

Why is partition used in sql?

1123

---

Where is all the data on the internet stored?

1009

---

How to use distinct and count in sql query? Explain

1015

---

What is sql and its types?

1181

---

What is scalar data type in pl sql?

1066

---

Can you load data into multiple tables at once? : aql loader

1066

---

What do you mean by “trigger” in sql?

1075

---

what is subquery? : Sql dba

1132

---

What is having clause in sql?

963

---

What are properties of the transaction?

998

---

Write a sql query to convert all character to uppercase after hypen.

1436

---

what are the join types in tsql? : Transact sql

1064

---

How long does it take to learn pl sql?

1059

---

Which one is faster ienumerable or iqueryable?

930

---