Tag: database internals

Every database is a collection of engineering tradeoffs. Learn the 9 design decisions that shape how query engines store...

Row stores keep records together for fast transactions. Column stores keep field values together for fast analytics. Her...

Databases structure data on disk as heap files, sorted files, or LSM trees, then wrap it in formats like Parquet with me...

B-trees balance reads and writes for OLTP. LSM trees maximize write throughput. Bitmap indexes accelerate OLAP filtering...

Query optimizers transform SQL into execution plans using rule-based rewrites, cost-based search, and adaptive runtime a...

The Volcano model processes one row at a time. Vectorized execution processes batches with SIMD. Code generation fuses o...

Databases use buffer pools, column caches, and result caches to keep hot data in RAM. Here is how each caching strategy ...

Hash partitioning distributes data evenly. Range partitioning enables fast range scans. Both create tradeoffs. Here is h...

Distributed joins move data across the network using shuffle, broadcast, or co-location strategies. Here is how each wor...