SQL SQL In Depth
0%
lesson select projection execution-order

SELECT Projection, Expressions, Aliases & Logical Execution Order

7 min read Module 1.1: The Relational Model, Tables & SELECT Foundations Updated Oct 26, 2026
📄 Cheat Sheet
SELECT Projection, Expressions, Aliases & Logical Execution Order — Database Systems & SQL Architecture Lecture
CMU Database Group (Andy Pavlo) SELECT Projection, Expressions, Aliases & Logical Execution Order — Database Systems & SQL Architecture Lecture Watch on YouTube ↗

Builds first-principles mastery of SELECT Projection, Expressions, Aliases & Logical Execution Order with concrete query execution trees, storage page layouts, and production tuning trade-offs.

0:00 / 4:33

1. First-Principles Mental Model & Relational Mechanics

Every SQL statement in SELECT Projection, Expressions, Aliases & Logical Execution Order compiles down to a deterministic tree of relational algebra operators acting on physical pages in the buffer pool. At the logical layer, How the SQL engine binds FROM before evaluating SELECT projections, why column aliases fail inside WHERE, and expression evaluation pipelines. 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 select-projection-aliases 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 — SELECT Projection, Expressions, Aliases & Logical Execution Order

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 SELECT Projection, Expressions, Aliases & Logical Execution Order 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 select, and πA\pi_{A} projects the target attribute schema without violating domain constraints.

2. Database Table Schema, Execution Pipeline & Visual Architecture

Tracing how SELECT Projection, Expressions, Aliases & Logical Execution Order 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 (select): 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 (projection): 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 (execution-order): 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.
SELECT Projection, Expressions, Aliases & Logical E... — Relational Table & Key Constraint Diagram Module M01 · PK/FK Referential Join · 3VL Predicate Selection (select / projection) 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 SELECT Projection, Expressions, Aliases & Logical Execution Order at the tuple and page level. Observe how input rows, intermediate filter/join states, NULL badges, and physical page reads evolve at each step:

Logical Query Execution Pipeline (FROM → WHERE → SELECT → ORDER BY → LIMIT)
Clause Pipeline

Step through a multi-clause SQL query at the table level. Watch rows flow from the base table through predicate filtering, expression projection, sorting, and Top-N pagination.

Step 1 / 8
Custom Input:
Timeline

Invariant & State

Relation initialized with 6 tuples across schema (order_id, customer, status, total_cents, created_at) — preset: Paid Orders ≥ $120 Ordered by Total DESC LIMIT 3.
🔗 Live Pointer & State Transition Graph — Logical Query Execution Pipeline (FROM → WHERE → SELECT → ORDER BY → LIMIT) Active Pointer Jump/Transition Matched/Optimal
Tuple # 101:p… [0] 102:p… [1] 103:p… [2] 104:r… [3] 105:p… [4] 106:p… [5]
📋 Logical Query Execution Pipeline (FROM → WHERE → SELECT → ORDER BY → LIMIT) — Initial Relation State 6 row(s)
order_idcustomerstatustotal_centscreated_atState
101Ada Lovelacepaid185002026-03-01CURSOR START
102Alan Turingpending92002026-03-02
103Grace Hopperpaid340002026-03-02
104Edsger Dijkstrarefunded210002026-03-03
105Barbara Liskovpaid275002026-03-04
106Donald Knuthpaid129002026-03-05
[0]101:paidTuple #0
[1]102:pending
[2]103:paid
[3]104:refunded
[4]105:paid
[5]106:paid
Input Tuples
6
Columns
5
Preset Mode
orders
Pipeline Stage
1. Initial Scan
[Step 1] Initialized Logical Query Execution Pipeline (FROM → WHERE → SELECT → ORDER BY → LIMIT) (Paid Orders ≥ $120 Ordered by Total DESC LIMIT 3) with 6 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 · WASM11 lines
-- Dataset: ecommerce | Logical Execution Order: FROM -> WHERE -> GROUP BY -> HAVING -> SELECT -> ORDER BY
SELECT
  o.status AS order_state,
  COUNT(*) AS order_count,
  ROUND(SUM(o.total_cents) / 100.0, 2) AS gross_revenue_usd,
  ROUND(AVG(o.total_cents) / 100.0, 2) AS avg_order_usd
FROM orders AS o
WHERE o.total_cents >= 15000
GROUP BY o.status
HAVING COUNT(*) >= 1
ORDER BY gross_revenue_usd DESC;

5. Cross-Engine Dialect & Cost Comparison Matrix

While the SQL ISO standard defines the logical behavior of SELECT Projection, Expressions, Aliases & Logical Execution Order, 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 SELECT Projection, Expressions, Aliases & Logical Execution Order
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 SELECT Projection, Expressions, Aliases & Logical Execution Order 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 (select-projection-aliases)
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 SELECT Projection, Expressions, Aliases & Logical Execution Order 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 SELECT Projection, Expressions, Aliases & Logical Execution Order — Core Relational Invariant recall

Which statement accurately characterizes the primary mechanism and guarantee of SELECT Projection, Expressions, Aliases & Logical Execution Order?

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

SELECT Projection, Expressions, Aliases & Logical Execution Order — Interactive Guided SQL Lab

How the SQL engine binds FROM before evaluating SELECT projections, why column aliases fail inside WHERE, and expression evaluation pipelines.

⏱ Target Time: O(N) scan / O(log_B N) indexed 💾 Auxiliary Space: O(1) streaming tuple state 🧭 Pattern: The Relational Model, Tables & SELECT Foundations 🗄️ Dataset: ecommerce
01 Phase 1 · Base Relation & SARGable Predicate
Base Relation Scan & SARGable Filter (ecommerce)
Establish the base relation scan in ecommerce for SELECT Projection, Expressions, Aliases & Logical Execution Order 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 (select-projection-aliases)
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 (SELECT Projection, Expressions, Aliases & Logical Execution Order)
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 | Logical Execution Order: FROM -> WHERE -> GROUP BY -> HAVING -> SELECT -> ORDER BY
SELECT
  o.status AS order_state,
  COUNT(*) AS order_count,
  ROUND(SUM(o.total_cents) / 100.0, 2) AS gross_revenue_usd,
  ROUND(AVG(o.total_cents) / 100.0, 2) AS avg_order_usd
FROM orders AS o
WHERE o.total_cents >= 15000
GROUP BY o.status
HAVING COUNT(*) >= 1
ORDER BY gross_revenue_usd DESC;

Key Takeaways

SELECT Projection, Expressions, Aliases & Logical Execution Order (select-projection-aliases): How the SQL engine binds FROM before evaluating SELECT projections, why column aliases fail inside WHERE, and expression evaluation pipelines.
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