hydra-db/hydradb

HydraDB - fast graph database on object storage

View on GitHub ↗Jump to charts ↓Open shareable report →

Data as of . Signed-in members get hourly updates — create a free account.

Summary Information

Updated 29 minutes ago
Type:Server / PlatformCategory(s):NoSQL, Key-Value & CachesDatabases & Storage
Added to GitGenius on September 21st, 2026
Created on July 3rd, 2026
Open Issues & Pull Requests: 143 (+0)
GitHub issues: Enabled
Number of forks: 2,076
Total Stargazers: 5,903 (+9)
Total Subscribers: 8 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 1.1 hours
Mean response time: 3.7 days
90th percentile: 12.8 days
Tracked items: 15

How this project is maintained

Around half of the issues opened in the past year never receive a reply. 100% of open issues come from outside the core team, so the backlog reflects real-world use rather than internal planning. Almost all tracked open issues have seen activity in the last three months. Only 0% of issues opened in the past year have been closed.

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 54
New in 7 days: 6
Closed in 7 days: 0
Avg open age: 26 days
Stale 30+ days: 21
Stale 90+ days: 0

Recent activity

Opened in 7 days: 6
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

Sign in to see which issues are moving.
Sign in

Detailed Description

HydraDB is a distributed graph database written in Rust that stores data on object storage and executes queries on disaggregated compute nodes.

The tool addresses the challenge of building scalable graph databases by separating storage from compute. Graph data lives durably in S3-compatible object storage, while two independent compute roles handle different workloads: data nodes serve queries and apply mutations, while indexers build traversal indexes asynchronously in the background. Both roles maintain only disposable state locally, allowing them to scale or be replaced without moving the underlying graph. Queries run against pinned snapshots for consistency, and indexed traversal combines compiled sparse formats with visible write-ahead log overlays to ensure correctness even when indexes lag behind mutations.

Teams should consider this tool if they need a graph database that scales compute independently from storage, want to avoid moving large datasets when adding capacity, or prefer to keep their graph in object storage they already operate. The project offers Neo4j-compatible Bolt connectivity and an HTTP API with typed JSON and streaming NDJSON responses, making it accessible to applications built around standard graph clients. It includes graph-native query execution using property indexes, reverse adjacency, and GraphBLAS sparse traversal where beneficial. The tool is suitable for workloads where disaggregated architecture and object-store durability outweigh the complexity of managing separate data and indexer roles.

Development activity shows consistent attention to core infrastructure and operational concerns. The project maintains active work on the storage layer, query execution pipeline, and writer coordination mechanisms that underpin the disaggregated architecture. There is ongoing development of observability features including authentication, authorization, metrics, and tracing. The codebase receives regular updates to both the data node and indexer components, indicating sustained focus on keeping both roles functional and performant.