Get the latest tech news
B-Trees and Database Indexes
B-trees are used by many modern DBMSs. Learn how they work, how databases use them, and how your choice of primary key can affect index performance.
By the time you finish this article, you'll have learned how B-trees and B+trees work, why databases use them for indexes, and why using a UUID as your primary key might be a bad idea. B-trees are uniquely suited to work well when you have a very large quantity of data that also needs to be persisted to long-term storage (disk). MySQL, arguably the world's most popular database management system, supports multiple storage engines.
Or read this on Hacker News