Lecture
This lecture covers the concepts of hashing and sorting, starting with an introduction to static hashing and the use of hash functions to distribute values. It then delves into extendible hashing, which avoids overflow pages by splitting full buckets. The lecture also explains linear hashing as a dynamic hashing scheme and discusses the main idea behind it. Examples are provided to illustrate the process of handling inserts and the impact of certain values on the hashing process. The lecture concludes with a comparison between external sorting and unclustered indexes, highlighting the importance of external merge sort in minimizing disk I/O costs.