Why do Hash joins usually perform better than Merge Joins?
Answer Posted / narayana
In MERGE join rows to be join must be present in same AMP.. If the rows to be joined are not on the same AMP, Teradata will either redistribute the data or duplicate the data in spool to make that happen based on row hash of the columns involved in the joins WHERE Clause.Hash join takes place if one or both of the tables on each can fit completely inside the AMP's memory.AMP chooses to hold small tables in its memory for joins happening on ROW hash.
Usually optimizer will first identify a smaller table, and then sort it by the join column row hash sequence. If the smaller table is really small and can fit in the memory, the performance will be best. Otherwise, the sorted smaller table will be duplicated to all the AMPs. Then the larger table is processed one row at a time by doing a binary search against the smaller table for matched record.
Where as in MERGE join Columns to be join is Non INDEXED column. teradata will redistribute the table rows into SPOOL memory and sort them by hash code.So that matching data lies on same amp, so the join can happen on redistributed data
| Is This Answer Correct ? | 6 Yes | 0 No |
Post New Answer View All Answers
What type of indexing mechanism do we need to use for a typical data warehouse?
Highlight the need for Performance Tuning.
What is the multi-insert?
What is a three-tier data warehouse?
What is the difference between global temporary tables and volatile temporary tables?
What is meant by a Highest Cost Plan?
What is meant by a dispatcher?
How to eliminate product joins in a teradata sql query?
Highlight a few of the important components of Teradata?
List out all forms of LOCKS that are available in Teradata.
Explain and compare pros and cons of snow flake schemas?
Describe the set operators in teradata.
Explain amp in teradata?
Define views in teradata with general syntax.
What are the uses of bynets in multi-node systems?