6.851 | Spring 2012 | Graduate

Advanced Data Structures

Lecture Videos

Session 7: Memory Hierarchy Models

Description: Cache-efficient structures. B-trees are good at data transferred in blocks between cache and main memory, main memory and disk, and so on, achieving O(logB N) insert/delete/predecessor/successor for N items and memory block transfers of size B.

Speaker: Prof. Erik Demaine

Course Info

As Taught In
Spring 2012
Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Lecture Notes
Instructor Insights