What sets GSQL apart
GSQL is the choice for fast and scalable graph operations and analytics. GSQL’s similarity to SQL, high-level syntax, Turing completeness, and built-in parallelism brings faster performance, faster development and the ability to describe any algorithm.
GSQL is designed for complex graph analytics. By taking advantage of a unique feature of the GSQL query language - accumulators - users can leverage TigerGraph’s Massively Parallel Processing (MPP) capability without the pain and fuss traditionally associated with parallel programming.
GSQL is Turing-complete with full support for imperative and procedural programming, ideal for algorithmic computation. The Turing completeness of the language, especially with the conventional control flow statements, allows users to describe any algorithm with GSQL.
Data loading procedures and queries written in GSQL take full advantage of TigerGraph’s MPP capability, enabling blazing-fast data ingestion as well as querying.
In a benchmark test, TigerGraph used the Data Benchmark Council (LDBC) Social Network Benchmark (SNB) Scale Factor 30k dataset. The results show that TigerGraph can run deep-link OLAP style queries on 36 TB of raw data with 73 billion vertices and 534 billion edges, returning results in a few minutes or less.
GSQL features an SQL-like syntax that reduces the learning curve for SQL programmers.
The following are two queries that retrieve a list of products in alphabetical order.
We can see the similarities between the two languages especially in the