==Title:== 

Data Structures for Big Data 

==Professors:==

Michael Bender (Stony Brook University and Tokutek) 
Martín Farach-Colton (Rutgers and Tokutek)

==Teaching Assistant:== 

Samuel McCauley (Stony Brook University)

==Some course topics==

*Models*

External-memory model.
Cache-oblivious model.
Paging algorithms.
Memory-adaptive algorithms. 

*Massive Data structures and algorithms*

Searching (B-trees, cache-oblivious B-trees, weight-balanced trees). 
Sorting (k/b-way merge sort, funnel sort, priority queues).
Lower bounds. 


*Write-optimized data structures*

Bε-trees.
Cache-oblivious lookahead array (COLA).
Log-structured merge trees.
Indexing in databases with and without write-optimization.
Applications in databases and file systems. 


*Space-efficient/randomized data structures*

Bloom filters 
Quotient filters