Some very useful and important graph-specific functions and methods are not supported in SQL Server 2017's SQL Graph:
- Transitive closure
- Shortest path between two nodes
- Polymorphism
- PageRank
A feature called transitive closure, usually present in graph databases, is not available in the SQL Graph feature of SQL Server 2017, an extension or superset of a binary relation so that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension. This is a very useful feature that gives you all paths between two nodes or answers questions such as May I fly from Linz (Austria) to Stavanger (Norway)? or How can I reach Liverpool from Belgrade? Unfortunately, SQL Graph's MATCH clause does not support ...
