TigerGraph Graph Data Science Library

TigerGraph In-Database Graph Data Science (GDS) Library is a collection of more than 50 ready-to-use GSQL queries, each of which implements a standard graph or machine learning algorithm.

Get to know the Graph Data Science (GDS) Library

admin Using a Algorithm

Information on how to use a TigerGraph Graph Data Science (GDS) Library algorithm.

Using an Algorithm | Library Structure | Algorithm Table

admin Centrality Algorithms

Centrality Algorithms find the important vertices in a graph based on their connections with other vertices.

admin Classification Algorithms

Classification Algorithms label vertices to sort them into various defined classes.

admin Community Algorithms

Community Algorithms group together vertices or edges that satisfy some rule for being connected to one another.

admin Node Embedding Algorithms

Node Embeddings are vector representations of vertex properties in a graph.

admin Pathfinding Algorithms

Pathfinding Algorithms find the best path(s) among a set of vertices according to length or cost.

admin Similarity Algorithms

Similarity Algorithms assign a score to a pair of vertices based on how similar they are, usually by referring to their neighborhoods.

admin Topological Link Prediction Algorithms

Link Prediction determine the closeness of a pair of vertices to make predictions about their relationships.

GSQL running on the TigerGraph platform is particularly well-suited for graph algorithms for several reasons:

  • Turing-complete with full support for imperative and procedural programming, ideal for algorithmic computation.

  • Parallel and Distributed Processing, enabling computations on larger graphs.

  • User-Extensible. Because the algorithms are written in standard GSQL and compiled by the user, they are easy to modify and customize.

  • Open-Source. Users can study the GSQL implementations to learn by example, and they can develop and submit additions to the library.

Release Branches

Starting with TigerGraph product version 2.6, the GSQL Graph Algorithm Library has release branches:

  • Product version branches (2.6, 3.0, etc.) are snapshots created shortly after a product version is released.They contain the best version of the graph algorithm library at the time of that product version’s initial release.They will not be updated, except to fix bugs.

  • Master branch: the newest released version.This should be at least as new as the newest.It may contain new or improved algorithms.

  • Other branches are development branches.

It is possible to run newer algorithms on an older product version, as long as the algorithm does not rely on features available only in newer product versions.