Percona Live 2017 Open Source Database Conference

April 24 - 27, 2017

Santa Clara, California

B-Trees, Fractal Trees, Heaps and Log Structured Merge Trees, Where did they all come from and Why?

B-Trees, Fractal Trees, Heaps and Log Structured Merge Trees, Where did they all come from and Why?

 25 April - 11:30 AM - 12:20 PM @ Ballroom B
Experience level: 
Intermediate
Duration: 
50 minutes conference
Tracks:
Wildcard
Topics:
Fundamentals

Description

For many years the B-Tree has reigned supreme as the data structure of choice for most databases. There have always been a few other data structures used as well but they were generally not the way most data was stored. In the past few years a bewildering array of new storage structures seem to have appeared. Why have these alternatives come to be? What can they do for us? Each data structure has its strengths and optimizations for certain kinds of workload. In this talk I will discuss the strengths and weakness of each and I will talk about specific real world examples of how each can be useful.

Speakers

John Schulz's picture

John Schulz

Principal Consultant, The Pythian Group Inc

Biography:

In the last 40 years I Have designed and built databases less than a megabyte small enough to fit on cell phones, to databases several petabytes in size, requiring a good sized data center to hold them. Have worked with Many open source database technologies including MySQL, SQLite, MongoDB, CouchDB, CouchBase, PostgreSQL and many others.

Share this talk