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 many joins in sql?

0 Answers  

---

How do I kill a query in postgresql?

0 Answers  

---

Why truncate is faster than delete?

0 Answers  

---

Can a composite key be null?

0 Answers  

---

Explain the uses of a database trigger?

0 Answers  

---

i have a table t1 a math 20 b phy 30 cchemisty 10 a math 40 b phy 23 c che 21 a math15 bphy 33 c che 56 write a quire to find out the max markr of each subject

8 Answers  

---

How do I create an index in word?

0 Answers  

---

What does “select count(*) from tab” result?

15 Answers   IBM, Student, Wipro,

---

How do I make my sql query run faster?

0 Answers  

---

Explain the the delete statements in sql?

0 Answers  

---

How to delete same emp id in sql query for exmaple in emp table emp id, empname, emp address. for example emp id =5, repeated in two times in rows same id how to delete same empid please any one of the write query send in my id

8 Answers   CGCI,

---

I need a function for a train ticket reservation please answer it thanks in advance

0 Answers  

---