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 sequence in sql?

0 Answers  

---

Can we insert data in view?

0 Answers  

---

Explain how you can copy a file to file content and file to pl/sql table in advance pl/sql?

0 Answers  

---

Describe different types of general function used in sql?

0 Answers  

---

What is faster join or subquery?

0 Answers  

---

---

What is sql clause?

0 Answers  

---

explain the delete statements in sql

0 Answers  

---

Why you are not able to create a table using select command,if it is having a LONG column? for eg:create table test as select * from test1 here test1 containg a column having LONG datatype...

1 Answers  

---

What can I use instead of union in sql?

0 Answers  

---

Which is faster subquery or join?

0 Answers  

---

What is right join sql?

0 Answers  

---

Can we join same table in sql?

0 Answers  

---