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,

---

ex. one table is having 1 column with 10 records , then how to display all the values in row wise ?

4 Answers  

---

what is the difference between functional dependecy and multilevel dependency?

0 Answers   Oracle,

---

Name the three major set of files on disk that compose a database in Oracle?

0 Answers  

---

How you open and close a cursor variable.Why it is required?

2 Answers  

---

What are group functions in oracle?

0 Answers  

---

Oracle

0 Answers   ABC, Genpact, HUI, Oracle,

---

What is a partition in oracle?

0 Answers  

---

The table has 3 columns 4 rows. The output is which column has least null values( A COL SHOULD BE THE OUTPUT) Write the query plz. A B C ================ 1 NULL 2 NULL 3 4 NULL 5 6 7 NULL NULL O/P C = 2 4 6

2 Answers   TCS,

---

Using the relations and the rules set out in the notes under each relation, write statements to create the two sequence generators specified in the notes.

0 Answers   Wipro,

---

how to find find & delete duplicate rows from two different tables?

3 Answers   Accenture, TCS,

---

What is a cursor in oracle?

0 Answers  

---