Answer Posted / 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.
| Is This Answer Correct ? | 9 Yes | 2 No |
Post New Answer View All Answers
Can we use ddl statements in stored procedure sql server?
What is difference between joins and union?
How show all rows in sql?
Why is sql*loader direct path so fast?
how to fetch alternate records from a table? : Sql dba
What is left inner join in sql?
how to check server status with 'mysqladmin'? : Sql dba
GLOBAL TEMPORARY TABLE over Views in advantages insolving mutating error?
How many types of tables are there?
What is the difference between a primary key and a clustered index?
How to execute a stored procedure?
What is pl sql in dbms?
Why do we create views in sql?
Do we need to create index on primary key?
What is a nested table in word?