21–30 of 45 posts
> Graphs, for example, can have cycles while trees can't. A cycle means that there is only one way to go to a node by following relationships from another node. Typo here, that's the opposite of what cycle means, isn't it?
I'm glad that you liked it. If you want to see all of these things in action check out Memgraph. You, can find our repo at https://github.com/memgraph/memgraph DISCLAIMER: I'm the co-founder and CTO. Also, any feedback or suggestion will help us push more of content like this in the future!
This is an awesome introduction. I wish there was a book/resource that explains when you should NOT use a graph DB( or any technology for that matter). And the pitfalls of using the wrong technology. You have so many options for technology these days with so much overlapping capabilities it’s hard to decide which tech pick for which problem space.
> I wish there was a book/resource that explains when you should NOT use a graph DB( or any technology for that matter). And the pitfalls of using the wrong technology. This is complicated by database companies, in particular, often marketing their products as suitable—or even best—for every situation, even when it's not true. Graph databases are doing this now, but we saw the same thing with document-oriented databa…
This is an awesome introduction. I wish there was a book/resource that explains when you should NOT use a graph DB( or any technology for that matter). And the pitfalls of using the wrong technology. You have so many options for technology these days with so much overlapping capabilities it’s hard to decide which tech pick for which problem space.
This page crashed. window.analytics is undefined Try again Firefox mobile
I'm glad that you liked it. If you want to see all of these things in action check out Memgraph. You, can find our repo at https://github.com/memgraph/memgraph DISCLAIMER: I'm the co-founder and CTO. Also, any feedback or suggestion will help us push more of content like this in the future!
Thanks for this intro to Graphs. Does Memgraph persist to disk or is it in-memory only? If in-memory only, do you have plans to support graphs which become larger than available memory? Thanks!
This page crashed. window.analytics is undefined Try again Firefox mobile
Firefox desktop too.
> Graphs, for example, can have cycles while trees can't. A cycle means that there is only one way to go to a node by following relationships from another node. Typo here, that's the opposite of what cycle means, isn't it?
The article then continues with:
> To fully utilize the power of graphs, you first need to get a basic understanding of the underlying concepts in graph theory.
Indeed. ;)
> There are four components that every graph consists of nodes, relationships, labels, and properties.
This is incorrect. A graph in the graph-theoric sense consists solely of vertices and edges [0] (nodes and relationships), no labels or properties required. Also, there's a colon missing after "of".
The writing is quite sloppy for a field that requires rigorous precision.
[0] https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)#G...
I'm glad that you liked it. If you want to see all of these things in action check out Memgraph. You, can find our repo at https://github.com/memgraph/memgraph DISCLAIMER: I'm the co-founder and CTO. Also, any feedback or suggestion will help us push more of content like this in the future!
Thanks for this intro to Graphs. Does Memgraph persist to disk or is it in-memory only? If in-memory only, do you have plans to support graphs which become larger than available memory? Thanks!
How big is your graph and do you have specific queries in mind?