LatticeDB: A SQLite-like embedded graph database with vector and full-text search
LatticeDB – Like SQLite but for graph databases
LatticeDB is an embedded, single-file property-graph database that combines graph traversal, HNSW vector similarity, and BM25 full-text search in one query layer. It targets local-first applications like Graph RAG, agent memory, and knowledge tools, offering zero-config operation and durable event streams. Benchmarks show sub-microsecond node lookups, 0.83 ms vector search at 1M vectors with 100% recall, and up to 2,800x faster graph traversals than SQLite's recursive CTEs.
LatticeDB at 1M achieves 0.83 ms mean with 100% recall@10 — faster than FAISS single-threaded HNSW and competitive with Weaviate and Qdrant server-based systems (which add network overhead in practice).
- k9294
I'm a big fan of SQLite embedded nature, which allows for chaining multiple SQL calls with near-zero latency.
I'm currently building a personal knowledge graph server a mix of Notion's custom entities via JSON schema and Obsidian markdown+backlinked references. It's working well, but I suspect your product might be a better fit.
I do have one question regarding permissions: how would you recommend modeling a hierarchical access system in a graph database? Specifically, if a user is granted access to a document, they should automatically have access to all its child documents within that workspace. Is there a standard way to model this 'subtree' permission logic, or perhaps a more efficient approach you'd suggest?
Really impressed with the product good luck with it!
- cjlm
Nice, I’ll get it added to gdb-engines.com
- itissid
Does it have something like litestream to backit up for specific production usecases (i.e. a single webserver is enough and downtime of a few mins is tolerable)?
- petervandijck
Congrats this is really cool and love the examples
- tomComb
I wonder about mapping RDF data (like Wikidata) to this. I guess the RDF predicate becomes the edge in your node-edge style of graph.