
Performance benchmark graph
Learned Index StructuresFeatured
A database systems project focused on benchmarking learned index structures against traditional B-Trees to understand where prediction-based indexing becomes worthwhile.
What I Built
Implemented single-stage and recursive learned index models, then compared them against B-Trees across different dataset sizes and distributions.
What I Learned
Early results did not show much improvement, which made the added complexity seem questionable. Once we scaled to around 100 million keys, the learned index began to outperform. This taught me a lot about choosing the right tool for the job: B-Trees are strong general-purpose structures, but at the right scale, a specialized approach can be worth the effort.

