Answer Posted / a.jyothsna

In a bitmap index, a bitmap for each key value is used
instead of a list of rowids.
Each bit in the bitmap corresponds to a possible rowid. If
the bit is set, then 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
the bitmap index provides the same functionality as a
regular index even though it uses a different
representation internally. If the number of different key
values is small, then bitmap indexes are very space
efficient. Bitmap indexing is of great benefit to data
warehousing applications.

What are the different parts of a package?

1153

---

What are functions in sql?

996

---

How do I kill a query in postgresql?

1188

---

What is difference between cursor and trigger?

1129

---

How to call shell script from pl sql procedure?

1357

---

explain the advantages and disadvantages of stored procedure? : Sql dba

1065

---

How do I run a sql script?

1229

---

List the various privileges that a user can grant to another user?

1092

---

How to handle bulk data?

1367

---

How do I partition in sql?

1023

---

what does myisamchk do? : Sql dba

1079

---

Define SQL and state the differences between SQL and other conventional programming Languages?

1265

---

What are tables and fields?

1087

---

Why do we use cursors?

1044

---

What is the example of procedure?

977

---