Skip to content
lectern.tv
1/4

Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)

Andy PavloDistinguishedCarnegie Mellon University

Associate Professor of Databaseology

1:18:45·2023·undergraduate level

Cache-conscious engineering walkthrough of open-addressing probe schemes (Robin Hood, Cuckoo) and disk-friendly dynamic hashing (Extendible and Linear Hashing).

Systems & CSDatabase SystemsAlgorithms & Data StructuresHash TablesExtendible Hashing

15-445/645 Intro to Database Systems (Fall 2023) Carnegie Mellon University

Source: CMU Database Group via YouTubeWatch on YouTube
LecturerAll lecturers →
Andy PavloDistinguished

Associate Professor of Databaseology, Carnegie Mellon University

Associate Professor of Computer Science at Carnegie Mellon whose 15-445 and 15-721 courses are the gold standard in database systems architecture.

3 courses · 58 lecturesCanon
Previous · Lecture 7

Buffer Pool Managers, LRU-K Eviction & Direct I/O

Next · Lecture 9

B+Tree Indexes

Comments

Add a comment...Sign in