BLOG

The frontier database

14/11/2026

Published

A database spends most of its life waiting. The morning rush arrives, the month-end report runs, and in between it sits there holding memory in case somebody needs it. For years we rented that waiting by the gigabyte: memory reserved at start-up, on servers sized for a peak that came on the first of the month.

So we built Galactus DB, and then spent every release taking work out of it. Somewhere along the way "graph database" stopped covering what it does. We call it the frontier database, and this post is what we mean by that.

What frontier means

The frontier is the point where a query takes as long as the work takes: follow this pointer, read that page, send the answer. Past it, the limits are the machine's and no longer the software's.

We can say where that point is, because we measure it on every release. On Galactus DB 2.4.3:

The full story of how the disk caught up with memory is in Nearing the theoretical limit.

Graphs, tables and vectors

Galactus DB began as a graph database and still is one: Cypher over Bolt, with the drivers you already use. But a great deal of what hangs off a graph is rows. A customer has orders. An account has entries. A sensor has readings. The usual answer is a second database for the rows and a nightly job to keep the two in step.

In Galactus DB the rows live on the node they belong to:

MATCH (c:Customer {id: 1})
SET c.orders = TABLE (
  id        INTEGER PRIMARY KEY,
  placed_at LOCAL DATETIME NOT NULL,
  sku       STRING NOT NULL,
  amount    DECIMAL(12, 2),
  INDEX by_sku (sku, placed_at)
);

// What did this customer's friends order most recently?
MATCH (:Customer {id: 1})-[:KNOWS]->(f:Customer)
CALL (f) SQL {
  SELECT sku, placed_at, amount FROM f.orders
  ORDER BY placed_at DESC LIMIT 3
}
RETURN f.name, sku, placed_at, amount;

That is SQL with joins, window functions, recursive CTEs and MERGE, in the same transaction as the graph around it. It gives the answers SQLite gives, and we know because we run thousands of generated queries through both and compare them.

It is light on its feet as well. An order of five columns takes 63 bytes on disk as a table row, against 85 as a node of its own. On one node's 200,000-row table, count(*) takes 0.02 ms and a one-row UPDATE by key 0.05 ms.

Add the vector, full-text and spatial indexes, and one query can find a starting point by meaning, follow its relationships and read the rows at the far end. Graphs, SQL tables and vector search share one server, change in one transaction and go into one backup.

What legacy costs

We use "legacy" for a pattern, and you will know it from the invoice:

Nobody chose that. It accumulated, one sensible decision at a time, and now it is simply what a database costs. Galactus DB takes memory as the data needs it, inside one budget you set, and everything on that list is already in the 13 MB image.

Meeting a new database

The safe choice has always been the database everyone else already runs. So here is what we do to make a new one safe to choose:

Trying it takes less time than this post did:

docker run -d -p 7687:7687 -e GDB_INITIAL_PASSWORD=<12 or more characters> ianknowles/galactus-db:2.4.3

Community is free for any use, production included, with no account and no licence key. If it takes you longer than a cup of tea to have it answering queries, tell us. We will want to know what kept you.

How we measured