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.

What is a schema sql?

0 Answers  

---

what is the difference between granting and creating a view?

2 Answers  

---

How to set up sql*plus output format in oracle?

0 Answers  

---

What is nvl?

0 Answers  

---

is it mandatory to select all the column in a view then what columns should be selected

2 Answers  

---

What is an emotional trigger?

0 Answers  

---

What is numeric function sql?

0 Answers  

---

What is java sql drivermanager?

0 Answers  

---

what are pl/sql collections?

4 Answers   JPMorgan Chase, Oracle,

---

How to prepare for oracle pl sql certification?

0 Answers  

---

Why do we use subquery?

0 Answers  

---

What is Difference Between Unique and Primary Key Constraints?

0 Answers   Wipro,

---