Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concepts of hashing and sorting in data-intensive applications and systems. It starts with an introduction to hashing, explaining static hashing and its limitations. The lecture then delves into extendible hashing and linear hashing as solutions to the issues faced in static hashing. Examples are provided to illustrate the process of handling inserts and directory doubling. Additionally, the lecture discusses sorting techniques, including 2-way external sorting and general external merge sort. The cost analysis of external merge sort and the use of clustered B+ trees for sorting are also explained.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace