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.

Can we use distinct and group by together?

0 Answers  

---

what is rdbms? : Sql dba

0 Answers  

---

What is sql engine in oracle?

0 Answers  

---

Is time a data type in sql?

0 Answers  

---

write sub query for eliminating duplicate rows using analytical function?

3 Answers   Metric Stream,

---

What is primary key secondary key alternate key candidate key?

0 Answers  

---

How do I partition a table in sql?

0 Answers  

---

ERROR:Insert or update on table"accnt" violates foreign key constraints "acct_to_curr_symbol" DETAILS:KEY(accnt_curr_id)(-2)is not present in the table "curr_symbol" ......solve The Problem..

0 Answers   Wipro,

---

Is null operator in sql?

0 Answers  

---

Are subqueries better than joins?

0 Answers  

---

what is view? : Sql dba

0 Answers  

---

What are the possible values for the boolean data field?

0 Answers  

---