• USA : +1 973 910 5725
  • INDIA: +91 905 291 3388
  • info@tekslate.com
  • Login

Hash Maps in TeraData

Hash Maps

Screenshot_53

 

DSW(distribution selection word)

 

Screenshot_54

 

Screenshot_55

These core tutorials will help you to learn the Hash Maps in TeraData. For an in-depth
 understanding and practical experience, explore Teradata Training and Certification.

Hash Map provides relationship between row hash value[DSW] and Amp address

Primary index Physical Mechanism [Storage & retrieval Party id mechanism]

 

Screenshot_56

Screenshot_57

 

The  dates distribution in the Amp’s and amp contains the data in rowed logical Sequence

 

Inside the Amp

Sel * From party where Pid=2

 

Screenshot_58

Screenshot_59

Check out the top Teradata Interview Questions now!

 

Hash synonym(or) Hash collisions

Getting same row hash values for the same (or) to PI value is called hash synonym(or) Hash collision

In this situation to identify every row system takes a concept called rowed

It is useful to identify every record unique in the am

It is taken by the amp only

It contain 64 bits first 32 bits are row hash value, next 32 bits are u values

 

Screenshot_60

For Indepth knowledge on Teradata click on:

 

Summary
Review Date
Reviewed Item
Hash Maps in TeraData
Author Rating
5

“At TekSlate, we are trying to create high quality tutorials and articles, if you think any information is incorrect or want to add anything to the article, please feel free to get in touch with us at info@tekslate.com, we will update the article in 24 hours.”

0 Responses on Hash Maps in TeraData"

Leave a Message

Your email address will not be published. Required fields are marked *

Site Disclaimer, Copyright © 2016 - All Rights Reserved.