Databases: indexes, EXPLAIN, N+1, pagination and soft delete
Why a correct SQL query can still be slow: B+trees, clustered and composite indexes, covering indexes, sargability, reading EXPLAIN, the N+1 problem, keyset pagination and the real cost of soft delete.