GeorgeCurtis

7 ms·

1.
by GeorgeCurtis 3mo ago
yes, and yes. https://docs.helix-db.com/database/multi-tenancy
2.
by GeorgeCurtis 3mo ago
No, you can run it in-memory or on-disk too
3.
by GeorgeCurtis 3mo ago
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
4.
by GeorgeCurtis 3mo ago
puppy graph is not open source
5.
by GeorgeCurtis 3mo ago
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 w
6.
by GeorgeCurtis 3mo ago
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
7.
by GeorgeCurtis 3mo ago
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.
8.
by GeorgeCurtis 3mo ago
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 licen
9.
by GeorgeCurtis 3mo ago
Sure! You can email me personally at george@helix-db.com
10.
by GeorgeCurtis 3mo ago
We plan on launching end of month.
11.
by GeorgeCurtis 3mo ago
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
12.
by GeorgeCurtis 3mo ago
yooo this is awesome. Didn't even realise :)
13.
by GeorgeCurtis 3mo ago
This sounds like a perfect usecase. Would love to learn more and see if we can help! email us: founders@helix-db.com
14.
by GeorgeCurtis 3mo ago
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 operation
15.
by GeorgeCurtis 3mo ago
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
16.
by GeorgeCurtis 3mo ago
Yes you can put vectors, full text data, secondary and range indexes on both nodes and edges.
17.
by GeorgeCurtis 3mo ago
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
18.
by GeorgeCurtis 3mo ago
In prod we see p99’s of <10ms ms for warm queries and around 50ms per hop for cold queries.
19.
Show HN: HelixDB – A graph database built on object storage(github.com)
159 points by GeorgeCurtis 3mo ago|46 comments
20.
by GeorgeCurtis 1y ago
How does this handle bot detection?
21.
by GeorgeCurtis 1y ago
They were two viral web apps that blew up on twitter. They had approx 25,000 users at their peak. Originally they were built on Postgres, so we helped move over to us. Their graph had about 50,000 user nodes and 25 million edges (follower c
22.
by GeorgeCurtis 1y ago
Thanks for the support :) We're currently working on benchmarks so nothing exact on Kuzu right now with regards to performance. We've had quite a few requests for benchmark comparisons against different databases, so they should t
23.
by GeorgeCurtis 1y ago
We built this to help people make software that was previously harder to make. If people want to build software and share it with everyone, they are welcome to do that for free , and if someone wants to close-source their project to make l
24.
by GeorgeCurtis 1y ago
Thanks for clearing up some of these points. Really pleased the post has reached the industry leaders, and I genuinely appreciate your response :) With regards to the prefiltering, I was referring to filtering during the neighbor search in
25.
by GeorgeCurtis 1y ago
I was just going off of what we've heard from users and people in the space, I admit that "general consensus might've been the wrong terminology.
26.
by GeorgeCurtis 1y ago
I've only just seen this! Thanks so much for the response, would definitely love to chat with you guys. You're definitely right btw, those weren't concrete benchmarks and I'm excited to see how we compare now :)
27.
by GeorgeCurtis 1y ago
We're working on precise benchmarks, but we are much faster than surreal is right now. Chroma is a standalone vector DB so harder to compare exactly, but for vectors we're on par with them for insertions and reads. Again, working
28.
by GeorgeCurtis 1y ago
Thanks for the kind words:) I like what GQL has done. We've definitely taken inspiration from their methodologies in building our own language.
29.
by GeorgeCurtis 1y ago
It’s definitely on our roadmap, but not a priority because no one using us needs it. Is this something that would be useful to you?
30.
by GeorgeCurtis 1y ago
I'll add memgraph to our benchmarking list! Make sure you join our discord. would love to help in any way we can and hear about any issues you run in to

More ›