What is a B-tree?The B-tree plays a foundational role in many pieces of software, especially database management systems (DMBSs). MySQL, Postgres, MongoDB, Dynamo, and many others rely on B-trees to perform efficient data lookups via indexes. 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 prima
![B-trees and database indexes — PlanetScale](https://cdn-ak-scissors.b.st-hatena.com/image/square/0aa0e9f24988f17a44998992719ab55bd8e4c3b2/height=288;version=1;width=512/https%3A%2F%2Fplanetscale.com%2Fassets%2Fblog%2Fcontent%2Fbtrees-and-database-indexes%2Fsocial.jpg)