Columnar tables
DEFINE TABLE ... STORE COLUMN keeps a columnar projection beside the row authority — per-chunk statistics prune analytical reads, and a GROUP BY on the partition key folds each lane and merges.
DEFINE TABLE events (seq int, kind string) STORE COLUMN;
DEFINE TABLE events (seq int, kind string) STORE COLUMN PARTITIONS 4 BY kind;
DEFINE SERIES readings RETAIN 30d TIME at STORE COLUMN PARTITIONS 4 BY sensor;
A table stores its records as versioned rows. Saying STORE COLUMN beside the
definition adds a columnar projection of the same records, written inside
the record's own commit batch — every chunk of the projection lands in the
same atomic write as the rows it projects, and a statement that refuses refuses
both. The row stays the authority: a read served through the projection names
candidates, and the row at the snapshot confirms each one, so a columnar table
answers exactly what the row store answers — the plan and the answer's note say
which path it took and how many chunks were examined against skipped.
What the projection buys
Analytical reads over many rows skip what they do not need. Every sealed chunk
carries min/max bounds and a bloom filter as write-path invariants, so a
selective predicate prunes whole chunks without decoding them: measured over
1 048 576 rows, a top-1% range aggregate answers in 75 ms against the row
walk's 2.7 s, skipping 126 of 128 chunks. A GROUP BY on the partition
key folds each partition's lanes and merges the partials — the plan reports
lanes: n.
The declaration
STORE ROWis the default, and the wordINFO FOR TABLEandBACKUP SCRIPTrender — a script that never says the word reads back with it said.- The kind is immutable after define.
ALTER TABLE … STORE …refusesStorageKindImmutable: the migration between layouts isDROPandDEFINE, not a clause. PARTITIONS n BY fieldroutes each row's projection to one ofnlanes by the hash of the key field's value; a row whose key isnullor absent routes to partition 0. The count and key are definition-time constants.- Only record-shaped kinds take the clause: a plain table and a series. An
edge table, queue, topic or space refuses
StorageKindOnKind.
The stated limits
Each is deliberate rather than implicit:
- Feeds refuse on a columnar table (
FeedOnColumnar) — the feed captures from the row authority, which a columnar table fully retains, so the composition is designed but not built yet. - Single-row updates cost a chunk copy-on-write. Columnar is not free for OLTP-shaped writes: measured at one shape (100 000 rows in one commit), the columnar write costs 2.11× the row write. The tax is published, not hidden.
- Version and point reads are always row-path — exact, never pruned. Series reads are row-path at this milestone too; the projection holds the points, the row serves the reads.
- Projection vacuum rides the store's version reclamation — no separate merge job ships yet.