All posts by Mateusz Kuźmik

How does B-tree make your queries fast?

B-tree is a structure that helps to search through great amounts of data. It was invented over 40 years ago, yet it is still employed by the majority of modern databases. Although there are newer index structures, like LSM trees, B-tree is unbeaten when handling most of the database queries.

Mateusz Kuźmik

I just like to know how things work. On a daily basis, I spend a lot of time with JVM Tech.