Tagged articles

MySQL indexing

2 articles · Page 1 of 1
Ray's Galactic Tech
Ray's Galactic Tech
Nov 24, 2025 · Databases

Why Storing Phone Numbers as VARCHAR Beats BIGINT in Billion‑Row Databases

This article explains why phone numbers should be stored as VARCHAR(15~20) rather than INT/BIGINT, covering underlying principles, performance tests, internationalization, security, large‑scale optimization techniques, and a concrete best‑practice checklist for enterprise systems.

MySQL indexingVARCHAR vs BIGINTdata normalization
0 likes · 9 min read
Why Storing Phone Numbers as VARCHAR Beats BIGINT in Billion‑Row Databases
Raymond Ops
Raymond Ops
Feb 1, 2025 · Databases

Why MySQL Chooses B+ Trees: From BSTs to Efficient Disk Indexes

This article explains how MySQL's indexing evolved from simple binary search trees through AVL and red‑black trees to B‑trees and finally B+ trees, highlighting the performance and I/O advantages that make B+ trees the preferred index structure for disk‑based databases.

B+ TreeData StructuresMySQL indexing
0 likes · 13 min read
Why MySQL Chooses B+ Trees: From BSTs to Efficient Disk Indexes