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.

Enlist the characteristics of pl/sql?

0 Answers  

---

Practice 1: Changes to data will only be allowed on tables during normal office hours of 8.45 in the morning until 5.30 in the afternoon, MONDAY through FRIDAY. A. Create a procedure called SECURE_DML that prevents the DML statement from executing outside of normal office hours, returning the message: “you may only make changes during normal office hours” b. Create a statement trigger on the PRODUCT table which calls the above procedure. c. Test it by inserting a new record in the PRODUCT table.

1 Answers   Tech Mahindra,

---

What is oracle and pl sql?

0 Answers  

---

what is switch column,colums cost in oracle?

0 Answers   Metric Stream,

---

What are the benefits of pl sql?

0 Answers  

---

what is the difference difference between procedure and packages

2 Answers   3i Infotech, Oracle,

---

Does pl/sql support create command?

0 Answers  

---

What are expressions?

0 Answers  

---

Explain the structure of pl/sql in brief.

0 Answers  

---

What is pivot query?

0 Answers  

---

Is it mandatory for the primary key to be given a value when a new record is inserted?

0 Answers  

---

What is the difference between jpql and sql?

0 Answers  

---