Notes
Notes
Short, systems-oriented writing on durable memory, versioning, and reproducible search.
- What comes after InstantDB? →
Compare self-hosted Instant with Datahike's thin, replicated and embedded clients, including permissions, optimistic writes, history and operating costs.
- Serialization considered boring →
Why Datahike's serializer is plain CBOR: a standard format at the speed of the fastest private ones, readers in other languages, and reads into stored values without decoding them.
- Data governance in versioned systems →
How purge, garbage collection and access control work across Datahike, including the storage layers they do not cover.
- Branches as values, merges as queries →
How Datahike creates branches with a small set of konserve writes and uses multi-source Datalog to compare and merge them.
- Datahike speaks PostgreSQL →
How the pg-datahike beta exposes Datahike through the PostgreSQL wire protocol for psql, migrations and supported ORM workflows.
- Anomaly detection inside the database →
Why Stratum runs isolation forests inside its SQL engine, what that removes from a pipeline, and where the current implementation fits.
- Versioned analytics for regulated industries →
How immutable snapshots, copy-on-write branches and coordinated versions can support reproducibility, scenario analysis and regulated-data workflows.
- Memory that collaborates →
How independent Datahike processes share immutable indexes through storage and join database values without a coordinating server.
- Stratum: SQL that branches →
How Stratum combines a JVM columnar SQL engine, SIMD execution and copy-on-write branches, with benchmarks and implementation trade-offs.
- Why we built Datahike →
A personal account of how functional values, persistent data structures and long-lived systems led to Datahike.
- Yggdrasil: branching protocols →
How Yggdrasil defines shared snapshot, branch, merge and history operations across different storage systems.
- The Git model for databases →
How copy-on-write storage, structural sharing and named branches apply version-control ideas to database values.
- Why search needs versioning →
How immutable vector and full-text indexes make retrieval reproducible across historical and branched states.