How PostgreSQL Uses B-Tree Indexes to Retrieve Data from Disk
Tracing how PostgreSQL traverses B-Tree indexes, resolves Tuple Identifiers (TIDs), fetches heap pages, and eventually turns a SQL query into disk reads.
Systems-Design
Bounded vs Unbounded Concurrency in Go
Go makes concurrency feel effortless. Add the go keyword, and you have parallel work happening. It feels powerful. It is powerful. But power without constraints is how systems collapse. The Naive Approach: Unbounded Concurrency While building a small CLI tool to verify large list of domains, my initial implementation spawned one goroutine per domain. Meaning the number of go routines scaled directly with the input size. This is a poor design. A large enough input size can cause the system to melt down and crash. ...