
Sign up to save your podcasts
Or
In its simplest form, Graph Theory defines a graph as a construct made up of vertices, nodes, or points which are connected by edges, arcs, or lines.1 The connections may be directed, indicating a direction from one node to another, or undirected. Properties are attributes associated with nodes that describe the node in some detail.
Graph theory is applied in many disciplines from linguistics to computer science, physics, and chemistry. Popular uses will be discussed below. Leonhard Euler published “Seven Bridges of Königsberg” in 1736; this is commonly attributed as the first paper about graph theory. James Joseph Sylvester published a paper in 1878 where the term “graph” was first introduced. The first textbook was later published in 1936.1
There are various algorithms that define how to best traverse through a graph from one node to another based on the edges between them.
In the original 1998 academic paper that Sergey Brin and Lawrence Page wrote, they described PageRank, the graph portion of their first implementation of Google.
Basically, all webpages are treated as nodes. The hyperlinks between the pages are edges, and an algorithm assigns a weight to the credibility of each page. The more links a page has to credible sources, the higher that page’s credibility becomes. A search is a) broken down into a series of words, b) used to find pages that most closely correlate to those words, and c) page results are ranked according to their credibility, or PageRank.
As of mid-2016, the size of Google’s index as 130 trillion. Google has a nice infographic site on how search works here.
For use cases involving complex relationships and traversal of these, graphs make great choices. They can provide10:
(All of these bullets above are from https://cambridge-intelligence.com/keylines/graph-databases-data-visualization/)
The most popular and hottest use cases of graph DBs at the moment are:
These boil down to the following uses10:
In 2016 11.5 million documents comprising 2.6TB of information were leaked from a Panama law firm (Mossack Fonseca). These documents were scanned and processed into the Neo4j graph database where investigative journalist used graph visualizations to uncover hidden insights and relationships that would have otherwise been missed.
See the articles at Neo4J for more information on how this information was analyzed.
Neo4j is far and away the most popular graph database. Neo4j and several of the other top graph DBs are all open source. Below is the trend of popularity for these databases from DB-engines.com. Neo4j is first with a score of 36.27, followed by OrientDB (5.87) and Titan (5.08).
Rank
DBMS
Database Model
Score
Feb
2017
Jan
2017
Feb
2016
Feb
2017
Jan
2017
Feb
2016
1.
1.
1.
Neo4j
Graph DBMS
36.27
+0.00
+3.98
2.
2.
2.
OrientDB
Multi-model
5.87
+0.06
-0.55
3.
3.
3.
Titan
Graph DBMS
5.08
-0.42
-0.27
Music for today’s podcast is Cyanos by Graphiqs Groove via FreeMusicArchive.org.
In its simplest form, Graph Theory defines a graph as a construct made up of vertices, nodes, or points which are connected by edges, arcs, or lines.1 The connections may be directed, indicating a direction from one node to another, or undirected. Properties are attributes associated with nodes that describe the node in some detail.
Graph theory is applied in many disciplines from linguistics to computer science, physics, and chemistry. Popular uses will be discussed below. Leonhard Euler published “Seven Bridges of Königsberg” in 1736; this is commonly attributed as the first paper about graph theory. James Joseph Sylvester published a paper in 1878 where the term “graph” was first introduced. The first textbook was later published in 1936.1
There are various algorithms that define how to best traverse through a graph from one node to another based on the edges between them.
In the original 1998 academic paper that Sergey Brin and Lawrence Page wrote, they described PageRank, the graph portion of their first implementation of Google.
Basically, all webpages are treated as nodes. The hyperlinks between the pages are edges, and an algorithm assigns a weight to the credibility of each page. The more links a page has to credible sources, the higher that page’s credibility becomes. A search is a) broken down into a series of words, b) used to find pages that most closely correlate to those words, and c) page results are ranked according to their credibility, or PageRank.
As of mid-2016, the size of Google’s index as 130 trillion. Google has a nice infographic site on how search works here.
For use cases involving complex relationships and traversal of these, graphs make great choices. They can provide10:
(All of these bullets above are from https://cambridge-intelligence.com/keylines/graph-databases-data-visualization/)
The most popular and hottest use cases of graph DBs at the moment are:
These boil down to the following uses10:
In 2016 11.5 million documents comprising 2.6TB of information were leaked from a Panama law firm (Mossack Fonseca). These documents were scanned and processed into the Neo4j graph database where investigative journalist used graph visualizations to uncover hidden insights and relationships that would have otherwise been missed.
See the articles at Neo4J for more information on how this information was analyzed.
Neo4j is far and away the most popular graph database. Neo4j and several of the other top graph DBs are all open source. Below is the trend of popularity for these databases from DB-engines.com. Neo4j is first with a score of 36.27, followed by OrientDB (5.87) and Titan (5.08).
Rank
DBMS
Database Model
Score
Feb
2017
Jan
2017
Feb
2016
Feb
2017
Jan
2017
Feb
2016
1.
1.
1.
Neo4j
Graph DBMS
36.27
+0.00
+3.98
2.
2.
2.
OrientDB
Multi-model
5.87
+0.06
-0.55
3.
3.
3.
Titan
Graph DBMS
5.08
-0.42
-0.27
Music for today’s podcast is Cyanos by Graphiqs Groove via FreeMusicArchive.org.