Indexes

Problem

What becomes confusing, fragile, or impossible without understanding indexes? This lesson answers that through explanation, a worked example, two runnable exercises, and a reference solution. No teacher-supplied worksheet is required.

WebAssembly brought a portable low-level compilation target to the browser; SQLite brought a mature relational engine into one embedded file.

Concept explanation

Indexes belongs to “SQLite inside the browser”. indexes must be connected to layer below by tracing representation, ownership, control, and failure. SQLite stores relational data in pages and chooses access using schema, indexes, statistics, and planner.

For indexes, trace concrete input, state transition, output, and failure through an explicit low-level or relational boundary where memory, crossings, schemas, queries, and persistence costs can be measured.

JavaScript calls into a WASM module whose linear memory and host imports form an explicit boundary. SQLite executes queries over pages, indexes, and a planner. Apply that model to supplied normal, boundary, and failure cases; each case below names its input and expected evidence.

Example bank

Compare normal, boundary, failure, and cross-layer cases. Predict each observation before revealing the explanation.

Worked example

Start from supplied lab.sql. Focus: Trace indexes end-to-end while running: Create notes table, insert 10k rows, query by indexed and unindexed columns.

1. Run: sqlite3 :memory: < lab.sql
2. Save baseline evidence. Inspect module exports, memory, JS/WASM crossings, schemas, indexes, transactions, query plans, OPFS files, and recovery.
3. Boundary case: At every indexes boundary, label owner and representation during: Wrap writes in transaction and compare timing.
4. Failure case: Locate first layer where evidence diverges during: Violate constraint and prove atomic rollback.

RESULT
Trace explains EXPLAIN QUERY PLAN shows scan versus index; transaction changes cost; failed transaction leaves invariant true. without skipping any conversion, queue, process, protocol, or storage boundary. Starter-level baseline: Query plan reports use of observations_topic; final query prints baseline.

Starter material

Create lab.sql, paste this exact content, then run the command below.

CREATE TABLE observations (id INTEGER PRIMARY KEY, topic TEXT NOT NULL, result TEXT NOT NULL);
INSERT INTO observations(topic, result) VALUES ("indexes", 'baseline');
CREATE INDEX observations_topic ON observations(topic);
EXPLAIN QUERY PLAN SELECT result FROM observations WHERE topic = "indexes";
SELECT result FROM observations WHERE topic = "indexes";

STOP / CLEANUPIn-memory SQLite exits after script. Stop any local web server with Ctrl+C.

Independent exercise

Remove one abstraction: indexes

1. Create second case from blank file: At every indexes boundary, label owner and representation during: Wrap writes in transaction and compare timing.
2. Then create controlled failure: Locate first layer where evidence diverges during: Violate constraint and prove atomic rollback.
3. Use WASM debugger · SQLite CLI · EXPLAIN QUERY PLAN · OPFS to prove behavior, then repair controlled failure.
4. Compare result against supplied acceptance checks and reference approach before marking complete.

Expected result

• Trace explains EXPLAIN QUERY PLAN shows scan versus index; transaction changes cost; failed transaction leaves invariant true. without skipping any conversion, queue, process, protocol, or storage boundary.
• Query plan reports use of observations_topic; final query prints baseline.
• Controlled indexes failure produces captured evidence; repair restores stated invariant without hiding error.

Hints

Solution

Attempt both exercises before opening reference approach.