Skip to content
START FOR FREE
START FOR FREE
  • SUPPORT
  • COMMUNITY
Menu
  • SUPPORT
  • COMMUNITY
MENUMENU
  • Products
    • The World’s Fastest and Most Scalable Graph Platform

      LEARN MORE

      Watch a TigerGraph Demo

      TIGERGRAPH CLOUD

      • Overview
      • TigerGraph Cloud Suite
      • FAQ
      • Pricing

      USER TOOLS

      • GraphStudio
      • Insights
      • Application Workbenches
      • Connectors and Drivers
      • Starter Kits
      • openCypher Support

      TIGERGRAPH DB

      • Overview
      • GSQL Query Language
      • Compare Editions

      GRAPH DATA SCIENCE

      • Graph Data Science Library
      • Machine Learning Workbench
  • Solutions
    • The World’s Fastest and Most Scalable Graph Platform

      LEARN MORE

      Watch a TigerGraph Demo

      Solutions

      • Solutions Overview

      INCREASE REVENUE

      • Customer Journey/360
      • Product Marketing
      • Entity Resolution
      • Recommendation Engine

      MANAGE RISK

      • Fraud Detection
      • Anti-Money Laundering
      • Threat Detection
      • Risk Monitoring

      IMPROVE OPERATIONS

      • Supply Chain Analysis
      • Energy Management
      • Network Optimization

      By Industry

      • Advertising, Media & Entertainment
      • Financial Services
      • Healthcare & Life Sciences

      FOUNDATIONAL

      • AI & Machine Learning
      • Time Series Analysis
      • Geospatial Analysis
  • Customers
    • The World’s Fastest and Most Scalable Graph Platform

      LEARN MORE

      CUSTOMER SUCCESS STORIES

      • Ford
      • Intuit
      • JPMorgan Chase
      • READ MORE SUCCESS STORIES
      • Jaguar Land Rover
      • United Health Group
      • Xbox
  • Partners
    • The World’s Fastest and Most Scalable Graph Platform

      LEARN MORE

      PARTNER PROGRAM

      • Partner Benefits
      • TigerGraph Partners
      • Sign Up
      TigerGraph partners with organizations that offer complementary technology solutions and services.​
  • Resources
    • The World’s Fastest and Most Scalable Graph Platform

      LEARN MORE

      BLOG

      • TigerGraph Blog

      RESOURCES

      • Resource Library
      • Benchmarks
      • Demos
      • O'Reilly Graph + ML Book

      EVENTS & WEBINARS

      • Graph+AI Summit
      • Graph for All - Million Dollar Challenge
      • Events &Trade Shows
      • Webinars

      DEVELOPERS

      • Documentation
      • Ecosystem
      • Developers Hub
      • Community Forum

      SUPPORT

      • Contact Support
      • Production Guidelines

      EDUCATION

      • Training & Certifications
  • Company
    • Join the World’s Fastest and Most Scalable Graph Platform

      WE ARE HIRING

      COMPANY

      • Company Overview
      • Leadership
      • Legal Terms
      • Patents
      • Security and Compliance

      CAREERS

      • Join Us
      • Open Positions

      AWARDS

      • Awards and Recognition
      • Leader in Forrester Wave
      • Gartner Research

      PRESS RELEASE

      • Read All Press Releases
      TigerGraph Reports Exceptional Customer Growth and Product Leadership as More Market-Leading Companies Tap the Power of Graph
      March 1, 2023
      Read More »

      NEWS

      • Read All News
      The-New-Stack-Logo-square

      Multiple Vendors Make Data and Analytics Ubiquitous

      TigerGraph enhances fundamentals in latest platform update

  • START FREE
    • The World’s Fastest and Most Scalable Graph Platform

      GET STARTED

      • Request a Demo
      • CONTACT US
      • Try TigerGraph
      • START FREE
      • TRY AN ONLINE DEMO

Everything to Know to Pass your TigerGraph Certification Test

  • Emily McAuliffe
  • June 24, 2020
  • About TigerGraph, blog, Community, Developers
  • Blog >
  • Everything to Know to Pass your TigerGraph Certification Test

Originally posted on Towards Data Science by Shreya Chaudhary.

What’s TigerGraph and Why Should I Get Certified?

Listed as one of Gartner’s top ten data and analytics trends for 2019, graph technology is the future, allowing users to ask complex questions over complex data, and TigerGraph is one instance of this. Here, we’ll walk through all the content you’ll need for using TigerGraph and learning about graph technology. If you get certified, your credibility increases, therefore I strongly suggest you give it a try. In addition, TigerGraph is “the only scalable graph database for enterprise.” By taking the certification test, not only will you increase your credibility, but you’ll also learn something new that could help you almost anywhere. Also, taking the test is completely free, so all it takes is time and willingness to learn to pass your test!

Step 1: Theory

The first four modules you’ll watch consists of theory. What is graphing technology? Can you tell the difference between some popular versions and what their different applications would be?

Graph Database and Analytics

A graph consists of vertices (also called nodes) which are connected by edges. All the vertices and edges make a schema. The power of graph technology is that the data are interconnected, allowing users to ask complex questions across complex data which sometimes isn’t possible using SQL. The nodes and edges can have properties or attributes, such as age, location, time, etc., which provide details about each node and edge; graphs with nodes, vertices, and properties are called property graphs

Photo by Shreya Chaudhary. The above shows a basic property graph plus an example. Each vertex is connected with either a directed or undirected edge (an arrow or a line respectively) and have unique primary_id.

Graphs can be used as a referral network by searching for different entities which have multiple vertices in common and are a few hops (or edges) away. You can find referral networks in your everyday life, like your suggested LinkedIn connections or suggested doctors.

Property graphs contrast from Resource Description Framework (RDF) Graphs because each node on an RDF is a Unique Resource Identifier (URI) which cannot carry any attributes. They have subjects and objects (nodes), connected with predicates (edges), but they can get verbose.

Photo by Shreya Chaudhary. This is an RDF. Notice that the properties are separate nodes, not attributes of a node.

Be sure to remember the information in the above chart for the exam.

Managing Relationships

Next, we learn about different databases’ methods of storing relationships and how graph compares. Relational databases stores each entity in separate tables which then require table joins to connect, an action which could take hours and are computation expensive. It can be used for indexing and searching for one type of data and performing basic analyses. Relational databases are optimised for transactions, not deep analytics.

Photo by Shreya Chaudhary. This is an example of a relational database with table joins between different entities. 

Graph databases, in contrast, are one, single, pre-connected table. They’re a natural storage model built for storing and analysing relationships. Because all of its relationships are first-class entities, graph databases, optimised for deep analytics, tend to be much faster than relational databases.

Compared to a NoSQL, graph databases tend to be better for deep analytics. One example of such is a key-value database, which stores all its data in a single table. Key-value databases allow for data flexibility and fast key lookups, but it’s low-level. Column-family is efficient processing at scale, but it’s slow for transactions and updates. Document can handle structures like XML and JSON, but it’s often very specialised. All of these require traversing and analysing relationships, taking many scans of the tables, making it unfit for analysing deep relationships. Finally, graphs are good for dealing with relationships and are the only of the said structures which manage relationships well, but not all graphs offer real-time speed at scale. Overall, while NoSQL graphs can store a wide variety of data, graphs are the best choice for handling relationships and entities.

Photo by Shreya Chaudhary. This shows a Key-Value database, which is one huge database that takes a lot of time to iterate over.

The Evolution of Graphs

There are currently three types of graph: Graph 1.0, Graph 2.0, and Graph 3.0. Graph 1.0 using native graph storage with a single server and non-parallel architecture. Graph 2.0 uses a NoSQL base for storage scale and can support two hops queries, but they aren’t designed for real-time updates. Graph 3.0, however, is both native and parallel, supporting over ten hops and taking less time to run hops and load data.

Graph 3.0, as provided by TigerGraph, supports HTAP (Hybrid Transactions and Analytics). It also supports OLTP and OLAP, has real-time performance, is a transactional graph, has scalability for massive datasets, can use Deep Link Multi-Hope Analytics, provides ease for develop and deployment, and provides enterprise grade security. TigerGraph is the world’s first Native Parallel and Distributed Graph and has interoperability, parallelism with MPP, has many graph algorithms in a libraries, supports MultiGraph, uses GSQL (which is similar to SQL to allow easy transition). Graph Studio, a GUI, allows for quick and simple creations of graphs and easy visualisation.

Data Science Capabilities

Graphs support many machine learning and data science algorithms. This is a walk-through of a few of them.

Deep Link Analysis supports looking through data with more than three hops. This can grow exponentially. An example of Deep Link Analysis is trying to find a user’s fraudulent history. Not only will it look at shallow connections, but it will also look deeper to detect whether a user’s history is clear.

Multi-dimensional Entity and Pattern Match will look for a pattern within a graph.

Relational Commonality looks for something in common with two vertices, like common customers for two vendors.

Hub Community Detection searches for the most influential vertex in a graph, the vertex with the most edges. This can help find the relevance of something within a community.

Geospatial Graph Analysis shows how close two things are to each other using latitude and longitude.

Temporal Graph Analysis is similar, but it looks at how entities and relationships change over time.

Machine Learning and Explainable AI can be used by graph by extracting features and using GraphStudio (the GUI) to provide visual aids for the graphs.

Step 2: TigerGraph Cloud

To use TigerGraph Cloud, go to https://tgcloud.io/. Login and then make sure you’re comfortable with using this resource. Be able to create a solution, upload data, create queries, and build graphs using GraphStudio. There are already several great blogs about this, so I’ll link them here.

Here’s one that I would recommend: https://www.tigergraph.com/2020/01/20/taking-your-first-steps-in-learning-tigergraph-cloud/

Step 3: SELECT Statement

SELECT

Using a Select Statement, one can traverse from one set of vertices to another. This is the general syntax (required parameters are in bold):

resultSet = SELECT vSet FROM (edgeSet | vertexSet) [whereClause]
[accumClause] [havingClause] [orderClause] [limitClause] ;

When running this command, the algorithm starts with FROM, goes through all the other clauses to “filter” or do operation with them, then the SELECT returns all the vertices that fit.

Here is an example query:

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   Start = (inputUser);
   Friends = SELECT t FROM Start:s- (IsFriend:e)-User:t;
   PRINT Friends;
}

In the example, s is the starting node, e is the edge, and t is the target or final node.

WHERE and AND

WHERE filters out vertices that don’t match a certain condition. These conditions can be joined using the AND statement.

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   Start = (inputUser);
   Friends = SELECT t FROM Start:s- (IsFriend:e)-User:t
             WHERE e.connectDt BETWEEN to_datetime("2019-01-01")
             AND to_datetime("2020-01-01")
             AND t.gender == "F";
   PRINT Friends;
}

In the case, it’s filtering all the edges with a connectDt between 2019–01–01 and 2020–01–01. Next, it filters all the target nodes with the gender attribute as “F”. In the end, Friends prints out all female friends who connected in 2019.

Accumulators

Accumulators can be local(notated with one @) or global (notated with two @@). Local accumulators are specific to each vertex, and global accumulators are for the entire graph.

Next, there are more specific types of accumulators:

SumAccum<int> stores the running total of all numbers passed.

MaxAccum<int> stores the maximum number passed.

MinAccum<int> stores the minimum number passed.

AvgAccum<int> stores the running average of all numbers passed.

SetAccum<int> requires that all elements are unique.

ListAccum<int> has a list of the elements in the order it was passed in.

MapAccum<int, SumAccum<int>> use key-value pairs to store data like a map.

HeapAccum<Tuple> stores the data in tuples in ascending or descending order. One can also set a capacity limit; when the limit is reached, it will either remove the highest or lowest value.

Here are two examples. The first has a one-hop global MinAccum:

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   MinAccum<uint> @@youngFriend;
   Start = (inputUser);
   Friends = SELECT t FROM Start:s- (IsFriend:e)-User:t
             WHERE e.connectDt BETWEEN to_datetime("2019-01-01")
             AND to_datetime("2020-01-01")
             AND t.gender == "F";
             ACCUM @@youngFriend += t.age;
   PRINT Friends;
}

That second has a two-hop local AvgAccums:

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   AvgAccum @avgAge;
   Start = (inputUser);
   Friends1Hop = SELECT t FROM Start:s- (IsFriend:e)-:t;
   Friends2Hop = SELECT t 
                 FROM Friends1Hop:s- (IsFriend:e)-:t
                 ACCUM [email protected] += s.age;
   PRINT Friends2Hop;
}

POST-ACCUM

POST-ACCUM is independent from the ACCUM clause. They can either access the starting or target vertex (the s or t alias). If it’s a global accumulator, the work will be queued and take effect after leaving the POST-ACCUM clause.

Check out an example of normalising, with a global max accumulator and a sum accumulator:

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   SumAccum<uint> @sumAge;
   SumAccum<float> @normCNum;
   MaxAccum<float> @@maxCNum;
   Start = (inputUser);
   Friends1Hop = SELECT t FROM Start:s- (IsFriend:e)-:t;
   Friends2Hop = SELECT t 
                 FROM Friends1Hop:s- (IsFriend:e)-:t
                 ACCUM [email protected] += 1
                 POST-ACCUM @@maxCNum += [email protected];
   Friends2Hop = select s FROM Freinds2Hop:s
                 POST-ACCUM [email protected] += [email protected]/@@maxCNum;
   PRINT Friends2Hop;
}

HAVING

The HAVING clause is another way to filter out data. It’s similar to the WHERE clause, but the HAVING clause only has access to the selected vertices and attributes, whereas a WHERE clause has access to the start and target vertices.

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   AvgAccum @avgAge;
   Start = (inputUser);
   Friends1Hop = SELECT t FROM Start:s- (IsFriend:e)-:t;
   Friends2Hop = SELECT t 
                 FROM Friends1Hop:s- (IsFriend:e)-:t
                 ACCUM [email protected] += s.age
                 HAVING [email protected] > 30;
   PRINT Friends2Hop;
}

ORDER BY and LIMIT

Finally, the ORDER BY can sort the results to be ascending or descending. The LIMIT sets the maximum number of values in the accumulator.

CREATE QUERY GetFriends(vertex<Users> inputUser) FOR GRAPH Social {
   AvgAccum @avgAge;
   Start = (inputUser);
   Friends1Hop = SELECT t FROM Start:s- (IsFriend:e)-:t;
   Friends2Hop = SELECT t 
                 FROM Friends1Hop:s- (IsFriend:e)-:t
                 ACCUM [email protected] += s.age
                 ORDER BY [email protected] ASC
                 LIMIT 2;
   PRINT Friends2Hop;
}

The above example orders the results to be ascending, then it grabs the top two, which would be the smallest two.

Step 4: GSQL Demo

Graph Schema

For each vertex in your schema, you need to have a primary ID. In addition, for each vertex, you need to specific a FROM and To. Observe the following syntax:

CREATE VERTEX Test(PRIMARY_ID test_id STRING)
CREATE VERTEX Test2(PRIMARY_ID test2_id STRING)
CREATE DIRECTED EDGE TEST_TO_TEST2(FROM Test, To Test2)
CREATE UNDIRECTED EDGE TEST2_TO_TEST(FROM Test2, To Test)

Load Data

To load data, you’ll need to define a loading job. To do this, you’ll need to create filename variables and use loading statements:

DEFINE FILENAME f1 = “/path”
LOAD f1 TO VERTEX person($”name”)

Graph Inspection

For this module, you’ll need to be familiar with using your terminal or console for inspecting the graph. You can select which graph you’ll use using the following:

use graph social

Then you can use a variety of other commands. Commands listed include from, to, directed, to, attributes, e_type. Here’s an example:

SELECT * FROM person WHERE var=”Val”

Basic GSQL

The queries you will create will return JSON. You can also use curl to run this graph. Know how to create queries and results.

CREATE QUERY name(VERTEX=person p) FOR GRAPH social;
Start = ()
Result = SELECT tgt from Start:src -{friendship x} -person-tgt

Advanced GSQL

This module reviews accumulators, like OrAccum and AvgAccum and local and global accumulators. These are different ways to accumulate a variable. Remember, to make a global variable, use two @@, else just use a singular @ sign.

Deep Query in GSQL

For deep query, the module went over khop and run query name(parameters).

Other Sources

In this article, I reviewed each video series and provided a summary or description of each. In addition, there are some miscellaneous topics, like how to use gadmin, on the exam. I recommend you also review TigerGraph’s documentation if you have time.

Gadmin: https://www.tigergraph.com/managing-tigergraph-servers-with-gadmin/

TigerGraph Docs: https://www.tigergraph.com/tigergraph-docs-gsql-101/

Original Link to Video Series: https://community.tigergraph.com/t/tigergraph-getting-started-guide/11


You’re Now Ready

This is a textual version of what will be on TigerGraph’s Certification test. Now, go here to get certified and learn more beyond this article. Good luck and happy learning!


You Might Also Like

Trillion edges benchmark: new world record beyond 100TB by TigerGraph featuring AMD based Amazon EC2 instances

Trillion edges benchmark: new world record...

March 13, 2023
Graph Databases 101: Your Top 5 Questions with Non-Technical Answers

Graph Databases 101: Your Top 5...

February 7, 2023
It’s Time to Harness the Power of Graph Technology [Infographic]

It’s Time to Harness the Power...

January 25, 2023

Introducing TigerGraph 3.0

July 1, 2020

Everything to Know to Pass your TigerGraph Certification Test

June 24, 2020

Neo4j 4.0 Fabric – A Look Behind the Curtain

February 7, 2020

TigerGraph Blog

  • Categories
    • blogs
      • About TigerGraph
      • Benchmark
      • Business
      • Community
      • Compliance
      • Customer
      • Customer 360
      • Cybersecurity
      • Developers
      • Digital Twin
      • eCommerce
      • Emerging Use Cases
      • Entity Resolution
      • Finance
      • Fraud / Anti-Money Laundering
      • GQL
      • Graph Database Market
      • Graph Databases
      • GSQL
      • Healthcare
      • Machine Learning / AI
      • Podcast
      • Supply Chain
      • TigerGraph
      • TigerGraph Cloud
    • Graph AI On Demand
      • Analysts and Research
      • Customer 360 and Entity Resolution
      • Customer Spotlight
      • Development
      • Finance, Banking, Insurance
      • Keynote
      • Session
    • Video
  • Recent Posts

    • Trillion edges benchmark: new world record beyond 100TB by TigerGraph featuring AMD based Amazon EC2 instances
    • Overview of Graph and Machine Learning with TigerGraph | Mar 8 @ 11am PST
    • Gartner Data & Analytics Summit 2023, London
    • Gartner Data and Analytics Summit, Orlando
    • Transaction Surveillance with Maximum Flow Algorithm
    TigerGraph

    Product

    SOLUTIONS

    customers

    RESOURCES

    start for free

    TIGERGRAPH DB
    • Overview
    • Features
    • GSQL Query Language
    GRAPH DATA SCIENCE
    • Graph Data Science Library
    • Machine Learning Workbench
    TIGERGRAPH CLOUD
    • Overview
    • Cloud Starter Kits
    • Login
    • FAQ
    • Pricing
    • Cloud Marketplaces
    USEr TOOLS
    • GraphStudio
    • TigerGraph Insights
    • Application Workbenches
    • Connectors and Drivers
    • Starter Kits
    • openCypher Support
    SOLUTIONS
    • Why Graph?
    industry
    • Advertising, Media & Entertainment
    • Financial Services
    • Healthcare & Life Sciences
    use cases
    • Benefits
    • Product & Service Marketing
    • Entity Resolution
    • Customer 360/MDM
    • Recommendation Engine
    • Anti-Money Laundering
    • Cybersecurity Threat Detection
    • Fraud Detection
    • Risk Assessment & Monitoring
    • Energy Management
    • Network & IT Management
    • Supply Chain Analysis
    • AI & Machine Learning
    • Geospatial Analysis
    • Time Series Analysis
    success stories
    • Customer Success Stories

    Partners

    Partner program
    • Partner Benefits
    • TigerGraph Partners
    • Sign Up
    LIBRARY
    • Resources
    • Benchmark
    • Webinars
    Events
    • Trade Shows
    • Graph + AI Summit
    • Million Dollar Challenge
    EDUCATION
    • Training & Certifications
    Blog
    • TigerGraph Blog
    DEVELOPERS
    • Developers Hub
    • Community Forum
    • Documentation
    • Ecosystem

    COMPANY

    Company
    • Overview
    • Careers
    • News
    • Press Release
    • Awards
    • Legal
    • Patents
    • Security and Compliance
    • Contact
    Get Started
    • Start Free
    • Compare Editions
    • Online Demo - Test Drive
    • Request a Demo

    Product

    • Overview
    • TigerGraph 3.0
    • TIGERGRAPH DB
    • TIGERGRAPH CLOUD
    • GRAPHSTUDIO
    • TRY NOW

    customers

    • success stories

    RESOURCES

    • LIBRARY
    • Events
    • EDUCATION
    • BLOG
    • DEVELOPERS

    SOLUTIONS

    • SOLUTIONS
    • use cases
    • industry

    Partners

    • partner program

    company

    • Overview
    • news
    • Press Release
    • Awards

    start for free

    • Request Demo
    • take a test drive
    • SUPPORT
    • COMMUNITY
    • CONTACT
    • Copyright © 2023 TigerGraph
    • Privacy Policy
    • Linkedin
    • Facebook
    • Twitter

    Copyright © 2020 TigerGraph | Privacy Policy

    Copyright © 2020 TigerGraph Privacy Policy

    • SUPPORT
    • COMMUNITY
    • COMPANY
    • CONTACT
    • Linkedin
    • Facebook
    • Twitter

    Copyright © 2020 TigerGraph

    Privacy Policy

    • Products
    • Solutions
    • Customers
    • Partners
    • Resources
    • Company
    • START FREE
    START FOR FREE
    START FOR FREE
    TigerGraph
    PRODUCT
    PRODUCT
    • Overview
    • GraphStudio UI
    • Graph Data Science Library
    TIGERGRAPH DB
    • Overview
    • Features
    • GSQL Query Language
    TIGERGRAPH CLOUD
    • Overview
    • Cloud Starter Kits
    TRY TIGERGRAPH
    • Get Started for Free
    • Compare Editions
    SOLUTIONS
    SOLUTIONS
    • Why Graph?
    use cases
    • Benefits
    • Product & Service Marketing
    • Entity Resolution
    • Customer Journey/360
    • Recommendation Engine
    • Anti-Money Laundering (AML)
    • Cybersecurity Threat Detection
    • Fraud Detection
    • Risk Assessment & Monitoring
    • Energy Management
    • Network Resources Optimization
    • Supply Chain Analysis
    • AI & Machine Learning
    • Geospatial Analysis
    • Time Series Analysis
    industry
    • Advertising, Media & Entertainment
    • Financial Services
    • Healthcare & Life Sciences
    CUSTOMERS
    read all success stories

     

    PARTNERS
    Partner program
    • Partner Benefits
    • TigerGraph Partners
    • Sign Up
    RESOURCES
    LIBRARY
    • Resource Library
    • Benchmark
    • Webinars
    Events
    • Trade Shows
    • Graph + AI Summit
    • Graph for All - Million Dollar Challenge
    EDUCATION
    • TigerGraph Academy
    • Certification
    Blog
    • TigerGraph Blog
    DEVELOPERS
    • Developers Hub
    • Community Forum
    • Documentation
    • Ecosystem
    COMPANY
    COMPANY
    • Overview
    • Leadership
    • Careers  
    NEWS
    PRESS RELEASE
    AWARDS
    START FREE
    Start Free
    • Request a Demo
    • SUPPORT
    • COMMUNITY
    • CONTACT
    Dr. Jay Yu

    Dr. Jay Yu | VP of Product and Innovation

    Dr. Jay Yu is the VP of Product and Innovation at TigerGraph, responsible for driving product strategy and roadmap, as well as fostering innovation in graph database engine and graph solutions. He is a proven hands-on full-stack innovator, strategic thinker, leader, and evangelist for new technology and product, with 25+ years of industry experience ranging from highly scalable distributed database engine company (Teradata), B2B e-commerce services startup, to consumer-facing financial applications company (Intuit). He received his PhD from the University of Wisconsin - Madison, where he specialized in large scale parallel database systems

    Todd Blaschka | COO

    Todd Blaschka is a veteran in the enterprise software industry. He is passionate about creating entirely new segments in data, analytics and AI, with the distinction of establishing graph analytics as a Gartner Top 10 Data & Analytics trend two years in a row. By fervently focusing on critical industry and customer challenges, the companies under Todd's leadership have delivered significant quantifiable results to the largest brands in the world through channel and solution sales approach. Prior to TigerGraph, Todd led go to market and customer experience functions at Clustrix (acquired by MariaDB), Dataguise and IBM.