S7:E5 Hash Tables: Data Storage and Retrieval
Failed to add items
Add to basket failed.
Add to wishlist failed.
Remove from wishlist failed.
Adding to library failed
Follow podcast failed
Unfollow podcast failed
S7:E5 Hash Tables: Data Storage and Retrieval
-
Narrated by:
-
By:
About this listen
This episode introduces hash tables as an efficient data structure for nearly instant record retrieval from large datasets, contrasting them with slower sequential and binary search methods. It explains that a hashing algorithm calculates a unique address for data, but this can lead to collisions where different keys generate the same address; various collision resolution strategies are discussed, such as finding the next free slot or using varied skip values. The text also covers different hashing algorithms like mid-square and folding, and how to handle alphanumeric data by converting it to numeric values. Finally, it defines a dictionary as an abstract data type storing key-value pairs, explaining its common uses and operations, and highlighting its connection to hashing for efficient data access.