3 ms·
That's good to hear, how large is the graph you're building (nodes, edges) and how do queries perform?
by jcgrillo 1y ago
That's good to hear, how large is the graph you're building (nodes, edges) and how do queries perform?
- lolive 1y agoThe big issue we have had with Neo4J was with replication, when we do MASSIVE updates. For the rest, it handles the charge reasonably well.
- jcgrillo 1y agoWhat constitutes a massive update?
- UltraSane 1y agoNot very big since it is only used internally at my company. 5 digit node count and high 6 digit relationships count. Queries are usually very fast unless you try to do something stupid that ends up having to search the entire graph. indexing critical high-cardinality properties and thinking of relationships as a kind of index help a lot with query performance. I have been meaning to test how fast memgraph is.