Skip to content

Comment on Show HN: HelixDB – A graph database built on object storageparent

Comments

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.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.