SQL SQL In Depth
0%
lesson null-handling coalesce nullif

NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF

7 min read Module 1.1: The Relational Model, Tables & SELECT Foundations Updated Oct 26, 2026
📄 Cheat Sheet
NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF — Database Systems & SQL Architecture Lecture
CMU Database Group (Andy Pavlo) NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF — Database Systems & SQL Architecture Lecture Watch on YouTube ↗

Builds first-principles mastery of NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF with concrete query execution trees, storage page layouts, and production tuning trade-offs.

0:00 / 4:15

1. First-Principles Mental Model & Relational Mechanics

Every SQL statement in NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF compiles down to a deterministic tree of relational algebra operators acting on physical pages in the buffer pool. At the logical layer, Null-safe comparisons with IS NOT DISTINCT FROM, fallback chains via COALESCE, division-by-zero guards with NULLIF, and aggregate NULL rules. Rather than mutating global variables imperatively, declarative SQL specifies the mathematical properties of the desired output relation while delegating physical access path selection to the cost-based query optimizer.

When the database engine processes null-semantics-coalesce-nullif within The Relational Model, Tables & SELECT Foundations, it enforces strict invariants over tuple domains, attribute visibility, and I/O page budgets. Understanding the boundary between logical relational semantics (what rows qualify) and physical execution (whether the engine performs a sequential heap scan, a B+Tree range seek, or an in-memory hash probe) is the defining skill of a Staff Database Engineer.

Formal Relational & Cost Invariant — NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF

Let relation RR contain NN tuples stored across BB physical 8KB pages (B≈⌈N/tuples_per_page⌉B \approx \lceil N / \text{tuples\_per\_page} \rceil). Evaluating NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF maintains the relational closure and I/O cost bound:

CostI/O(R)=Bseq⋅cseq+log⁡F(N)⋅crandom,σθ(πA(R))⊆Dom(A)\text{Cost}_{\text{I/O}}(R) = B_{\text{seq}} \cdot c_{\text{seq}} + \log_{F}(N) \cdot c_{\text{random}}, \quad \sigma_{\theta}(\pi_{A}(R)) \subseteq \text{Dom}(A)

Where F≈250–500F \approx 250\text{--}500 is the B+Tree page fanout, σθ\sigma_{\theta} denotes Three-Valued Logic predicate selection over null-handling, and πA\pi_{A} projects the target attribute schema without violating domain constraints.

2. Database Table Schema, Execution Pipeline & Visual Architecture

Tracing how NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF flows through the parser, catalog binder, cost-based optimizer, and physical executor reveals exactly where latency and cardinality bugs originate:

  • Stage 1 — Lexical Parsing & Catalog Binding (null-handling): The SQL parser builds an Abstract Syntax Tree (AST) and resolves every relation, column identifier, and data type against system catalog tables (such as pg_class, pg_attribute, or sqlite_master).
  • Stage 2 — Logical Rewrite & Algebraic Simplification (coalesce): The planner normalizes predicates, pushes selective filters as close to the storage scan as possible, and verifies whether Three-Valued NULL semantics permit subquery unnesting or join elimination.
  • Stage 3 — Cost Estimation & Physical Operator Selection (nullif): Using histogram boundaries, Most Common Values (MCV), and Number of Distinct Values (NDV), the optimizer selects the minimum-cost physical plan and streams tuples through the execution pipeline.
NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE... — Relational Table & Key Constraint Diagram Module M01 · PK/FK Referential Join · 3VL Predicate Selection (null-handling / coalesce) TABLE customers (Parent) PK customer_id name tier 1 Aravind ent 2 Elena pro 7 Chloe std UNIQUE(email) · NOT NULL TABLE orders (Child FK) PK order_id FK cust_id total_cents 1001 1 105000 1002 2 42000 1005 4 21000 (filtered) ON cust_id = c.customer_id PROJECTED OUTPUT name order usd Aravind 1001 $1050 Elena 1002 $420 Chloe NULL $0.00 3VL NULL-Safe Output
erDiagram CUSTOMERS ||--o{ ORDERS : "places (customer_id)" ORDERS ||--|{ ORDER_ITEMS : "contains (order_id)" PRODUCTS ||--o{ ORDER_ITEMS : "referenced_by (product_id)" CUSTOMERS { int customer_id PK text email UK text name text tier text country } ORDERS { int order_id PK int customer_id FK text status int total_cents text discount_code } ORDER_ITEMS { int order_item_id PK int order_id FK int product_id FK int quantity int unit_price_cents }

3. Interactive Table-Level & Storage Engine Simulator

Use the interactive simulator below to step through NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF at the tuple and page level. Observe how input rows, intermediate filter/join states, NULL badges, and physical page reads evolve at each step:

Three-Valued Logic (TRUE / FALSE / UNKNOWN) & NULL Coalescing Stepper
3VL Kleene Logic

Inspect how NULL propagates through arithmetic, equality (= vs IS DISTINCT FROM), AND/OR truth tables, CASE expressions, and COALESCE/NULLIF.

Step 1 / 7
Custom Input:
Timeline

Invariant & State

Relation initialized with 5 tuples across schema (entry_id, account, amount_cents, discount_pct, effective_cents) — preset: WHERE discount_pct > 10 OR coupon IS NULL.
📊 Live Magnitude & Pointer Stage — Three-Valued Logic (TRUE / FALSE / UNKNOWN) & NULL Coalescing Stepper Active Pivot Match/Sorted
Tuple # 1:10000 [0] 2:25000 [1] 3:18000 [2] 4:42000 [3] 5:15000 [4]
📋 Three-Valued Logic (TRUE / FALSE / UNKNOWN) & NULL Coalescing Stepper — Initial Relation State 5 row(s)
entry_idaccountamount_centsdiscount_pcteffective_centsState
1acct_stripe_0110000158500CURSOR START
2acct_stripe_0225000NULL25000
3acct_stripe_0318000018000
4acct_stripe_04420002033600
5acct_stripe_0515000NULL15000
[0]1:10000Tuple #0
[1]2:25000
[2]3:18000
[3]4:42000
[4]5:15000
Input Tuples
5
Columns
5
Preset Mode
3vl
Pipeline Stage
1. Initial Scan
[Step 1] Initialized Three-Valued Logic (TRUE / FALSE / UNKNOWN) & NULL Coalescing Stepper (WHERE discount_pct > 10 OR coupon IS NULL) with 5 base rows.

4. Live WASM SQL Lab, Clause-by-Clause Visualizer & Automated Test Checker

Execute, edit, and test the production SQL query below directly in your browser using the embedded WebAssembly SQLite 3 engine. Click ▶ Run Query to execute, 🔍 Step Clauses to inspect the live intermediate table after FROM/JOIN, WHERE, GROUP BY, HAVING, WINDOW, SELECT, and ORDER BY, or ✓ Check SQL Tests to run automated relational assertions against the reference result:

SQL · WASM12 lines
-- Dataset: ecommerce | Null-Safe Handling with COALESCE & NULLIF
SELECT
  o.order_id,
  c.name AS customer_name,
  COALESCE(o.discount_code, 'NO_PROMO') AS normalized_discount_code,
  o.total_cents,
  ROUND(o.total_cents / NULLIF(100.0, 0), 2) AS total_usd
FROM orders AS o
INNER JOIN customers AS c
  ON c.customer_id = o.customer_id
WHERE o.discount_code IS NULL OR o.total_cents >= 30000
ORDER BY o.total_cents DESC;

5. Cross-Engine Dialect & Cost Comparison Matrix

While the SQL ISO standard defines the logical behavior of NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF, production storage engines differ in how they execute, lock, and index the underlying tuples:

Database Engine Primary Storage & Access Mechanism I/O & CPU Complexity Production Caveat for NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF
PostgreSQL 17 Heap Tuple Store (ctid) + B-Tree / GIN / BRIN + MVCC (xmin/xmax) O(log⁡BN)O(\log_B N) seek / O(N)O(N) scan Requires ANALYZE statistics and Visibility Map bits for Index-Only Scans.
SQLite 3.46 (WASM) B+Tree Table (rowid clustered) + Covering Secondary B-Trees O(log⁡BN)O(\log_B N) B+Tree traversal Runs in-process with zero network RTT; inspect EXPLAIN QUERY PLAN for USE TEMP B-TREE.
MySQL 8.4 (InnoDB) Clustered Primary Key B+Tree + Undo Log Rollback Segments O(log⁡BN)O(\log_B N) PK / 2×O(log⁡BN)2 \times O(\log_B N) Secondary Secondary indexes store the Primary Key value; wide PKs amplify secondary index footprint.
DuckDB / ClickHouse Columnar Vectorized Chunks + Zone Maps (Min/Max Skipping) O(N/SIMD_Width)O(N / \text{SIMD\_Width}) vectorized scan Excels at wide analytical scans and aggregations; avoid single-row OLTP point mutations.

6. Under the Hood: Storage & Execution Engine Implementation (C++20)

To truly understand how a database engine executes NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF without hand-waving, examine the C++20 storage kernel operator below. It models how the execution engine iterates over pinned buffer pool pages, evaluates tuple predicates, and tracks page I/O statistics:

C++2032 lines
#include <iostream>
#include <vector>
#include <cstdint>
#include <string>
#include <algorithm>

// Database Engine Kernel Operator: NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF
struct TuplePageStats {
    uint64_t tuples_examined;
    uint64_t tuples_emitted;
    uint64_t pages_pinned;
};

inline TuplePageStats eval_null_semantics_coalesce_null(const std::vector<int64_t>& keys, int64_t predicate_bound) noexcept {
    TuplePageStats stats{0, 0, (keys.size() + 127) / 128};
    for (int64_t k : keys) {
        ++stats.tuples_examined;
        if (k >= predicate_bound) {
            ++stats.tuples_emitted;
        }
    }
    return stats;
}

int main() {
    std::vector<int64_t> relation = {10, 25, 40, 55, 70, 85, 100, 115};
    auto res = eval_null_semantics_coalesce_null(relation, 50);
    std::cout << "[Engine Operator: null-semantics-coalesce-nullif] examined=" << res.tuples_examined
              << " emitted=" << res.tuples_emitted
              << " pages=" << res.pages_pinned << "\n";
    return 0;
}

7. Production Failure Modes, Anti-Patterns & Staff Tuning Checklist

Production Pitfall & SEV-1 Outage Pattern

The most common production failure in NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF occurs when a query passes functional unit tests on a 50-row local fixture but degrades into an O(N2)O(N^2) loop, an unindexed full-table scan, or a silent NULL data-drop once table cardinality crosses 10710^7 rows. Always verify both NULL boundary rows and physical buffer reads before deploying to production.

  • Verify Execution Plans Early: Never guess what the planner will do—run EXPLAIN QUERY PLAN (SQLite) or EXPLAIN (ANALYZE, BUFFERS) (PostgreSQL) and confirm that estimated row counts match actual row counts within 2×2\times.
  • Guard Against Three-Valued NULL Traps: Audit every NOT IN, outer-join WHERE filter, and aggregate AVG/COUNT(col) expression for nullable columns; prefer NOT EXISTS and explicit COALESCE defaults.
  • Keep Predicates SARGable: Never wrap an indexed column in a function, arithmetic expression, or implicit type cast on the left-hand side of a comparison operator.
  • Bound Memory & Lock Scope: Ensure sorting, hashing, and batch mutations operate within bounded memory budgets (work_mem) and hold row/table locks for the shortest possible duration.
Check yourself Question 1 of 4
Concept Check NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF — Core Relational Invariant recall

Which statement accurately characterizes the primary mechanism and guarantee of NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF?

Guided SQL & Database Engine Practice · Browser WASM Workbench 3 Guided Steps + Progressive Hints

NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF — Guided SQL & Engine Lab

Null-safe comparisons with IS NOT DISTINCT FROM, fallback chains via COALESCE, division-by-zero guards with NULLIF, and aggregate NULL rules.

⏱ Target Time: O(N) scan / O(log_B N) indexed 💾 Auxiliary Space: O(1) streaming tuple state 🧭 Pattern: The Relational Model, Tables & SELECT Foundations
01 Phase 1 · Tuple State & Boundaries
Initialize Tuple Scan State (eval_null_semantics_coalesce_null)
Allocate the operator state structure for NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF and establish zero-row boundary invariants.
Replace TODO (Step 1) inside eval_null_semantics_coalesce_null in src/main.cpp by initializing ExecutionResult out{}; and iterating over table.
💡 Progressive Hint (Step 1)
ExecutionResult out{};
for (const auto& row : table) {
  ++out.rows_scanned;
02 Phase 2 · Three-Valued Logic & Predicate Evaluation
Evaluate 3VL NULL Guard & Predicate Filter
In SQL, NULL comparisons evaluate to UNKNOWN and must be excluded before aggregating.
Implement TODO (Step 2) in src/main.cpp to check !row.is_null && row.metric_cents >= min_cents.
💡 Progressive Hint (Step 2)
if (!row.is_null && row.metric_cents >= min_cents) {
  ++out.rows_matched;
  out.sum_cents += row.metric_cents;
}
03 Phase 3 · Aggregate Projection & Verification
Return Projected Tuple Summary & Pass Unit Assertions
Verify exact integer-cent accumulation and row counts across edge cases.
Complete TODO (Step 3) in src/main.cpp by returning out; and clicking Run & Test.
💡 Progressive Hint (Step 3)
return out;

Key Takeaways

NULL Semantics: IS NULL, IS DISTINCT FROM, COALESCE & NULLIF (null-semantics-coalesce-nullif): Null-safe comparisons with IS NOT DISTINCT FROM, fallback chains via COALESCE, division-by-zero guards with NULLIF, and aggregate NULL rules.
Always separate logical SQL semantics (FROM -> WHERE -> GROUP BY -> HAVING -> WINDOW -> SELECT -> ORDER BY -> LIMIT) from the physical execution plan chosen by the cost-based optimizer.
Audit every predicate and join condition for Three-Valued Logic (NULL -> UNKNOWN) edge cases and verify SARGability so B+Tree indexes can perform O(log_B N) range seeks.
Use EXPLAIN QUERY PLAN / EXPLAIN (ANALYZE, BUFFERS) to inspect physical scan operators, join algorithms, and temporary sort/hash spills before shipping queries to production.
Was this lesson helpful? Spot an issue or have a suggestion? Let us know on GitHub.
Report an issue