Databases · Comparisons and explanations
B-trees versus LSM trees
Compare B-tree and LSM storage designs through ordered access, buffering, compaction, tombstones and read/write/space amplification.
IntermediateSEARCH LAVACS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
60 results · page 1 of 3
Databases · Comparisons and explanations
Compare B-tree and LSM storage designs through ordered access, buffering, compaction, tombstones and read/write/space amplification.
IntermediateDatabases · Comparisons and explanations
Compare PostgreSQL hash and B-tree indexes through equality, ranges, ordering, collisions and workload-dependent plan choices.
IntermediateDatabases · Comparisons and explanations
Compare PostgreSQL physical and logical replication by replication unit, selectable data, schema handling and migration or failover requirements.
IntermediateDatabases · Comparisons and explanations
Compare version-based visibility with two-phase locking, including serialization guarantees, reader/writer interaction and implementation boundaries.
IntermediateDatabases · Comparisons and explanations
Compare transactional and analytical workloads through access patterns, storage layout, indexes, concurrency and freshness requirements.
IntermediateDatabases · Comparisons and explanations
Compare PostgreSQL isolation levels through snapshot timing, update conflicts and the anomalies that remain possible.
IntermediateDatabases · Comparisons and explanations
Compare transaction serializability with operation linearizability using histories that distinguish atomic grouping from real-time order.
IntermediateDatabases · Comparisons and explanations
Compare a log of changes with a captured base state, and distinguish storage snapshots, backups and MVCC visibility snapshots during recovery planning.
IntermediateDatabases · Concepts and theorems
Use a transfer example to separate atomicity, consistency, isolation, and durability without treating the acronym as one unlimited guarantee.
IntermediateDatabases · Concepts and theorems
Trace filter and join estimates and explain how row-count errors affect physical execution choices.
IntermediateDatabases · Concepts and theorems
Distinguish commit acknowledgement, WAL, storage and backups while stating the failure scope of durability.
IntermediateDatabases · Concepts and theorems
Distinguish keys, semantic dependencies and accidental patterns with an employee-and-department example.
IntermediateDatabases · Concepts and theorems
Understand why keeping old row versions supports snapshots without eliminating every lock or anomaly.
IntermediateDatabases · Concepts and theorems
Use an employee/department decomposition to distinguish BCNF, lossless joining and dependency preservation.
IntermediateDatabases · Concepts and theorems
Distinguish foreign-key validation, delete actions, null handling, and indexing when connecting related tables.
IntermediateDatabases · Concepts and theorems
Distinguish predicate fractions from index usefulness using skewed values and combined conditions.
IntermediateDatabases · Concepts and theorems
Use a write-skew example to test whether a concurrent outcome matches any permitted serial transaction order.
AdvancedDatabases · Observation and diagnostics
Separate vacuum activity, phase progress and reclaimability while considering retained snapshots and transaction-ID protection.
IntermediateDatabases · Observation and diagnostics
Separate estimates from measurements and interpret row counts, loops, and buffers when investigating PostgreSQL query plans.
IntermediateDatabases · Observation and diagnostics
Read lock targets, modes and granted state, then trace blocking with mode compatibility and queue dependencies in view.
IntermediateDatabases · Observation and diagnostics
Separate connection, statement and transaction state and clocks, then use wait events and blockers to investigate current backend work.
IntermediateDatabases · Observation and diagnostics
Compare normalized SQL counts and execution-time deltas over a matched interval to distinguish accumulated workload cost from individual-request latency.
IntermediateDatabases · Observation and diagnostics
Interpret index counters with their windows and units, evaluating retrieval, writes, constraints and infrequent operational work.
IntermediateDatabases · Failures and antipatterns
Identify mount, inode and quota constraints, preserve database recovery history, and verify both restored writes and recurrence causes.
Intermediate