I've been working on a graph database in Rust this year actually! I'd love to hear anything you can talk about wrt the query planner and/or how you decided to do cardinality estimation. I decided to go with an EAV graph which makes CE pretty complex, and it's been an interesting challenge to balance quality and speed and expressiveness in the query language
OLAP queries, deep multi-hops where latency is a priority.
As long as the sub-graph you're trying to hop is cached, then there's no problem or latency issues. However, if you need to do a deep hop query, where all those nodes and edges are in cold storage, each hop costs ~50ms. So a 10-hop would take ~0.5 seconds.
Again though, we find most people are using us for agentic workloads, so even this worst case scenario the LLMs make up the majority of the latency.
If your use case is OLAP based, please check it out PuppyGraph. It’s a graph query engine that sits on top of your Lakehouse (no ETL required). Our benchmark has shown consistently that 10-hop queries across billions of edges in <2 seconds. Our customers including some most data demanding companies like Coinbase, Datadog, Palo Alto Network, Netskope, AMD, etc.
It's not, its actually our prod db with direct user usage - we self host a large dgraph cluster. We have a very large number of people manage their car and car histories with us and host a full replica of the UK MOT Database.
We're fine with clickhouse and redshift for the OLAP work we do. I've been looking at ParaQuery lately if I really want to speed that up.
We’re just two young founders sharing what we’ve been building, so I’ll take the drive-by competitor plug as a compliment :)
Definitely a different focus though. Helix is OLTP, built for operational graph + vector workloads, especially apps/agent memory where low-latency traversals and writes are concerned.
can you host this yourself or do you need to use helix-cloud? the chat thing on the side seems to push me to helix-cloud but it looks like that starts at like $600/mo which is above my experimentation budget.
looking for a db for an agent memory application and i'd probably start with something that's just self-hosted / freeish. postgres is working ok but I want to start ingesting server and chat logs.
The feature scores are from a paper cited on the site. The ranking features are proprietary to dissuade gaming but are a blend of open public data across a number of different sources.
We’re 100% committed to going back to open-source on an Apache 2.0 license as soon as possible. In the meantime, you can continue to deploy us completely for free, however you like, using the compiled docker container.
For vector search we have warm and cold p99s of approx 20ms and 400ms respectively.
For FTS, warm and cold query p99s of approx 15ms and 250ms respectively.
tpuffer is a vector/fts database. Surreal is a bit of an "everything database".
We're a graph database with vector and FTS capabilities. Our vector and FTS benchmarks are comparable with tpuffer, but you would primarily use us for building whole applications, knowledge graphs, or AI memory/retrieval. Anything that is relationship intense.
Let me know if this properly answers your question
You can query HelixDB using JSON or directly in your programming language of choice by using our Rust, TypeScript, Go or Python SDKs.
We’ve found AI is very good at working with the SDKs and JSON itself to query, making the development experience much better than before: https://docs.helix-db.com/database/querying
I've been working on a graph database in Rust this year actually! I'd love to hear anything you can talk about wrt the query planner and/or how you decided to do cardinality estimation. I decided to go with an EAV graph which makes CE pretty complex, and it's been an interesting challenge to balance quality and speed and expressiveness in the query language
What kinds of graph shapes or query patterns do you feel are the worst case for object storage?
OLAP queries, deep multi-hops where latency is a priority.
As long as the sub-graph you're trying to hop is cached, then there's no problem or latency issues. However, if you need to do a deep hop query, where all those nodes and edges are in cold storage, each hop costs ~50ms. So a 10-hop would take ~0.5 seconds.
Again though, we find most people are using us for agentic workloads, so even this worst case scenario the LLMs make up the majority of the latency.
We've been having some issues with intermittent performance on multi hop queries.
What's your p99 like for multi hops?
In prod we see p99’s of <10ms ms for warm queries and around 50ms per hop for cold queries.
Hmmm... I'll get in touch. Got an email i can reach out to, there doesn't seem to be one listed on your website?
I'm more concerned about if the p99s stay consistent when things get spikey.
dgraph is fine otherwise...
Sure! You can email me personally at george@helix-db.com
If your use case is OLAP based, please check it out PuppyGraph. It’s a graph query engine that sits on top of your Lakehouse (no ETL required). Our benchmark has shown consistently that 10-hop queries across billions of edges in <2 seconds. Our customers including some most data demanding companies like Coinbase, Datadog, Palo Alto Network, Netskope, AMD, etc.
It's not, its actually our prod db with direct user usage - we self host a large dgraph cluster. We have a very large number of people manage their car and car histories with us and host a full replica of the UK MOT Database.
We're fine with clickhouse and redshift for the OLAP work we do. I've been looking at ParaQuery lately if I really want to speed that up.
This sounds like a perfect usecase. Would love to learn more and see if we can help!
email us: founders@helix-db.com
PuppyGraph is a good fit for OLAP for sure.
We’re just two young founders sharing what we’ve been building, so I’ll take the drive-by competitor plug as a compliment :)
Definitely a different focus though. Helix is OLTP, built for operational graph + vector workloads, especially apps/agent memory where low-latency traversals and writes are concerned.
And is open source.
where is puppygraph's source code?
puppy graph is not open source
congrats on the launch! site and docs look great.
can you host this yourself or do you need to use helix-cloud? the chat thing on the side seems to push me to helix-cloud but it looks like that starts at like $600/mo which is above my experimentation budget.
looking for a db for an agent memory application and i'd probably start with something that's just self-hosted / freeish. postgres is working ok but I want to start ingesting server and chat logs.
You can definitely host it for free locally for now.
We aim to launch our GA cloud at the end of this month, which will be much more affordable.
Why do you say "for now"?
Lapse of communication. For now as in you’ll be able to host it without reading the source code.
Soon you’ll be able to host it yourself AND have access to the source code
Currently #5 on gdb-engines.com - definitely worth a look.
How rankings are calculated? HelixDB has zero feature scores, unlike e.g. JanusGraph which is at #27 or Neo4j at #1.
The feature scores are from a paper cited on the site. The ranking features are proprietary to dissuade gaming but are a blend of open public data across a number of different sources.
yooo this is awesome. Didn't even realise :)
This seems like a great idea.
What reassurance can you offer devs that are hesitant to try a new data-store?
Can't imagine why they'd be hesitant, Helix is awesome, we've never had any data loss issues, and are completely ACID.
I'd encourage them to start a local instance with claude/codex to build a mini project and see what it's like.
Does it work only on S3?
Where's the source code for the database itself? Looks like the repo is just a client.
Congrats on the launch!
This was a TEMPORARY decision we made, and I wrote a bit about why we did this here: https://x.com/georgecurtiss/status/2060043184059912470
We’re 100% committed to going back to open-source on an Apache 2.0 license as soon as possible. In the meantime, you can continue to deploy us completely for free, however you like, using the compiled docker container.
Unfortunately it's not possible to read this without an X account.
Congrats on the launch George!
Looking forward to looking into the generalised AI memory layer when it comes out.
Are you ACID? And does this version have multi-tenancy?
does it support fts/vector on edges of the graph?
Yes you can put vectors, full text data, secondary and range indexes on both nodes and edges.
How does this compare vs. Turbopuffer?
We see comparable results for vectors and FTS.
For vector search we have warm and cold p99s of approx 20ms and 400ms respectively. For FTS, warm and cold query p99s of approx 15ms and 250ms respectively.
Both of these benchmarks were run on 1m docs.
when will the graph memory layer be available?
We plan on launching end of month.
congrats! how does this compare to turbopuffer, surreal or other multi-model ones built on object storage or not
tpuffer is a vector/fts database. Surreal is a bit of an "everything database".
We're a graph database with vector and FTS capabilities. Our vector and FTS benchmarks are comparable with tpuffer, but you would primarily use us for building whole applications, knowledge graphs, or AI memory/retrieval. Anything that is relationship intense.
Let me know if this properly answers your question
it does, think I misunderstood your value prop. best of luck -definitely a real usecase.
what language does this support? cypher/gremlin?
We don't support cypher or gremlin. We can
You can query HelixDB using JSON or directly in your programming language of choice by using our Rust, TypeScript, Go or Python SDKs. We’ve found AI is very good at working with the SDKs and JSON itself to query, making the development experience much better than before: https://docs.helix-db.com/database/querying
bellissimo