GSQL Tag

Many people already know that graph algorithms are the most efficient and sometimes the only solution for complex business use cases, such as clustering different groups of users (Community Detection), finding influential persons or entities (PageRank Algorithm), or predicting user behaviors for personalized recommendation (Label...

Originally featured on DZone This article is intended for Neo4j Cypher users who want to learn and understand TigerGraph’s GSQL query language.  This is by no means a primer on GSQL. For that, the definitive place to start is TigerGraph’s documentation site.  There are also a...

A common question from the TigerGraph prospects who know Cypher and want to learn GSQL is “Do you have an example of the movie database from Neo4j?”. So, I thought it would be interesting to share an implementation of that movie database in GSQL as...

 A cycle is a path of edges and vertices that connect together to form a loop. In a directed graph, all the edges must point in the same direction so that one can "travel" around the cycle. In a sample social graph (Fig.1), George, Howard...

In our upcoming 2.4 release, TigerGraph will offer a major syntax extension in GSQL - pattern matching. Pattern matching enables users to focus on specifying what multi-hop path pattern they want in a query block, without worrying about the direction of the underlying data flow....

In this short technical blog, I will show you how to use GSQL to search a graph for all the occurrences of a small graph pattern.  We call this pattern matching. Consider the problem of matching a pattern of vertices and directed edges in a graph...

Since the introduction of the TigerGraph Developer Edition in June 2018, the GSQL language has generated a lot of interest and a lot of valuable feedback. In general, the feedback has been positive for GSQL’s ease of use, high performance, and high expressive power. Here...