公开(公告)号：US12147473B2

公开(公告)日：2024-11-19

申请号：US17580605

申请日：2022-01-20

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Yinglong Xia ,  Jian Xu ,  Mingzhen Xia

IPC: G06F15/16 ,  G06F9/48 ,  G06F9/50 ,  G06F16/27 ,  G06F16/901

Abstract: Graph data processing methods and system are disclosed. One example method comprises obtaining, by a master node, graph data, wherein the graph data comprises M vertexes and a plurality of directional edges, each edge connects two vertexes, a direction of each edge is from a source to a destination vertex in the two vertexes, and M is an integer greater than two. The node divides the graph data into P non-overlapping shards, where each shard comprises at least one incoming edge directed to at least one vertex in the corresponding shard. The node schedules at least two edge sets comprised in a first shard of the P shards and an associate edge set comprised in a second shard of the P shards for processing by at least two worker nodes.

公开(公告)号：US11120023B2

公开(公告)日：2021-09-14

申请号：US15929739

申请日：2020-05-19

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yinglong Xia ,  Li Zhou ,  Ren Chen

IPC: G06F16/2455 ,  G06F16/2453 ,  G06F16/23 ,  G06F16/901 ,  G06F9/48 ,  G06F9/52

Abstract: A graph processing system for concurrent property graph queries of a property graph implemented in a distributed network computes on respective nodes a subgraph shard represented as edge-sets containing vertices within a certain range. Each node stores data for a subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph. Each subgraph shard also has boundary vertices having edges that connect the subgraph shard to boundary vertices of another subgraph shard. Upon receipt of concurrent queries of the property graph, a query of the subgraph shards is scheduled in accordance with an initial vertex for each concurrent user query. The property graph is traversed by traversing edge-sets within a subgraph shard on each node and during traversal messaging is used to send values of boundary vertices to at least one other node having another subgraph shard sharing the boundary vertices.

公开(公告)号：US20210192375A1

公开(公告)日：2021-06-24

申请号：US17249584

申请日：2021-03-05

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yinglong Xia ,  Kien Luu

IPC: G06N5/04 ,  G06N5/02 ,  G06N20/00

Abstract: An artificial intelligence device for identifying an object in a data set includes processing circuitry configured to receive the data set and a query including object. The processing circuitry selects one or more models using an entity knowledge database that includes a plurality of entities corresponding to objects to be identified. Each of a plurality or recognition models is linked to multiple entities of the entity knowledge database so that the processing circuitry may select multiple recognition models. The processing circuitry then processes the data set using the selected recognition model or models to provide an indication of whether the data set includes the at least one object. The entities may be ontologically coupled in the database so that, even if the object does not have a corresponding entity in the database, the object may be identified using models selected based on the ontology.

公开(公告)号：US20210004374A1

公开(公告)日：2021-01-07

申请号：US15929739

申请日：2020-05-19

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yinglong Xia ,  Li Zhou ,  Ren Chen

IPC: G06F16/2453 ,  G06F16/901 ,  G06F16/2455 ,  G06F16/23 ,  G06F9/52 ,  G06F9/48

Abstract: A graph processing system for concurrent property graph queries of a property graph implemented in a distributed network computes on respective nodes a subgraph shard represented as edge-sets containing vertices within a certain range. Each node stores data for a subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph. Each subgraph shard also has boundary vertices having edges that connect the subgraph shard to boundary vertices of another subgraph shard. Upon receipt of concurrent queries of the property graph, a query of the subgraph shards is scheduled in accordance with an initial vertex for each concurrent user query. The property graph is traversed by traversing edge-sets within a subgraph shard on each node and during traversal messaging is used to send values of boundary vertices to at least one other node having another subgraph shard sharing the boundary vertices.

公开(公告)号：US11256749B2

公开(公告)日：2022-02-22

申请号：US16426287

申请日：2019-05-30

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Yinglong Xia ,  Jian Xu ,  Mingzhen Xia

IPC: G06F15/16 ,  G06F16/901 ,  G06F16/27 ,  G06F9/48 ,  G06F9/50

Abstract: A graph data processing method and a distributed system is disclosed. The distributed system includes a master node and a plurality of worker nodes. The master node obtains master node graph data, divides the graph data to obtain P shards, where the P shards include a first shard and a second shard. The master node determines at least two edge sets from each shard, schedules at least two edge sets included in the first shard to at least two worker nodes for processing, and schedules an associate edge set included in the second shard to the at least two worker nodes for processing, where the associate edge set is an edge set that includes an outgoing edge of a target vertex corresponding to the first shard.