SQL SQL In Depth
0%
design volcano-model vectorized-execution jit

Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT

7 min read Module 4.3: Physical Join Algorithms & Execution Pipelines Updated Oct 26, 2026
📄 Cheat Sheet
Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT — Database Systems & SQL Architecture Lecture
CMU Database Group (Andy Pavlo) Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT — Database Systems & SQL Architecture Lecture Watch on YouTube ↗

Builds first-principles mastery of Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT with concrete query execution trees, storage page layouts, and production tuning trade-offs.

0:00 / 3:39

1. First-Principles Mental Model & Relational Mechanics

Every SQL statement in Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT compiles down to a deterministic tree of relational algebra operators acting on physical pages in the buffer pool. At the logical layer, Comparing classic pull-based Volcano tuple-at-a-time virtual calls against cache-resident 1024-tuple column vectors and LLVM JIT expression compilation. 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 execution-models-volcano-vectorized within Physical Join Algorithms & Execution Pipelines, 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 — Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT

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 Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT 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 volcano-model, and πA\pi_{A} projects the target attribute schema without violating domain constraints.

2. Database Table Schema, Execution Pipeline & Visual Architecture

Tracing how Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT 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 (volcano-model): 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 (vectorized-execution): 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 (jit): 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.
Execution Models: Volcano Iterator (Next) vs Vector... — B+Tree Index Seek & Heap Page Fetch Module M12 · idx_orders_customer_status (customer_id, status) · O(log_B N) Traversal ROOT PAGE #01 (Internal Directory) [ cust_id < 3 ] | [ cust_id >= 3 ] LEAF PAGE #14 (Doubly-Linked) (1, 'completed') -> ctid(0,1) (1, 'completed') -> ctid(0,3) (2, 'completed') -> ctid(0,2) next_leaf_page = #15 ───► LEAF PAGE #15 (Sibling) (3, 'completed') -> ctid(0,4) (3, 'refunded') -> ctid(0,9) (5, 'completed') -> ctid(0,6) 8KB HEAP PAGE #0 (orders) ctid(0,1): id=1001 | $1050.00 ctid(0,2): id=1002 | $420.00 ctid(0,3): id=1003 | $950.00 Visibility Map = 1 (Index-Only OK)
flowchart LR A["1. FROM / JOIN (volcano-model)"] --> B["2. WHERE / 3VL Filter (vectorized-execution)"] B --> C["3. GROUP BY / WINDOW OVER"] C --> D["4. SELECT Projection & ORDER BY (jit)"]

3. Interactive Table-Level & Storage Engine Simulator

Use the interactive simulator below to step through Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT at the tuple and page level. Observe how input rows, intermediate filter/join states, NULL badges, and physical page reads evolve at each step:

Selinger DP Join Ordering, Predicate Pushdown & Volcano vs Vectorized Batch Engine
Pushdown / Vectorized

Watch predicate pushdown prune 95% of rows before the join operator, and compare tuple-at-a-time Volcano next() calls against 1024-value SIMD columnar batches.

Step 1 / 6
Custom Input:
Timeline

Invariant & State

Relation initialized with 4 tuples across schema (plan_stage, unoptimized_rows, pushed_down_rows, virtual_calls, cpu_cycles_per_tuple) — preset: Predicate Pushdown Below Join (100k → 2k Rows Intermediate).
🔗 Live Pointer & State Transition Graph — Selinger DP Join Ordering, Predicate Pushdown & Volcano vs Vectorized Batch Engine Active Pointer Jump/Transition Matched/Optimal
Tuple # 1. Ba… [0] 2. Ba… [1] 3. Ha… [2] 4. Fi… [3]
📋 Selinger DP Join Ordering, Predicate Pushdown & Volcano vs Vectorized Batch Engine — Initial Relation State 4 row(s)
plan_stageunoptimized_rowspushed_down_rowsvirtual_callscpu_cycles_per_tupleState
1. Base Scan (Orders)100,0002,400 (Filtered at Scan!)98 batches6 cyCURSOR START
2. Base Scan (Customers)50,0001,200 (Filtered at Scan!)49 batches6 cy
3. Hash Join Build/Probe5,000,000 pairs2,400 probes3 batches14 cy
4. Final Projection420 rows420 rows1 batch4 cy
[0]1. Base Scan (Orders):2,400 (Filtered at Scan!)Tuple #0
[1]2. Base Scan (Customers):1,200 (Filtered at Scan!)
[2]3. Hash Join Build/Probe:2,400 probes
[3]4. Final Projection:420 rows
Input Tuples
4
Columns
5
Preset Mode
pushdown
Pipeline Stage
1. Initial Scan
[Step 1] Initialized Selinger DP Join Ordering, Predicate Pushdown & Volcano vs Vectorized Batch Engine (Predicate Pushdown Below Join (100k → 2k Rows Intermediate)) with 4 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 · WASM15 lines
-- Dataset: ecommerce | Composite Index Seek (idx_orders_customer_status) & SARGable Plan
SELECT
  o.order_id,
  o.customer_id,
  c.name AS customer_name,
  o.status,
  o.created_at,
  ROUND(o.total_cents / 100.0, 2) AS total_usd
FROM orders AS o
INNER JOIN customers AS c
  ON c.customer_id = o.customer_id
WHERE o.status = 'completed'
  AND o.created_at >= '2025-02-01'
ORDER BY o.created_at DESC, o.order_id DESC
LIMIT 10;

5. Cross-Engine Dialect & Cost Comparison Matrix

While the SQL ISO standard defines the logical behavior of Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT, 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 Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT
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 \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. Live Verification, Catalog Introspection & Execution Plan Lab (SQL)

To verify how a production database engine executes Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT across edge-case rows, run or modify the second live SQL verification query below. Inspect how GROUP BY buckets, window partitions, and Three-Valued NULL guards behave in real time:

SQL · WASM18 lines
-- Dataset: ecommerce | Live Verification, 3VL Guard & SARGable Plan Audit (execution-models-volcano-vectorized)
SELECT
  c.customer_id,
  c.name AS customer_name,
  c.tier,
  c.country,
  COUNT(o.order_id) AS completed_orders,
  ROUND(COALESCE(SUM(o.total_cents), 0) / 100.0, 2) AS verified_spend_usd,
  ROUND(
    AVG(COALESCE(SUM(o.total_cents), 0)) OVER (PARTITION BY c.tier) / 100.0,
    2
  ) AS tier_peer_avg_spend_usd
FROM customers AS c
LEFT JOIN orders AS o
  ON o.customer_id = c.customer_id
  AND o.status = 'completed'
GROUP BY c.customer_id, c.name, c.tier, c.country
ORDER BY verified_spend_usd DESC, c.customer_id ASC;

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

Production Pitfall & SEV-1 Outage Pattern

The most common production failure in Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT 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 Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT — Core Relational Invariant recall

Which statement accurately characterizes the primary mechanism and guarantee of Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT?

Interactive 3-Step Guided SQL Lab & Step-by-Step Table Visualizer (PostgreSQL 18 WASM & SQLite 3 WASM) 3 Guided Steps + Progressive Hints

Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT — Interactive Guided SQL Lab

Comparing classic pull-based Volcano tuple-at-a-time virtual calls against cache-resident 1024-tuple column vectors and LLVM JIT expression compilation.

⏱ Target Time: O(N) scan / O(log_B N) indexed 💾 Auxiliary Space: O(1) streaming tuple state 🧭 Pattern: Physical Join Algorithms & Execution Pipelines 🗄️ Dataset: ecommerce
01 Phase 1 · Base Relation & SARGable Predicate
Base Relation Scan & SARGable Filter (ecommerce)
Establish the base relation scan in ecommerce for Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT with a SARGable predicate and explicit Three-Valued Logic NULL handling.
Run or edit query.sql to inspect the base table tuples, verify SARGable index filtering in the WHERE clause, and step through the live Table Visualizer.
💡 Progressive SQL Hint (Step 1)
SELECT order_id, customer_id, status, ROUND(total_cents / 100.0, 2) AS total_usd, COALESCE(discount_code, 'NONE') AS promo_code, created_at FROM orders WHERE status = 'completed' AND total_cents >= 30000 ORDER BY total_cents DESC LIMIT 10;
02 Phase 2 · Relational Join, Aggregation & 3VL Guard
Relational Join, Grouping & NULL-Safe Aggregation
Combine normalized tables via explicit JOIN conditions and fold group buckets or window partitions without losing NULL boundary rows.
Run or refine the Step 2 relational join and aggregation query in query.sql, then click 🔍 Step Clauses to inspect each intermediate table.
💡 Progressive SQL Hint (Step 2)
-- Dataset: ecommerce | Live Verification, 3VL Guard & SARGable Plan Audit (execution-models-volcano-vectorized)
SELECT
  c.customer_id,
  c.name AS customer_name,
  c.tier,
  c.country,
  COUNT(o.order_id) AS completed_orders,
  ROUND(COALESCE(SUM(o.total_cents), 0) / 100.0, 2) AS verified_spend_usd,
  ROUND(
    AVG(COALESCE(SUM(o.total_cents), 0)) OVER (PARTITION BY c.tier) / 100.0,
    2
  ) AS tier_peer_avg_spend_usd
FROM customers AS c
LEFT JOIN orders AS o
  ON o.customer_id = c.customer_id
  AND o.status = 'completed'
GROUP BY c.customer_id, c.name, c.tier, c.country
ORDER BY verified_spend_usd DESC, c.customer_id ASC;
03 Phase 3 · Production Query & Plan Verification
Production Query & Execution Plan Verification (Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT)
Verify final column projections, ordering, and physical B+Tree access paths via EXPLAIN QUERY PLAN and automated relational assertions.
Execute the complete production query in query.sql and click ✓ Check SQL Assertions to verify schema alignment, row cardinality, and tuple equivalence.
💡 Progressive SQL Hint (Step 3)
-- Dataset: ecommerce | Composite Index Seek (idx_orders_customer_status) & SARGable Plan
SELECT
  o.order_id,
  o.customer_id,
  c.name AS customer_name,
  o.status,
  o.created_at,
  ROUND(o.total_cents / 100.0, 2) AS total_usd
FROM orders AS o
INNER JOIN customers AS c
  ON c.customer_id = o.customer_id
WHERE o.status = 'completed'
  AND o.created_at >= '2025-02-01'
ORDER BY o.created_at DESC, o.order_id DESC
LIMIT 10;

Key Takeaways

Execution Models: Volcano Iterator (Next) vs Vectorized Batches vs LLVM JIT (execution-models-volcano-vectorized): Comparing classic pull-based Volcano tuple-at-a-time virtual calls against cache-resident 1024-tuple column vectors and LLVM JIT expression compilation.
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