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 transaction and its controls?

1040

---

Which column of the user triggers data dictionary view displays the database event that will fire the trigger?

1025

---

How do I view an execution plan in sql?

986

---

Is sql low level language?

1021

---

When can we use the where clause and the having clause?

1020

---

What is the difference between between and in condition operators?

1005

---

What is sql*loader?

1192

---

what is a foreign key ? : Sql dba

1084

---

Which kind of parameters cannot have a default value in pl sql?

1149

---

Table 1: col1 Timestamp ---------------- 01-mar-2012 11:12:46 Table 2: col2 Timestamp -------------------- 01-mar-2012 11:12:10 01-mar-2012 11:11:23 Write a query to display a row with table2 col2 value less than tabl1 col1 value. Maximum timestamp value previous to table1 col1 value. Display a result as: Col1 col2 ----- ----- 01-mar-2012 11:12:46 01-mar-2012 11:12:10

2113

---

What is union and union all keyword in sql and what are their differences?

1108

---

Is there a 64 bit version of ssms?

961

---

How do I delete a trigger?

967

---

What are all the common sql functions?

1031

---

What are the most important ddl statements in sql?

1116

---