Tigergraph, Inc.

Graphsql, Inc.

Zixuan Zhuang

Yu Xu

Mingxi Wu

Dan Hu

Xinyu Chang

Chengjie Qin

Li Chen

Renchu Song

Like Gao

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

A system for updating a target schema of a graph model and methods for making and using same. A schema change job can be run to update the target schema. Loaded source data in the graph model can be updated based on the updated target schema. The schema can be changed at vertex type level, edge type level and attribute level for a pre-defined target schema after source data has been loaded. The loaded source data can be updated to be consistent with the updated target schema without a need of being reloaded. The schema change job can be defined declaratively. The target schema can be versioned and stored to maintain a history of target schema update. Advantageously, schema update can be easy to implement. The time-consuming and expensive reloading process can be avoided. Target schema updating can have high flexibility and high performance.

System and method for updating target schema of graph model

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.

Growing community of inventors

Sunnyvale, CA, United States of America

Zixuan Zhuang