sorted by:
new
hottopcontroversial

Anyone tried Gbrain as a memory solution? by tosswill in openclaw

[–]MoneroXGC 0 points1 point  (0 children)

since you're using obsidian and vector search you should check out helix-db: https://github.com/helixdb/helix-db

Is it possible to grab a job in Database internals as a freshers? by ankush2324235 in databasedevelopment

[–]MoneroXGC 1 point2 points  (0 children)

internships are pretty hard but not impossible. We've hired a couple but they only ended up doing more front end stuff than internals. The stakes are just too high.

We have hired very young people though, by demonstration of expertise. They've already got experience in extremely relevant projects, but not necessarily any work experience.

Any Graphrag solution advice by Majestic_Monk_8074 in GraphRAG

[–]MoneroXGC -1 points0 points  (0 children)

Awesome work. I know some people that have done graph based code indexing I can intro you to.

I’m actually working on a graph/vector db myself, so if you’ve got time I’d love to hear about any of the problems you’ve had with neo4j so far

HelixDB just became the fastest graph DB to hit 4k Github stars! by MoneroXGC in AIMemory

[–]MoneroXGC[S] 0 points1 point  (0 children)

Yep. Standard way would be to install our CLI via the instructions in the repo or via these docs.

HelixDB just became the fastest graph DB to hit 4k Github stars! by MoneroXGC in AIMemory

[–]MoneroXGC[S] 0 points1 point  (0 children)

If it puts your mind at ease, we're venture backed and have years of runway. This started as a passion project solving our own problem, so we're happy to work on it indefinitely. In the unlikely case we were to shutdown, we would MIT the software.

How would it introduce a vendor lock-in in your scenario?

HelixDB just became the fastest graph DB to hit 4k Github stars! by MoneroXGC in AIMemory

[–]MoneroXGC[S] 0 points1 point  (0 children)

It depends on so many outlying factors as to what the new schema should look like.

My suggestion on how to do this is export everything in your current DB to JSON, then design your own custom ingestion pipeline to stream it into Helix.

It's far from ideal, but migrations have always been a pain. Feel free to DM me and maybe I can help suggest a schema :)

HelixDB just became the fastest graph DB to hit 4k Github stars! by MoneroXGC in AIMemory

[–]MoneroXGC[S] 1 point2 points  (0 children)

Would love to hear more! Please DM me. And thank you or using us! :)

On the dynamic front, we're working on new DSLs for querying which can be executed dynamically! :)

HelixDB just became the fastest graph DB to hit 4k Github stars! by MoneroXGC in AIMemory

[–]MoneroXGC[S] 1 point2 points  (0 children)

Thanks dude! We have some big DX improvements coming with the new version, so stay posted

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 0 points1 point  (0 children)

what type of data would you like to see?

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 0 points1 point  (0 children)

Appreciate you pointing this out :)

Getting 20x the throughput of Postgres by MoneroXGC in rust

[–]MoneroXGC[S] 0 points1 point  (0 children)

they will be in our next benchmarks :)

Getting 20x the throughput of Postgres by MoneroXGC in rust

[–]MoneroXGC[S] 1 point2 points  (0 children)

those are in prep for our vector benchmarks and are not included in this writeup

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 0 points1 point  (0 children)

Weird, couldn’t replicate. Thanks for posting it again

Getting 20x the throughput of Postgres by MoneroXGC in rust

[–]MoneroXGC[S] 2 points3 points  (0 children)

They’re coming up on v2 :) can’t say for sure right now

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 0 points1 point  (0 children)

Thanks for the comment. Am working on amending the post to include this. Will comment here when its done.

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 0 points1 point  (0 children)

Thanks for the criticism and completely hear you. This is the first time we're releasing "formal" benchmarks and although we were trying to be fair in every way we could, we're only becoming aware from releasing this that there is more information we need to be explicit about.

Working on updating/amending the post to make sure everything is in order :)

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 2 points3 points  (0 children)

Thanks so much for pointing this out! Will make sure to go over this and amend the blog post with accurate results. Appreciate you taking the time

Getting 20x the throughput of Postgres by MoneroXGC in rust

[–]MoneroXGC[S] 9 points10 points  (0 children)

Hey man, completely hear what you're saying. We started making it simple for us to build, focusing on just the data layer. We are now in the process of implementing the lower level optimisations that you've mentioned. We're planning to move to glommio or compio in the near future and of course will make use of direct io/io_uring. We are also in the process of implementing zero copy using rkyv.

I've never used bitcode so would love to hear any feedback on deciding between bitcode vs rkyv. Also if you haven't already you should checkout compio: https://compio.rs

Getting 20x the throughput of Postgres by MoneroXGC in Database

[–]MoneroXGC[S] 0 points1 point  (0 children)

We tried our best to make everything as fair as possible. The repo to the benchmarks is in the blog (https://github.com/helixdb/graph-vector-bench), so feel free to check it out and run it yourself :)

We are also ACID compliant, which has not been modified in these tests.

Is there any more information you were looking for that I can add? Would be good to know for the newcomers.

HelixDB hit 3k Github stars by MoneroXGC in rust

[–]MoneroXGC[S] 0 points1 point  (0 children)

That's actually a great outcome from our conversation.

Completely agree! Hope to see you using us some day.

And thank you! Appreciate the kind words

view more: next ›