Alipay (hangzhou) Information Technology Co., Ltd.

Xiaowei Zhu

Wei Qin

Jiping Yu

Wenguang Chen

Embodiments of this specification disclose graph data partition computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems. A computer-implemented method includes partitioning vertices in graph data into a plurality of dataset. Edges in the graph data are partitioned into datasets that include target vertices of the edges, where the datasets are used by nodes in a distributed cluster to perform graph computation, and where computational loads of the plurality of datasets are similar. Implementations of this specification can achieve load balancing between nodes in the distributed cluster and can reduce communication overhead.

Graph data partitioning

A computer cluster is configured to perform distributed computing on graph data, the computer cluster includes a first computer and a second computer, the first computer is configured to process a vertex in a first vertex set in the graph data, the second computer is configured to process a vertex in a second vertex set in the graph data, the first vertex set includes a first source vertex, the second vertex set includes a first destination vertex corresponding to the first source vertex. A communication method includes: generating information of the first source vertex; determining the second computer based on pre-recorded mapping relationship information, where the second computer is configured to process information of the first destination vertex; and sending a first communication message to the second computer, where the first communication message includes the information of the first source vertex.

Communication method and apparatus applied to computer cluster

A method is applied to a graph database, the graph database stores edge data of a timing graph, the edge data records a plurality of attributes of an edge in the timing graph, the plurality of attributes include a timestamp, an index of the edge data includes a primary index and a secondary index, a value of the primary index is the timestamp, the secondary index stores the plurality of attributes, and a key of the secondary index includes the timestamp. The method includes: receiving a first request, where the first request is used to request to perform an edge scanning operation on the edge data based on a time range; and performing the edge scanning operation on the edge in the timing graph by using the timestamp in the key of the secondary index, to obtain an edge whose timestamp falls within the time range in the timing graph.

Growing community of inventors

Hangzhou, China

Xiaowei Zhu