nito98
Large amount of data, combined with using non optimal memory allocation can result in interesting issues in graph database. Thanks to flamegraph and heaptrack, we successfully resolved issues we had in Memgraph concerning high memory consumption and lower performance on LOAD CSV clause.
Queries to Find Patterns in Your Knowledge Graph
Main idea behind blog post is to explain what kind of questions you can ask when dealing with graphs to uncover hidden knowledge. Problem is often that although it seems at first easier to work with Relational databases due to the way people are used to think about databases and finding something in them, it turns out to be slow and nonperforming solution. And when you realize graph databases are more suitable when dealing with finding patterns due to lot's of node hopping and explorations, people don't know how to model such question or don't know what you can ask graph database. This blog post intends to help you with first steps and get some ideas.
Let me know what do you think.
Graph represents a data structure which consists of finite set of nodes and edges which are connecting two nodes. Best example to think of graph is social network. There nodes represent people, and edges represent friendships, or follows. For example if I were to follow you and we want to represent it with graph, there would be two nodes (me and you) and edge from me as node to you as node.
Hope it is clear :)
Show HN: We designed and implemented graph projection feature
Hi all! I'm one of the developers that were working on this project for some time. In recent months, users started to ask us more frequently about the ability to run algorithms on a part of graph stored in database - subgraph. Now to do this, we extended the implementation of C API we had and brought to you the graph project feature that enables running algorithms on a specific subset of a...