Answer / avi007

Hash joins do not use indexes and perform full-table scans
often using parallel query. Hence, the use of hash joins
with parallel full-table scans tend to drive-up CPU
consumption.

Answer / ankush

A hash join is a join optimization method where two tables
are joined based on a hashing algorithm.

Hashing refers to the conversion of a column's primary key
value to a database page number on which the row will be
stored. Retrieval operations that specify the key column
value use the same hashing algorithm and can locate the row
directly. Hashing provides fast retrieval for data that
contains a unique key value.

Note that a hash value cannot be converted back to the
original value.

Explian rowid, rownum?

0 Answers  

---

How can you load microsoft excel data into oracle? : aql loader

0 Answers  

---

How we can create a table in pl/sql block. Insert records into it? Is it possible by some procedure or function? Please give example?

0 Answers  

---

there are 2 variables called x and y ,x contains 1,2 and y contains 3,4 we have to swap the values from x to y and y to x with out using dummy variables and it can be done only by using a single statement ? how?

12 Answers   Oracle,

---

What version is sql?

0 Answers  

---

I have a procedure in a procedure. The inner procedure contains out parameter. How I can call the inner procedure in the out procedure and send the inner procedure parameter value(out parameter value) into out procedure?

2 Answers  

---

Why plvtab is considered as the easiest way to access the pl/sql table?

0 Answers  

---

Explain select statements in sql?

0 Answers  

---

What is a table?

0 Answers  

---

Is it possible to access the current value in a session before accessing next value?

1 Answers  

---

If i can use sys.check_constraints to display my constraints from my database using sql server 2005, how can i display then if i am using sql server 2000????

0 Answers  

---

what is a constraint? : Sql dba

0 Answers  

---