Graph Database In SQL Server

Kevin Feasel



Niko Neugebauer has started a new series, this time on graph database functionality in SQL Server 2017:

Graph databases are based on graph theory, and employ nodes, edges, and properties. The graph theory is the study of the graphs that are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of nodes, edges which are connected by edges, arcs, or lines.
A graph can be directed or undirected (uni or bi-directional) that might point the direction of the relationship between the edges.
Graph databases can be compared to the Network Model Databases, that were focusing on solving the same problem the interconnected world.

The most popular graph database in the world currently is NEO4J, which is implemented in Java and is using CQL (Cypher Query Language), a language that has definitely inspired the SQL Graph T-SQL language extension.

Niko notes that this is not a fully mature product yet, but it’s an interesting start.

Related Posts

The Semantics Of GraphQL

Adrian Colyer reviews a paper on the mathematical properties behind GraphQL: The authors study the computational complexity of GraphQL looking at three central questions: The evaluation problem: what can we say about the complexity of GraphQL query evaluation? The enumeration problem: how efficiently can we enumerate the results of a query in practice? The response size problem: how large can responses […]

Read More

Graph Algorithms Supported In Neo4j

Kevin Feasel



Amy Hodler gives us a quick summary of fifteen separate algorithms for traversing a graph in Neo4j: 6. PageRank What it does: Estimates a current node’s importance from its linked neighbors and then again from their neighbors. A node’s rank is derived from the number and quality of its transitive links to estimate influence. Although popularized […]

Read More


June 2017
« May Jul »