US 12,189,639 B2
Method of processing information, electronic device, and storage medium
Yang Wang, Beijing (CN); and Xunchao Song, Beijing (CN)
Assigned to Beijing Baidu Netcom Science Technology Co., Ltd., Beijing (CN)
Filed by Beijing Baidu Netcom Science Technology Co., Ltd., Beijing (CN)
Filed on Mar. 13, 2023, as Appl. No. 18/182,986.
Claims priority of application No. 202210249115.9 (CN), filed on Mar. 14, 2022.
Prior Publication US 2023/0229665 A1, Jul. 20, 2023
Int. Cl. G06F 7/00 (2006.01); G06F 16/22 (2019.01); G06F 16/2458 (2019.01)
CPC G06F 16/2471 (2019.01) [G06F 16/2228 (2019.01)] 19 Claims
OG exemplary drawing
 
1. A method of processing an information, comprising:
determining a first information to be queried, in response to receiving a first query request;
querying an information associated with the first information to be queried from a current graph database, so as to obtain a first query result;
determining at least one federation node to be queried, according to at least one of the first query result and the first information to be queried; and
sending a second query request to the at least one federation node to be queried, so that the at least one federation node to be queried queries, in response to receiving the second query request, an information associated with a second information to be queried contained in the second query request from a graph database corresponding to the at least one federation node to be queried, so as to obtain at least one second query result;
wherein the current graph database comprises at least one data version identification, a plurality of node information corresponding to the data version identification and at least one edge information corresponding to the data version identification, the node information comprises at least one node label of a node and at least one node attribute corresponding to the node label, the edge information comprises an edge label of an edge and at least one edge attribute corresponding to the edge label, and the edge label indicates a relationship between two nodes connected by the edge;
wherein the first information to be queried comprises at least one selected from: a time period to be queried, a node to be queried, or an edge to be queried.