Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure

1. First-Principles Mental Model & Relational Mechanics

Every SQL statement in Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure compiles down to a deterministic tree of relational algebra operators acting on physical pages in the buffer pool. At the logical layer, Formalizing data invariants with functional dependencies, computing attribute closure X+, and proving whether a decomposition is lossless-join. 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 functional-dependencies-keys within Relational Data Modeling & Normalization (1NF to BCNF/5NF), 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.

2. Database Table Schema, Execution Pipeline & Visual Architecture

Tracing how Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure 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 (functional-dependency): 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 (candidate-key): 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 (armstrong-axioms): 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.

3. Interactive Table-Level & Storage Engine Simulator

Use the interactive simulator below to step through Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure at the tuple and page level. Observe how input rows, intermediate filter/join states, NULL badges, and physical page reads evolve at each step:

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:

-- Dataset: ecommerce | Functional Dependency & 3NF/BCNF Normalization Verification
SELECT
  o.order_id,
  o.customer_id,
  c.email AS canonical_customer_email,
  COUNT(oi.order_item_id) AS distinct_line_items,
  SUM(oi.quantity * oi.unit_price_cents) AS computed_line_total_cents,
  o.total_cents AS header_total_cents,
  CASE
    WHEN SUM(oi.quantity * oi.unit_price_cents) = o.total_cents THEN 'NORMALIZED_CONSISTENT'
    ELSE 'PROMO_OR_ADJUSTMENT_DELTA'
  END AS normalization_audit
FROM orders AS o
INNER JOIN customers AS c
  ON c.customer_id = o.customer_id
INNER JOIN order_items AS oi
  ON oi.order_id = o.order_id
GROUP BY o.order_id, o.customer_id, c.email, o.total_cents
ORDER BY o.order_id ASC;

5. Cross-Engine Dialect & Cost Comparison Matrix

While the SQL ISO standard defines the logical behavior of Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure, production storage engines differ in how they execute, lock, and index the underlying tuples:

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

To truly understand how a database engine executes Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure 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:

#include <iostream>
#include <vector>
#include <cstdint>
#include <string>
#include <algorithm>

// Database Engine Kernel Operator: Functional Dependencies (X → Y), Superkeys, Candidate Keys & Closure
struct TuplePageStats {
    uint64_t tuples_examined;
    uint64_t tuples_emitted;
    uint64_t pages_pinned;
};

inline TuplePageStats eval_functional_dependencies_keys(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_functional_dependencies_keys(relation, 50);
    std::cout << "[Engine Operator: functional-dependencies-keys] examined=" << res.tuples_examined
              << " emitted=" << res.tuples_emitted
              << " pages=" << res.pages_pinned << "\n";
    return 0;
}

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

• 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\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.