What are Graph Databases and Why should I care? - Dave Bechberger

[@ghollisjr]

Just couldn't help adding an easy way to understand the Euler path theorem from the beginning: Every time you traverse an edge in the graph, you change nodes. If a node has an odd number of edges connected to it, then if you start at that node then you cannot end at that node and also traverse all edges, since returning to the same edge requires an even number of edges to be traversed connected to that node. Similarly, if you didn't start at a node which has an odd number of edges, then you will eventually get trapped there, since an even number of edges being traversed connected to that node results in you being away from that node but an odd number of edges still untraversed which are connected to that node. So, you can have at most a beginning node with odd edges, and an end node with odd edges, but more than 2 such nodes and you will not be able to traverse all of the edges without getting trapped at one of those extra odd-edged nodes prematurely.

[@georgeanadiotis4452]

If you are ready to take the next step with graph databases, and start using one, this an introduction on how to choose the right one for you: kzbin.info/www/bejne/mWSZfoqinsRkl8k

[@axeman2638]

I'm never going to use a relational database again.

[@skylerreeves]

This is how I felt after my first time too.

[@geoffclapp5280]

Hybrid solution with a graph abstraction on top of SQL is nice

[@sunghong524]

This is amazing.

[@txtrader512]

I know!

[@YusanTRusli]

Prolog

[@kamalabuhenamostafa]

Where is time based?

[@mrlithium69]

Greenwich ?