Stanford EE Computer Systems Colloquium

4:15PM, Wednesday, May 04, 2011
HP Auditorium, Gates Computer Science Building B01

Modifying traditional B+ Trees for optimal performance on arbitrary storage systems

Slava Akhmechet
About the talk:

The B+ tree data structure, ubiquitous in database management systems and file systems, was designed for high performance on rotational media. We revisit the B+ Tree data structure by exploring its performance on a variety of modern storage devices such RAID controllers, network-attached storage, and solid-state drives, and propose an extension that significantly improves the performance on a number of such systems. In this talk, we'll explain the rationale for our work, walk through the details of the implementation, and present the performance results.


There is no downloadable version of the slides for this talk available at this time.

About the speaker:

Slava has built technology for infrastructure software, consumer web, and financial companies. He is interested in high level programming languages, compilers, data storage systems, and software start-ups. If he had to eat one type of food for the rest of his life, it would be sushi. He is now on leave from the Ph.D. program in Computer Science at Stony Brook University, working on RethinkDB.

Contact information:

Slava Akhmechet
152 E Dana St.
Mountain View, CA 94041
(347) 982-6273