Data Structures from the Future: Bloom Filters, Distributed Hash Tables, and More!

Abstract: 

Greetings, earthlings of the year 2010! I've traveled back in time to share with you some of the technologies that system administrators operate in the future. Chances are you know what a cache is and how to tune it. In the future, there will be glorious things such as "bloom filters," "distributed hash tables," and "NoSQL databases." I will reveal what they are and (more important) how to tune them. (This will be an informal talk with a lot of hand-waving.)

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

BibTeX
@conference {267070,
author = {Thomas A. Limoncelli},
title = {Data Structures from the Future: Bloom Filters, Distributed Hash Tables, and More!},
year = {2010},
address = {San Jose, CA},
publisher = {USENIX Association},
month = nov
}
Download

Presentation Video

Presentation Audio

Links

Slides: 
http://www.usenix.org/events/lisa10/tech/slides/limoncelli.pdf