i have a question here... As of my knowledge, when we apply an index (b-tree)on a column, internally it arranges the data in b-tree format and do the fetching process correspondingly... and my quetion is... How a bit-map index arranges the data internally when applied on a column?IS it in b-tree format or whatelse?

0 Answers   Oracle,

---

I have table-A(1,2,3,4,4,5,6,6,6,7). how to get all duplicate values?what is sql query?

5 Answers   Zensar,

---

Who i will insert 1 lacks record in a Database table

4 Answers   TCS,

---

How to get a list of all background sessions in the database?

0 Answers  

---

What are the Referential actions supported by FOREIGN KEY integrity constraint ?

1 Answers  

---

What happens if variable names collide with table/column names?

0 Answers  

---

What are main difference between Stored Procedure and Functions.

6 Answers   CA, Metric Stream,

---

When system tablespace is created?

0 Answers  

---

When do I need to use a semicolon vs a slash in oracle sql?

0 Answers  

---

What are various constraints used in SQL?

1 Answers   Polaris,

---

How to create a single index for multiple columns?

0 Answers  

---

What is a package ? What are the advantages of package ?

0 Answers  

---