15.00 - Minimizing Hash Collisions - Teradata Database

Teradata Database Design

prodname
Teradata Database
vrm_release
15.00
category
User Guide
featnum
B035-1094-015K

Minimizing Hash Collisions

To minimize this problem, Teradata Database defines 4.2 billion hash values. The AMP software adds a system‑generated 32‑bit uniqueness value to the rowhash value. The resulting 64‑bit value prefixed with an internal partition number is called the rowID, and this value uniquely identifies each row in a system, making a scan to retrieve a particular row among several having the same rowhash a trivial task. A scan must check each of the rows to determine if it has the searched for value and not another value that has the same rowhash value.

The following graphics illustrate the structure of a Teradata Database rowID for a PPI table on systems defined to have 65,536 hash buckets and 1,048,576 hash buckets, respectively.

If the rowID were for an nonpartitioned table, the internal partition number is 0 and is compressed in the rowID in the row header of the row and in a referencing rowID in a secondary index. For a table with 2-byte partitioning, the internal partitioning is compressed to two bytes.