Getting Started with Gremlin

Apache TinkerPop is an open source graph computing framework. A graph computing network is a set of vertices and edges in the network. If we compare a graph database to traditional relational databases, we can assume that every row in a table of a relational database is equivalent to a vertex in graph network. Similarly, […]

Creating a Node Table

Querying database schema using graph tables

SQL Server 2017 introduced the concept of graph data tables as part of the SQL Server database engine. With SQL Server 2019, there were some enhancements like ‘shortest path’ function and constraints on edge tables that make this feature more usable – although it is far from a full-fledged graph database. Graph tables are essentially […]

SQL Server 2019 Graph Database and SHORTEST_PATH

With SQL Server 2019 on the way, it’s time to begin learning about all the new features. In this article, Dennes Torres demonstrates how to use the new SHORTEST_PATH function that is part of the Graph Database feature.

Graph Concepts

Relational Databases vs Graph Databases

In this tip we will address questions that will help relational database developers understand the various considerations for using a graph database.

The SQL of Membership: Equivalence Classes & Cliques

It is awkward to do 'Graph databases' in SQL to explore the sort of relationships and memberships in social networks because equivalence relations are classes (a set of sets) rather than sets. However one can explore graphs in SQL if the relationship has all three of the mathematical properties needed for an equivalence relationship.

Experiments with NEO4J: Using a graph database as a SQL Server metadata hub

NEO4J, the graph database, can be used to provide answers that are very tricky for relational databases, including providing diagrams to show how SQL tables relate to each other, and the shortest chain of relationships between two tables, as David Poole demonstrates