{"id":1689,"date":"2018-08-14T11:44:30","date_gmt":"2018-08-14T11:44:30","guid":{"rendered":"http:\/\/dbtut.com\/?p=1689"},"modified":"2018-11-09T23:05:39","modified_gmt":"2018-11-09T23:05:39","slug":"primary-index-concept-in-teradata","status":"publish","type":"post","link":"https:\/\/dbtut.com\/index.php\/2018\/08\/14\/primary-index-concept-in-teradata\/","title":{"rendered":"Primary index concept in Teradata"},"content":{"rendered":"

 <\/p>\n

Every table must have\u00a0at least one column<\/b>\u00a0as the Primary Index. The Primary Index is defined when the table is created.There are two reasons you might pick a different Primary Index then your Primary Key.<\/p>\n

They are (1) for Performance reasons and (2) known access paths.<\/p>\n

Primary Index Rules:<\/b><\/p>\n

Rule 1:<\/i>\u00a0One Primary Index per table.
\nRule 2<\/i>: A Primary Index value can be\u00a0unique<\/b>\u00a0or\u00a0non-unique<\/b>.
\nRule 3:<\/i>\u00a0The Primary Index value can be NULL.
\nRule 4:<\/i>\u00a0The Primary Index value can be modified.
\nRule 5:<\/i>\u00a0The Primary Index of a populated table cannot be modified.
\nRule 6:<\/i>\u00a0A Primary Index has a limit of 64 columns.<\/p>\n

Two Types of Primary Indexes (UPI or NUPI)<\/p>\n

Unique Primary Index<\/b>(UPI)<\/b><\/u><\/p>\n

A Unique Primary Index (UPI) is unique and cannot have any duplicates.
\nIf you try and insert a row with a Primary Index value that is already in the table, the row will be rejected.\u00a0An UPI enforces UNIQUENESS for a column<\/b>.<\/p>\n

A Unique Primary Index (UPI) will always spread the rows of the table evenly amongst the AMPs. UPI access is always a\u00a0one-AMP operation.\u00a0<\/b><\/p>\n

We have selected EMP_NO to be our Primary Index. Because we have designated EMP_NO to be a Unique Primary Index, there can be no duplicate employee numbers in the table.<\/p>\n

\"TeradataWiki-Teradata<\/p>\n

 <\/p>\n

Non-Unique Primary Index (NUPI)\u00a0<\/u><\/b><\/p>\n

A Non-Unique Primary Index (NUPI) means that the values for the selected column can be non-unique.\u00a0Duplicate values can exist<\/b>.<\/p>\n

A Non-Unique Primary Index will almost never spread the table rows evenly.
\nAn\u00a0All-AMP operation\u00a0<\/b>will take longer if the data is unevenly distributed. You might pick a NUPI over an UPI because the NUPI column may be more effective for query access and joins.<\/p>\n

We have selected LAST_NAME to be our Primary Index. Because we have designated LAST_NAME to be a Non-Unique Primary Index we are anticipating that there will be individuals in the table with the same last name.<\/p>\n

\"TeradataWiki-Teradata<\/a><\/div>\n
<\/div>\n
Multi-Column Primary Indexes:\u00a0<\/b><\/div>\n
\n

Teradata allows more than one column to be designated as the Primary Index. It is still only one Primary Index, but it is merely made up by combining multiple columns together. Teradata allows up to\u00a064 combined columns<\/b>\u00a0to make up the one Primary Index required for a table.<\/p>\n

On the following page you can see we have designated First_Name and Last_Name combined to make up the Primary Index.
\nThis is often done for two reasons:
\n(1) To get better data distribution among the AMPs
\n(2) Users often use multiple keys consistently to query<\/p>\n<\/div>\n

\n
<\/a><\/div>\n

SQL Syntax for Creating a Primary Index\u00a0<\/strong><\/p>\n

\u00a0Creating a Unique Primary Index\u00a0\u00a0<\/u><\/strong><\/p>\n<\/div>\n

The SQL syntax to create a Unique Primary Index is:<\/p>\n
CREATE TABLE sample_1\r\n(col_a INT\r\n,col_b INT\r\n,col_c INT)\r\nUNIQUE PRIMARY INDEX\u00a0(col_b);<\/pre>\n<\/div>\n
<\/div>\n
Creating a Non-Unique Primary Index\u00a0<\/u><\/strong><\/div>\n
\n
The SQL syntax to create a Non-Unique Primary Index is:<\/p>\n
CREATE TABLE sample_2\r\n(col_x INT\r\n,col_y INT\r\n,col_z INT)\r\nPRIMARY INDEX\u00a0(col_x);<\/pre>\n
 <\/p>\n
Data distribution using Primary Index\u00a0<\/u><\/b><\/p>\n<\/div>\n
\n
When a user submits an SQL request against a table using a Primary Index, the request becomes a one-AMP operation, which is the most direct and efficient way for the system to find a row. The process is explained below.<\/p>\n<\/div>\n
\n
\"Teradata<\/a><\/div>\n
 <\/p>\n
Hashing Process\u00a0\u00a0<\/b><\/p>\n<\/div>\n
1.The primary index value goes into the hashing algorithm.
\n2.The output of the hashing algorithm is the row hash value.
\n3.The hash map points to the specific AMP where the row resides.
\n4.The PE sends the request directly to the identified AMP.
\n5.The AMP locates the row(s) on its vdisk.
\n6.The data is sent over the BYNET to the PE, and the PE sends the answer set on to the client application.Duplicate Row Hash Values\u00a0<\/b>It is possible for the hashing algorithm to end up with the same row hash value for two different rows.There are two ways this could happen:<\/p>\n<\/div>\n
\n