Pessimistic Concurrency Control - 2PL
How pessimistic concurrency control and two-phase locking coordinate database transactions while preserving correctness.
Read article10 articles
How pessimistic concurrency control and two-phase locking coordinate database transactions while preserving correctness.
Read articleHow database optimizers transform declarative SQL into efficient plans using heuristics, cost models, and search strategies.
Read articleA practical tour of database join execution, including nested-loop, block nested-loop, index, sort-merge, and hash joins.
Read articleHow database engines execute sorting, hashing, grouping, and aggregation operations efficiently when data exceeds available memory.
Read articleHow database hash indexes avoid linear scans, organize buckets, handle collisions, and support efficient equality lookups.
Read articleA closer look at database buffer replacement policies, including LRU, clock algorithms, and workload-aware memory management.
Read articleHow database buffer pools move pages between disk and memory, reduce expensive I/O, and support efficient query execution.
Read articleHow database compression reduces I/O, including encoding techniques, execution tradeoffs, and the importance of preserving data fidelity.
Read articleHow row, column, and hybrid database storage models serve different OLTP and OLAP workloads and I/O access patterns.
Read articleA clear comparison of OLTP and OLAP database workloads, including transaction patterns, analytical queries, and system design tradeoffs.
Read article