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 is the use of & in pl sql?

1003

---

What is basic structure of pl sql?

1010

---

What is sql dialect?

1050

---

what is index? : Sql dba

956

---

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

969

---

What is the primary use of normalization?

956

---

Can we connect to postgresql using sql developer?

957

---

What is a temporal table?

900

---

what is timestamp in mysql? : Sql dba

1024

---

What are different types of sql?

1124

---

What type of join is sql join?

931

---

What is offset in sql query?

1085

---

Is hadoop a nosql?

957

---

Can we use two order by clause in query?

931

---

How to execute a stored procedure?

1048

---