SQLiteGraph
Embedded graph database with dual backend architecture.
Positioning: Single-binary embedded database (no server). Persistent storage with atomic batch commits. Graph algorithms + HNSW vector search in one engine. SQLite: stable, mature, excellent for adjacency queries. V3: high-performance, unlimited scale, faster for bulk traversals. See benchmarks below.
Backends
| Feature | SQLite | Native V3 |
|---|---|---|
| Status | Stable | Beta |
| Storage | .db file |
.graph file |
| Max nodes | Unlimited | Unlimited |
| Graph algorithms | 35+ | 35+ |
| HNSW vectors | Yes | Yes |
| Pub/Sub | Yes | Yes |
Benchmarks
See BENCHMARK_REPORT.md for detailed comparisons.
Quick Summary:
- Point lookup: V3 ~3-4× faster
- Adjacency fetch: SQLite ~20× faster (optimized prepared statements)
- Bulk traversal: V3 10-20× faster (contiguous storage)
Run benchmarks yourself:
See examples/ for reproducible performance tests.
Quick Start
[]
# SQLite backend (default)
= "2.0"
# OR Native V3 backend (faster traversals)
= { = "2.0", = ["native-v3"] }
use ;
use SqliteGraphBackend;
CLI
# Query (read-only by default)
# Algorithms
Ecosystem
Tools built on SQLiteGraph:
| Tool | Purpose | Repository | crates.io |
|---|---|---|---|
| Magellan | Code graph indexing, symbol navigation | github.com/oldnordic/magellan | crates.io/crates/magellan |
| llmgrep | Semantic code search | github.com/oldnordic/llmgrep | crates.io/crates/llmgrep |
| Mirage | CFG analysis, path enumeration | github.com/oldnordic/mirage | crates.io/crates/mirage-analyzer |
| splice | Precision code editing | github.com/oldnordic/splice | crates.io/crates/splice |
Documentation
- Architecture - System design
- Manual - API guide
- Algorithms - 35 graph algorithms
- Changelog - Version history
License
GPL-3.0-or-later