SQL SQL In Depth
0%
lesson running-total pareto named-window

Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses

7 min read Module 2.3: Window Functions & Analytical SQL Mastery Updated Oct 26, 2026
📄 Cheat Sheet
Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses — Database Systems & SQL Architecture Lecture
CMU Database Group (Andy Pavlo) Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses — Database Systems & SQL Architecture Lecture Watch on YouTube ↗

Builds first-principles mastery of Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses with concrete query execution trees, storage page layouts, and production tuning trade-offs.

0:00 / 4:24

1. First-Principles Mental Model & Relational Mechanics

Every SQL statement in Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses compiles down to a deterministic tree of relational algebra operators acting on physical pages in the buffer pool. At the logical layer, Computing monotonic cumulative sums, percentage-of-total shares, and reusing window specifications cleanly with the WINDOW w AS (...) clause. 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 running-totals-cumulative-shares within Window Functions & Analytical SQL Mastery, 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 — Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses

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 Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses 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 running-total, and πA\pi_{A} projects the target attribute schema without violating domain constraints.

2. Database Table Schema, Execution Pipeline & Visual Architecture

Tracing how Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses 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 (running-total): 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 (pareto): 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 (named-window): 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.
Running Totals, Pareto (80/20) Curves & Named WINDO... — Partitioned Table & Sliding Window Frame Module M06 · PARTITION BY dept_id ORDER BY salary_usd DESC · Frame Overlay (running-total) TABLE employees (Partitioned Tuple Stream) PK emp_id dept_id name salary_usd RANK / SUM OVER 2 2 (Storage) Vikramaditya $255,000 #1 · $255k 4 2 (Storage) Mateo Silva $215,000 #2 · $470k [CURRENT ROW] 5 2 (Storage) Aisha Patel $198,000 #3 · $668k 3 3 (Planner) Hannah L. $250,000 #1 · $250k (New Partition) WINDOW FRAME INVARIANTS • Preserves all N input tuples • Frame: UNBOUNDED PRECEDING AND CURRENT ROW • Peer ties handled by ROWS vs RANGE vs GROUPS • Evaluated at Step 5 (pre-SELECT)
flowchart LR A["1. FROM / JOIN (running-total)"] --> B["2. WHERE / 3VL Filter (pareto)"] B --> C["3. GROUP BY / WINDOW OVER"] C --> D["4. SELECT Projection & ORDER BY (named-window)"]

3. Interactive Table-Level & Storage Engine Simulator

Use the interactive simulator below to step through Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses at the tuple and page level. Observe how input rows, intermediate filter/join states, NULL badges, and physical page reads evolve at each step:

Window Function Partitioning, Ranking & Sliding Frame (ROWS vs RANGE) Stepper
OVER (PARTITION BY ...)

Visualize how PARTITION BY splits rows without collapsing them, how ROW_NUMBER / RANK / DENSE_RANK handle ties, and how ROWS vs RANGE frames slide across peer groups.

Step 1 / 7
Custom Input:
Timeline

Invariant & State

Relation initialized with 5 tuples across schema (row_id, dept, salary, row_num, rank_dense, frame_running_sum) — preset: ROWS vs RANGE Frame on Tied Order Timestamps.
🧭 Live Hash Ring & Bucket Probe Telemetry — Window Function Partitioning, Ranking & Sliding Frame (ROWS vs RANGE) Stepper Probe Collision/Swap Hit/Placed
1:$1… 2:$1… 3:$1… 4:$2… 5:$1… B[0] 1:$190k (Tuple #0) B[1] 2:$190k B[2] 3:$165k B[3] 4:$210k B[4] 5:$180k
📋 Window Function Partitioning, Ranking & Sliding Frame (ROWS vs RANGE) Stepper — Initial Relation State 5 row(s)
row_iddeptsalaryrow_numrank_denseframe_running_sumState
1Core DB$190k11 / 1$190kCURSOR START
2Core DB$190k21 / 1$380k (RANGE includes peer!)
3Core DB$165k33 / 2$545k
4Storage$210k11 / 1$210k
5Storage$180k22 / 2$390k
[0]1:$190kTuple #0
[1]2:$190k
[2]3:$165k
[3]4:$210k
[4]5:$180k
Input Tuples
5
Columns
6
Preset Mode
frames
Pipeline Stage
1. Initial Scan
[Step 1] Initialized Window Function Partitioning, Ranking & Sliding Frame (ROWS vs RANGE) Stepper (ROWS vs RANGE Frame on Tied Order Timestamps) 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 · WASM23 lines
-- Dataset: org_hr | Window Functions: Departmental Ranking, Peer Deltas & Running Totals
SELECT
  d.name AS dept_name,
  e.name AS employee_name,
  e.title,
  e.salary_usd,
  DENSE_RANK() OVER (
    PARTITION BY e.dept_id
    ORDER BY e.salary_usd DESC
  ) AS dept_salary_rank,
  LAG(e.salary_usd, 1, e.salary_usd) OVER (
    PARTITION BY e.dept_id
    ORDER BY e.salary_usd DESC
  ) - e.salary_usd AS gap_to_higher_peer_usd,
  SUM(e.salary_usd) OVER (
    PARTITION BY e.dept_id
    ORDER BY e.hired_at ASC
    ROWS BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW
  ) AS cumulative_dept_payroll_usd
FROM employees AS e
INNER JOIN departments AS d
  ON d.dept_id = e.dept_id
ORDER BY d.name ASC, dept_salary_rank ASC;

5. Cross-Engine Dialect & Cost Comparison Matrix

While the SQL ISO standard defines the logical behavior of Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses, 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 Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses
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 Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses 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 · WASM26 lines
-- Dataset: org_hr | Live Verification & Departmental Window Audit (running-totals-cumulative-shares)
WITH dept_rollup AS (
  SELECT
    d.dept_id,
    d.name AS dept_name,
    COUNT(e.emp_id) AS staff_count,
    ROUND(AVG(e.salary_usd), 0) AS avg_salary_usd,
    MAX(e.salary_usd) AS top_salary_usd,
    SUM(e.salary_usd) AS total_payroll_usd,
    d.annual_budget_usd
  FROM departments AS d
  LEFT JOIN employees AS e
    ON e.dept_id = d.dept_id
  GROUP BY d.dept_id, d.name, d.annual_budget_usd
)
SELECT
  dept_id,
  dept_name,
  staff_count,
  avg_salary_usd,
  top_salary_usd,
  total_payroll_usd,
  ROUND((total_payroll_usd * 100.0) / annual_budget_usd, 1) AS budget_utilization_pct
FROM dept_rollup
WHERE staff_count >= 1
ORDER BY total_payroll_usd DESC;

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

Production Pitfall & SEV-1 Outage Pattern

The most common production failure in Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses 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 Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses — Core Relational Invariant recall

Which statement accurately characterizes the primary mechanism and guarantee of Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses?

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

Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses — Interactive Guided SQL Lab

Computing monotonic cumulative sums, percentage-of-total shares, and reusing window specifications cleanly with the WINDOW w AS (...) clause.

⏱ Target Time: O(N) scan / O(log_B N) indexed 💾 Auxiliary Space: O(1) streaming tuple state 🧭 Pattern: Window Functions & Analytical SQL Mastery 🗄️ Dataset: org_hr
01 Phase 1 · Base Relation & SARGable Predicate
Base Relation Scan & SARGable Filter (org_hr)
Establish the base relation scan in org_hr for Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses 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 emp_id, name, title, dept_id, manager_id, salary_usd, hired_at FROM employees WHERE salary_usd >= 170000 ORDER BY salary_usd 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: org_hr | Live Verification & Departmental Window Audit (running-totals-cumulative-shares)
WITH dept_rollup AS (
  SELECT
    d.dept_id,
    d.name AS dept_name,
    COUNT(e.emp_id) AS staff_count,
    ROUND(AVG(e.salary_usd), 0) AS avg_salary_usd,
    MAX(e.salary_usd) AS top_salary_usd,
    SUM(e.salary_usd) AS total_payroll_usd,
    d.annual_budget_usd
  FROM departments AS d
  LEFT JOIN employees AS e
    ON e.dept_id = d.dept_id
  GROUP BY d.dept_id, d.name, d.annual_budget_usd
)
SELECT
  dept_id,
  dept_name,
  staff_count,
  avg_salary_usd,
  top_salary_usd,
  total_payroll_usd,
  ROUND((total_payroll_usd * 100.0) / annual_budget_usd, 1) AS budget_utilization_pct
FROM dept_rollup
WHERE staff_count >= 1
ORDER BY total_payroll_usd DESC;
03 Phase 3 · Production Query & Plan Verification
Production Query & Execution Plan Verification (Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses)
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: org_hr | Window Functions: Departmental Ranking, Peer Deltas & Running Totals
SELECT
  d.name AS dept_name,
  e.name AS employee_name,
  e.title,
  e.salary_usd,
  DENSE_RANK() OVER (
    PARTITION BY e.dept_id
    ORDER BY e.salary_usd DESC
  ) AS dept_salary_rank,
  LAG(e.salary_usd, 1, e.salary_usd) OVER (
    PARTITION BY e.dept_id
    ORDER BY e.salary_usd DESC
  ) - e.salary_usd AS gap_to_higher_peer_usd,
  SUM(e.salary_usd) OVER (
    PARTITION BY e.dept_id
    ORDER BY e.hired_at ASC
    ROWS BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW
  ) AS cumulative_dept_payroll_usd
FROM employees AS e
INNER JOIN departments AS d
  ON d.dept_id = e.dept_id
ORDER BY d.name ASC, dept_salary_rank ASC;

Key Takeaways

Running Totals, Pareto (80/20) Curves & Named WINDOW Clauses (running-totals-cumulative-shares): Computing monotonic cumulative sums, percentage-of-total shares, and reusing window specifications cleanly with the WINDOW w AS (...) clause.
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