How a graph database works vs joins
A relational database re-derives relationships with joins at query time; a graph database stores them as structure and walks them. When each one wins.
Explore a topic
Engineering
How vector search works: HNSW explained
Embeddings turn meaning into geometry. A plain-language walk through similarity metrics, why brute force dies at scale, HNSW, and what quantization costs.
Window functions, correlated subqueries
OriginChainDB's SQL surface now has ROW_NUMBER, RANK, DENSE_RANK, LAG, LEAD and aggregate OVER, plus correlated EXISTS, IN and scalar subqueries.
Automatic Idempotency-Key in the SDK
An implementation note on automatic Idempotency-Key headers, bounded deduplication caches and retry behaviour. Check the SDK version and endpoint contract.
Write backpressure: 429 + Retry-After
OriginChainDB refuses overload with HTTP 429 and a Retry-After computed from the token bucket's refill schedule. The per-API-key limits, and retry code.
OpenAPI spec and the AI coding loop
An OpenAPI spec is what a coding agent reads to generate a client for your API. Ours is vanilla OpenAPI 3.1, one bearer scheme, published at /openapi.json.