Databases
2 articles
B-Tree vs LSM Tree — When to Use Which
B-trees optimize for reads with in-place updates. LSM trees optimize for writes with append-only I/O. PostgreSQL vs RocksDB, row store vs log store — the tradeoffs that determine database performance.
Reading EXPLAIN ANALYZE — A Practical Guide to Query Plans
EXPLAIN ANALYZE shows exactly what the database does with your query. Seq Scan vs Index Scan, hash joins vs nested loops, where time is spent, and how to fix slow queries.