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.

How do I run pl sql in sql developer?

626

---

What is before and after trigger?

518

---

what is a trigger in mysql? : Sql dba

599

---

How do I view stored procedures?

539

---

How do you concatenate in sql?

548

---

---

Explain how exception handling is done in advance pl/sql?

550

---

What is on delete set null?

563

---

What happens when a trigger is associated to a view?

500

---

what is a composite key ? : Sql dba

596

---

What are two statement types in sql?

536

---

What is data type in sql?

554

---

What is memory optimized?

551

---

What is the difference between inner join and outer join?

526

---

Explain the steps needed to create the scheduled job?

557

---

What is trigger in sql? Explain

535

---