Viewing profile — katelatte

Is it possible to use Memgraph's vector search to build GraphRAG? How would that work?

I organize community calls for Memgraph community and recently a community member presented how he uses hypothetical answer generation as a crucial component to enhancing the effec…

Suggestion: check out Memgraph for graph db storage - https://memgraph.com/ . I work at Memgraph as DX Engineer so feel free to ping me in case you have questions about it: https:/…

I was collaborating on the latest feature in Memgraph Lab - GraphChat. To enable natural language querying in Memgraph Lab, we integrated the Lab backend with LangChain and powered…

When I am presenting about graph databases, people often ask me about the differences between graph and relational databases so I decided to write a blog post about it.

Hi, author here. I wanted to play a bit with ChatGPT and see how it can help me in creating a graph database. It was really good in conversation about graph data modelling and I th…

Thanks for reporting! We will fix it asap

Memgraph does persist data. Snapshots are taken periodically during the entire runtime of Memgraph. When a snapshot is triggered, the whole data storage is written to the disk. The…

While researching about NetworkX, I noticed sometimes projects become too big, and you can lose a lot of time on data import, instead on the actual graph analysis. You can see disc…

Thanks for creating this and helping others learn! Amazing effort :)

Well done on your work! It's nice to see new tools being developed in graph world, especially in Rust. I would just like to emphasize that there is a big difference between a graph…

Who ranks better was my word play, because of PageRank :') But yes, I totally agree with what you wrote and I will aim for more detailed comparisons in the next articles. And you a…

I considered different ways of comparison here, and decided to go with a simple comparison on sample dataset, just to get a feel of it. I did consider doing it all in Python, but t…

I forgot to mention: we do have biconnected components algorithm [1], and since all biconnected graphs are strongly connected, it can be useful. [1] https://memgraph.com/docs/mage/…

We do have our own implementation of weakly connected components [1]. Currently, we only have NetworkX strongly connected components algorithm [2] as a part of the nxalg module (se…

But again, thanks for sharing. This is also a valuable resource and reference for future comparisons.

Yeah, but this is not an official benchmark, it’s just a simple demo on sample dataset. It would take much more effort to create the whole benchmark to prove how much exactly Memgr…

Yes, I work for Memgraph, I am a developer there and I wrote this, and all of the previously published articles. I was comparing NetworkX to Memgraph algorithms, since that was the…

Yes, I agree. I read this comparison in performance, it's a really good resource, thanks for sharing. It all depends on what are your needs of course. But C++ implementation of gra…

I continued learning about NetworkX, and when it comes to issues with scaling and the need for persistence when working on applications in production, Memgraph saves the day. You c…