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.

How to fetch values from testtable1 that are not in testtable2 without using not keyword?

0 Answers  

---

what are the type of locks ? : Sql dba

0 Answers  

---

What is rowid in sql?

0 Answers  

---

What is field delimiter?

0 Answers  

---

What is a sql schema used for?

0 Answers  

---

please explain database architecture..

1 Answers   Infosys,

---

what is a control file ? : Sql dba

0 Answers  

---

Is join an inner join?

0 Answers  

---

how will i became good database developer?

1 Answers  

---

How to write html code in pl sql?

0 Answers  

---

How is a process of pl/sql compiled?

0 Answers  

---

How you improve the performance of sql*loader? : aql loader

0 Answers  

---