Article may be outdated

This article is 71 days old. Some details may have changed since publication.

Hacker News·4 min read·hard

Slater – Low-memory graphdb designed for read-heavy graphs

R
rickkjp
Slater – Low-memory graphdb designed for read-heavy graphs
✦AI Summary

Slater is a new graph database designed to handle massive datasets by paging data from disk rather than requiring the entire graph to reside in RAM. This allows users to query hundreds of millions of nodes using only a small, fixed amount of memory, decoupling performance from hardware costs.

Why it matters

By lowering the memory requirements for graph databases, Slater makes complex data relationship analysis more accessible and cost-effective for developers.

✦Dive DeeperCreate a free account to unlock

Current version: v0.24.1 — all releases .

In one line: Slater serves graphs that don't fit in memory — hundreds of millions of nodes and billions of edges in low hundreds of MB of RAM — over standard Bolt , so any neo4j driver just works, with disk-native vector search sitting next to the graph, and it takes live, durable writes without giving that up. Resident memory is set by a cache budget you choose, not by the size of the graph.

Continue reading on Headlinne

Create a free account to read the full article.

Read full article →
technologybusiness
✦

Get smarter about the news

Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.

Create free account

Already have an account? Sign in