Database Indexes: A deep dive thread

So an index isn't "free performance": It comes with: 1) Storage 2) Write Overhead 3) Memory/cache usage for faster reads. And with 10 million rows, the difference between scanning millions of entries and navigating ~23 levels of a tree explains why indexes can be so powerful.

Difference between memory De-allocation in Go vs Rust: A thread

Rust prevents this by doing memory management in compile time which automatically inject cleanup calls(drop) exactly when variable goes out of scope. In this way most allocation stays on stack while heap allocation are freed the instant their owner leaves scope