Skip to content
tezvyn:
Menu

Databases

229 bites tagged Databases: interview questions with model answers, and 60-second explainers.

Test yourself: Top 30 Databases interview questions →Multiple choice, with the correct answer and why it is correct on every question. Free, no sign-in.
Monitoring & SRE1 min read

Blue-green deploys with schema migrations

The shared database means both versions hit one schema, so breaking changes must be split into backward-compatible steps via expand-and-contract.

Databases & Architecture1 min read

Cutting managed database costs without breaking SLOs

Pool connections, prune and tune indexes, offload reads, tier or partition cold data, right-size storage IOPS.

Databases & Architecture1 min read

Designing an HA/DR strategy for an OLTP database

Sync standby in-region for zero data loss, async cross-region for DR, automated failover with a quorum.

Databases & Architecture1 min read

Diagnosing and optimizing a slow production query

Read the EXPLAIN ANALYZE plan, find the costly node, then fix via indexing, rewrite, or stats.

Databases & Architecture1 min read

Optimizing queries on a billion-row fact table

Partition to prune scans, index for selective lookups, materialize views to precompute aggregates; each adds write or maintenance cost.

Databases & Architecture1 min read

Logical vs physical query plans and the optimizer

Logical plan says what (relational algebra, no algorithms); physical plan says how (specific operators); cost-based optimizer enumerates physical options and picks the cheapest using statistics.

Databases & Architecture2 min read

How databases implement GROUP BY aggregation

Hash aggregation builds a hash table keyed by group holding running aggregates; sort aggregation orders rows then aggregates adjacent groups; optimizer picks based on data and memory.

Databases & Architecture1 min read

The Volcano iterator model of query execution

Each operator exposes open/next/close, parents pull tuples from children, uniform composable interface, pipelined low memory.

Databases & Architecture1 min read

Phantom reads and how serializable prevents them

New rows matching a predicate appear between reads; classic Repeatable Read locks existing rows not ranges; Serializable uses range or predicate locks.

Databases & Architecture1 min read

Choosing a time-series database for metrics

High-ingest timestamped writes, time-window queries, retention and downsampling, time-optimized compression.

Databases & Architecture1 min read

Diagnosing database latency layer by layer

Split total time into pool-wait, query execution, and ORM-generated query patterns; use metrics at each layer.

Databases & Architecture1 min read

Vectorized query execution and its speedups

Process column batches per operator call, amortize per-tuple overhead, use cache locality and SIMD.

Databases & Architecture2 min read

The buffer pool's role in database IO

Caches pages, serves reads from RAM, buffers dirty writes flushed later, uses eviction like LRU.

Databases & Architecture1 min read

Predicate pushdown and why it speeds queries

Apply WHERE conditions at the scan or remote source, prune partitions and rows early, shrink data movement.

Databases & Architecture1 min read

Denormalization: trading write cost for read speed

Duplicate or precompute data to avoid joins, accept harder writes and consistency risk, justify by read-heavy access.

Databases & Architecture1 min read

Tuning a database connection pool

Max size, min idle, connection and max-lifetime timeouts; size from cores and latency, not guesswork.

Databases & Architecture1 min read

The N+1 query problem and how to fix it

One query for a list plus one per item for its relation, fix with eager loading or a batched join.

Databases & Architecture1 min read

Synchronous vs asynchronous replication trade-offs

Sync waits for replica ack giving zero data loss but higher latency; async acks immediately, faster but risks losing recent writes on failover.

Databases & Architecture1 min read

Choosing a good shard key and avoiding hot spots

High cardinality, even write distribution, query alignment; monotonic keys send all writes to one shard.

Databases & Architecture1 min read

When a graph database beats relational or document stores

Deeply connected data, variable-depth traversals, fraud or recommendation paths, index-free adjacency.

Databases & Architecture1 min read

SQL isolation levels and the anomalies they prevent

Read Uncommitted allows dirty reads; Read Committed blocks them; Repeatable Read blocks non-repeatable reads; Serializable blocks phantoms.

Databases & Architecture1 min read

Zero-downtime schema migration on a hot table

Expand-migrate-contract phases, dual-write and backfill, decouple deploys from migrations.

Databases & Architecture1 min read

Cache-aside pattern with Redis and RDS

App checks cache, on miss reads DB and populates, writes invalidate the key, and consistency is eventual.

Databases & Architecture1 min read

Near-zero-downtime database migration to cloud

Assess and provision, do a full load then continuous CDC replication with a tool like DMS, validate, then cut over with a rollback plan.

Get Databases bites daily.

Five a day, five minutes, offline. With quizzes so it sticks.

The iPhone app is on the way

We are building it. Until it lands, nothing here is held back from you: every interview card, your saved cards, streaks and the job board all work in Safari, plus hundreds of free practice quizzes of thirty questions each. Sign in and it all carries over to the app the day it arrives.

Want it as an icon? Tap Share at the bottom of Safari, then Add to Home Screen. It opens full screen and the cards you have read stay available offline.

Get it on Google PlayiPhone app coming soon