 |
 |
Archives of the TeradataForum
Message Posted: Thu, 27 Feb 2003 @ 10:13:56 GMT
| Subj: | | Re: Comparison of order by hash and values indexes |
| |
| From: | | Narayan Murthy K S |
The difference b/w the two is the way the index subtable are ordered - one is ordered by the value of the column you specify (for VALUE
ordering) thereby making it efficient when it comes to range evaluation, and the other the ordering is by the hash value, which makes it
efficient for equality condition checks.
For further reading on when to use what - refer to "Teradata Database Design" which talks about the all the design consideration, which
includes the indexes too.
Narayan Murthy K S
| |
