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 can the performance of a trigger be improved?

0 Answers  

---

What will be the output of this Query? select to_char(trunc(add_months(sysdate-3),mm),mm/dd/yyyy) from dual

6 Answers   Cap Gemini, TCS,

---

how to create object in plsql

2 Answers   TCS,

---

Which data dictionary views have the information on the triggers that are available in the database?

0 Answers  

---

What is the reports view in oracle sql developer?

0 Answers  

---

what is called after appearing where clause

3 Answers  

---

What is Overloading of procedures ?

2 Answers  

---

How can we find duplicate records in a table?

0 Answers  

---

What does where 1/2 mean in sql?

0 Answers  

---

if a string is there like s1,s2,s3,s4.How to find count of commas in this.

4 Answers  

---

1 SELECT a.field1, b.field2, c.field3, d.field4 2 FROM atable a, atable b, ctable c, dtable d 3 ? 4 ORDER BY 1 What is the minimum number of joins that must be specified on line 3 in the sample code above to properly link the tables? Notice that the table "atable" is aliased twice: once as "a" and once as "b." 1. One join 2. Two joins 3. Three joins 4. Four joins 5. Five joins

6 Answers   Sonata,

---

How to use transactions efficiently : transact sql

0 Answers  

---