1

Shortest Path of Vertex Sets

This algorithm can be used to find all shortest paths between vertex sets. It can be used to analyze the relationships between blocks in scenarios such as Internet social networking, financial risk control, road network transportation, and logistics delivery.

Commercial use

Shortest Path of Vertex Sets

1

Creating a graph using an industry template

This helps enterprises implement an efficient and sustainable asset management system. The graphs help enterprises optimize management, reduce costs, and improve work efficiency. In this way, customers can quickly experience the powerful analysis and scenario-specific response of graphs in an easy-to-use environment, lowering the technical requirements for using GES.

Commercial use

Querying and Analyzing Graphs

2

Changing the background color of the graph editor page

The graph editor consists of the algorithm library, Gremlin, canvas, result display, and filtering and property areas. The background color changes from white to black. When analyzing and querying a graph, you can view the graph change in the canvas area more clearly.

Commercial use

Introduction to the Graph Editor

1

Filtered Shortest Path

This algorithm searches for the shortest path that meets the filter criteria between vertices. If there are multiple shortest paths, any one of them is returned. It is applicable to scenarios such as path planning and network planning. It finds the shortest path based on vertex and edge filter criteria

Commercial use

Filtered Shortest Path

1

Selecting a directory during data import; clearing graphs

When importing data, you can select a directory as required or clear the graph data.

Commercial use

Clearing a Graph

1

Creating empty graphs; importing incremental data

You can create an empty graph and import incremental data.

Commercial use

Incrementally Importing Data to Graphs

1

Task Center

GES provides the Task Center page for you to view the task status.

Commercial use

Task Center

1

Ten-thousand-edge specifications

Ten-thousand-edge graphs are cost-effective and mainly used by college students and developers.

Commercial use

Getting Started with GES

1

Permission control for fine-grained user permissions management

The GES Administrator and GES Operator roles are added.

Commercial use

Restrictions

1

GES has been put into commercial use and become the first commercial enterprise-class native graph computing engine in China.

GES facilitates querying and analysis of graph-structure data based on various relationships. It is specifically suited for scenarios requiring analysis of rich relationship data, including social relationship analysis, recommendations, precision marketing, public opinions and social listening, information communication, and anti-fraud.

Commercial use

Graph Engine Service Service Overview

1

Graph data export for smooth upgrade of graph instances

You can export the graph data to a custom OBS directory.

OBT

Exporting a Graph

1

"Black Technology" and "New Technology" at China International Big Data Industry Expo 2018

Efficient data organization facilitates analysis and querying of graphs with tens of billions of vertices and hundreds of billions of edges. Optimized distributed graph processing engine supports high-concurrency, multi-hop, and real-time queries in seconds.

OBT

/

2

Algorithms such as All Shortest Paths and Node2vec

To meet the requirements of various scenarios, GES provides extensive basic graph algorithms, graph mining algorithms, and graph metrics algorithms.

OBT

Algorithm List

1

Real-time Recommendation

Compared with conventional recommendation algorithms, the recommendation effect is improved over 30%. The Real-time Recommendation algorithm is based on the random walk model and is used to recommend nodes that are similar (have similar relationships or preferences) to the input node.

OBT

Real-time Recommendation

1

GES (OBT)

GES uses Huawei-developed native graph engine EYWA as its kernel and has multiple proprietary patents.

Open beta test (OBT)

/