Answers were Sorted based on User's Feedback
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
|Is This Answer Correct ?||9 Yes||2 No|
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
|Is This Answer Correct ?||4 Yes||1 No|
How can you maintain the integrity of your database on instances where deleting an element in a table result in the deletion of the element(s) within another table?
table - new_no old_no 2345 1234 3456 2345 5678 4567 output sud be -new_no 1234 2345 3456 4567 5678
What are different types of sql commands?
What is an index in sql with example?
Can you have multiple SPs with the same name on a database?
What is the difference between cross join and natural join?
what is self join and why is it required? : Sql dba
What is sql key?
What is an index? What are the types of indexes? How many clustered indexes can be created on a table?
what is “go” in t-sql? : Transact sql
what are different types of keys in sql?
what are the differences between public, private, protected, static, transient, final and volatile? : Sql dba