Welcome to part twenty of the plansplaining series. It has been a long time since I last wrote a plansplaining post, partly because of my health, but also for a large part because I was out of ideas. But recently I decided to dig a bit deeper into a feature that was released in SQL Server 2017 and that I had so far not played with: SQL Graph.
2023-12-06
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, […]
2020-10-15
3,891 reads
2020-01-28
711 reads
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 […]
2019-12-23
14,973 reads
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.
2019-09-17
2019-09-03
697 reads
In this tip we will address questions that will help relational database developers understand the various considerations for using a graph database.
2019-08-07
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.
2014-08-08
9,485 reads
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
2014-06-30
3,128 reads
By Steve Jones
I love Chicago. I went to visit three times in 2023: a Redgate event,...
By Brian Kelley
I have found that non-functional requirements (NFRs) can be hard to define for a...
You can find the slidedeck for my Techorama session “Microsoft Fabric for Dummies” on...
Testing with AG on Linux with Cluster=NONE. it was all going ok and as...
Hi, I have two tables: one for headers with 9 fields and another for...
We're trying to understand how quick new versions of SQL server can be. Obviously...
Let’s consider the following script that can be executed without any error on both SQL Sever and PostgreSQL. We define the table t1 in which we insert three records:
create table t1 (id int primary key, city varchar(50)); insert into t1 values (1, 'Rome'), (2, 'New York'), (3, NULL);If we execute the following query, how will the records be sorted in both environments?
select city from t1 order by city;See possible answers