×
B-tree

The Issue of B-tree Height with Large Data Volumes in a MySQL Single Table

This article introduces why MySQL B-tree height stays within 4–5 layers even with tens of billions of rows, debunking the myth that single tables must be sharded after 5 million rows.

Spatial Search: Geometry and GiST Combination Outperforms Geohash and B-tree

In this article, we explore spatial search performance and describe when to use Geohash, geometry, and geography data types along with indexes such as GiST and B-tree.