Graphsql, Inc.

Tigergraph, Inc.

Kent State University

Yu Xu

Zixuan Zhuang

Mingxi Wu

Dan Hu

Xinyu Chang

Ruoming Jin

Chengjie Qin

Victor E Lee

Ming Lin

Adam P Anthony

Li Chen

Like Gao

Renchu Song

Systems, methods, and software described herein provide operations to generate and manage a graph. In one implementation, a graph management system may identify a request to generate a graph from multiple databases. In response to the request, the graph management system may identify attributes of interest in the databases and generate vertices that correspond to the attributes of interest. As the new vertices are generated, the graph management system may determine attributes that are related to the same entity, generate entity vertices that correspond to the entities identified in the databases, and generate edges that connect the attribute vertices to the corresponding entity vertices.

Graph creation from multiple databases

Systems, methods, and software described herein provide enhancements for managing permissions in a shared graph. In one implementation, a graph management system identifies a request to classify a first subgraph in the graph for access by a tenant of a plurality of tenants, wherein the request indicates one or more vertex types and/or one or more edge types for the first subgraph. The graph management system further identifies one or more vertices and/or one or more edges in the graph that qualify for the first subgraph based on the indicated one or more vertex types and/or one or more edge types, and allocates permissions to at least one user associated with the tenant to access the first subgraph.

Tenant based permission allocation for a graph database

A system for querying a graph model and methods for making and using same. An initial vertex set can be received for one or more query blocks. The one or more query blocks can be executed to generate respective output vertex sets. The output vertex sets and the initial vertex set can be enabled to interconnect in a vertex-set-flow graph based on the query blocks. The vertex-set-flow graph can have a Directed Acyclic Graph shape. A selected query block can generate an output vertex set based on an input vertex set with or without traversal over an edge. A selected query block can calculate a runtime attribute. Edges and/or vertices of the graph model can be updated during querying. A selected block can call a graph query as a generic function. Functions for querying the graph model are powerful and can advantageously meet various graph query needs.

System and method for querying a graph model

Systems, methods, and software described herein provide graph searching via index vertices. In one implementation, a graph management system may receive a request to identify vertices of a first vertex type in a graph, wherein the request defines one or more attributes associated with the vertices. In response to the request, the graph management system may identify one or more index vertices associated with the one or more attributes, wherein the one or more index vertices is associated with one or more second vertex types. The graph management system may further identify the vertices in the graph with edges that couple to the one or more index vertices.

Graph search using index vertices

Systems and methods for enhanced detection of fraudulent electronic transactions are disclosed. In one embodiment, a system uses the ongoing stream of transactions to construct and maintain a dynamically evolving merchant relationship graph. When a proposed transaction is submitted to the system, the system computes a predicted likelihood that the given account would make a transaction with these characteristics with the given merchant. The graph is used to compute transitive relatedness between merchants which may be indirectly associated with one another, as well as to compute aggregate relatedness, when there are multiple avenues of relationship between two merchants.

System and method for enhanced detection of fraudulent electronic transactions

Disclosed herein are systems, methods, and software for redirecting relational data queries to previously generated graphs. In one example, a method of operating a graph redirect system includes identifying a relational data query and identifying whether at least one previously generated graph in a group of one or more previously generated graphs relates to the relational data query based on similarity data. The method further provides, in response to identifying that at least one previously generated graph relates to the relational data query, directing the relational data query to the at least one previously generated graph, and responding to the relational data query using the at least one previously generated graph.

Redirecting graph queries

Systems, methods, and software described herein provide improvements to graph indexing. In one implementation, a graph management system may identify an event to generate a new vertex type to index a graph based on an attribute type in one or more vertices of the graph. In response to the event, the graph management system may generate one or more new indexing vertices that correspond to the new vertex type and may connect each of the one or more vertices to the one or more new indexing vertices based on an attribute in the vertex.

Management of graphs using secondary index vertices

A system for managing graph data and methods for making and using same. A loading plan can be generated according to a loading job. Source data can be loaded into the graph model based on the loading plan. The loading job can be defined declaratively. An interpreter can encode the loading job to generate the loading plan having a tree structure. The loading plan can instruct a loading engine to load the source data. The loading engine can be compiled independent of the loading plan. Advantageously, the loading engine can be compiled no more than once. The compiled loading engine can interpret any loading plan. The compiled loading engine can filter or transform the source data at runtime of the loading. Advantageously, time for compiling the loading engine and reading source data can be saved. Graph data loading can have high flexibility and high performance.

System and method for managing graph data

Methods and systems for distributed computation of graph data permit edge collection and vertex collection, each to be partitioned among a plurality of computational units. In one embodiment, the methods employ a two-phase computational cycle, which is repeated until the computation is complete. In a first phase, processing units process each active edge and vertex by doing the following: reading their current attribute values, executing programmed computational functions, updating edge attributes and sending data messages to vertices. In a second phase, each vertex update processor processes each of its active vertices by doing the following: reading its current attribute values and received data messages, executing a programmed computational function, and updating the vertex's attribute values.

Methods and systems for distributed computation of graph data

Systems, software, and methods are described herein dynamically generate traversal code for a graph analytics environment. In one example, a method of dynamically generating traversal code for a graph analytics environment includes, in one or more processing systems, identifying a query expression for a relational analytics environment. The method further includes generating the traversal code for the graph analytics environment based on the query expression, and executing the traversal code in the graph analytics environment on a graphical database. The method also provides communicating results of the traversal code to the relational analytics environment.

Growing community of inventors

Millbrae, CA, United States of America

Yu Xu