公开(公告)号：US20170286484A1

公开(公告)日：2017-10-05

申请号：US15618587

申请日：2017-06-09

Applicant: Huawei Technologies Co., Ltd.

Inventor： Wenfei Fan ,  Xin Wang ,  Yinghui Wu

IPC: G06F17/30

CPC classification number: G06F17/30454 ,  G06F17/30 ,  G06F17/30545 ,  G06F17/30864 ,  G06F17/30958 ,  G06F17/30979

Abstract: A graph data search method and apparatus, where the method includes obtaining a query request including a query condition that carries a start graph node, the query request queries a first to-be-queried graph node matching the query condition from a graph data set, and the graph data set includes the start graph node, a plurality of to-be-queried graph nodes, an association relationship between the start graph node and the plurality of graph nodes, and an association relationship between each to-be-queried graph node and another graph node, filtering out, according to the query condition and a preset available resource condition, a second to-be-queried graph node that does not meet the query condition and an association relationship in the graph data set that includes the second to-be-queried graph node, and performing a query in the reduction subgraph using the query condition.

公开(公告)号：US11514049B2

公开(公告)日：2022-11-29

申请号：US17096292

申请日：2020-11-12

Applicant: Huawei Technologies Co., Ltd. ,  Washington State University

Inventor： Mohammad Hossein Namaki ,  Yinghui Wu ,  Xin Zhang ,  Yonghua Ding

IPC: G06F16/2453 ,  G06F16/215 ,  G06F16/9032

Abstract: A query suggestion to expand an initial query is calculated whereby the cost of the expanded initial query is bounded in both time and quality. The user validates a subset of the top-n answers Q(G) to a query Q and provides adjusted configuration parameters. The top-n diversified δ-expansion terms Q′ are calculated from the validated subset of answers Q(G) to the query Q and are provided to an interactive user interface for selection. Answers Q′(G) for the top-n diversified δ-expansion terms Q′ are cost bounded by cost threshold δ and exploration range r specified by the user. The user selects a new term of terms Q′ and an incremental query evaluation of the new term is invoked to compute expanded query answers Q′(G) by incrementally updating the validated subset of answers Q(G), without re-evaluating an expanded query Q′ including the new term from scratch.

公开(公告)号：US20210064620A1

公开(公告)日：2021-03-04

申请号：US17096292

申请日：2020-11-12

Applicant: Huawei Technologies Co., Ltd. ,  Washington State University

Inventor： Mohammad Hossein Namaki ,  Yinghui Wu ,  Xin Zhang ,  Yonghua Ding

IPC: G06F16/2453 ,  G06F16/9032 ,  G06F16/215

Abstract: A query suggestion to expand an initial query is calculated whereby the cost of the expanded initial query is bounded in both time and quality. The user validates a subset of the top-n answers Q(G) to a query Q and provides adjusted configuration parameters. The top-n diversified δ-expansion terms Q′ are calculated from the validated subset of answers Q(G) to the query Q and are provided to an interactive user interface for selection. Answers Q′(G) for the top-n diversified δ-expansion terms Q′ are cost bounded by cost threshold δ and exploration range r specified by the user. The user selects a new term of terms Q′ and an incremental query evaluation of the new term is invoked to compute expanded query answers Q′(G) by incrementally updating the validated subset of answers Q(G), without re-evaluating an expanded query Q′ including the new term from scratch.

公开(公告)号：US09798774B1

公开(公告)日：2017-10-24

申请号：US15618587

申请日：2017-06-09

Applicant: Huawei Technologies Co., Ltd.

Inventor： Wenfei Fan ,  Xin Wang ,  Yinghui Wu

IPC: G06F7/02 ,  G06F17/30

CPC classification number: G06F17/30454 ,  G06F17/30 ,  G06F17/30545 ,  G06F17/30864 ,  G06F17/30958 ,  G06F17/30979

Abstract: A graph data search method and apparatus, where the method includes obtaining a query request including a query condition that carries a start graph node, the query request queries a first to-be-queried graph node matching the query condition from a graph data set, and the graph data set includes the start graph node, a plurality of to-be-queried graph nodes, an association relationship between the start graph node and the plurality of graph nodes, and an association relationship between each to-be-queried graph node and another graph node, filtering out, according to the query condition and a preset available resource condition, a second to-be-queried graph node that does not meet the query condition and an association relationship in the graph data set that includes the second to-be-queried graph node, and performing a query in the reduction subgraph using the query condition.