Databases
B Trees and B+ Trees
How B-trees and B+ trees organize data on disk for fast lookups, starting from disk structure and why databases lean on them for indexing.
How B-trees and B+ trees organize data on disk for fast lookups, starting from disk structure and why databases lean on them for indexing.
Modeling and querying graph data in PostgreSQL when a dedicated graph database would be overkill, starting from graph fundamentals.
What a cartogram is and how it reshapes geography by statistical data such as population, laying the conceptual groundwork for building one....
A reflection on why challenging existing solutions and reinventing the wheel drives real progress, despite the popular advice against it.
How distributed training accelerates deep learning across many processors, using data parallelism and model parallelism to cut training time.
My accepted Google Summer of Code 2022 proposal for Our World in Data, building a population-scaled, shape preserving world cartogram.
Introducing hybrid quad-kd and r-kd tree structures that combine the quadtree, KD-tree, and R-tree to speed up search over mixed point and...
Why geometric algorithms like the convex hull break under floating point arithmetic, and the round off errors that produce non-convex or never-ending...
How external merge sort handles datasets too large for memory, using a split phase and a priority queue driven K-way merge, walked...
Replacing sprawling switch statements over enums with the Visitor pattern in Java, for code that stays clean and easy to extend.
Building MYRO, a myoelectric prosthetic arm that reads muscle activity through EMG sensors and pattern recognition to drive a 3D printed hand....