Method and apparatus for querying nondeterministic graph

An apparatus for querying a nondeterministic graph, comprising:

• at least one processor;
• and
• a memory storing instructions executable by the at least one processor, wherein the instructions, when executed by the at least one processor, instruct the at least one processor to:
• receive a query instruction, wherein the query instruction is used to query a nondeterministic graph for data that satisfies a query condition;
• determine two vertices in the nondeterministic graph according to the query instruction;
• determine all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point;
• calculate a probability of a first event or a second event corresponding to each of the paths based on a sorting result of the determined possible paths, wherein:
• the first event corresponding to a path is defined as an event that the path exists, but a first path corresponding to the path does not exist and one or more second paths corresponding to the path do not exist;
• the second event corresponding to the path is defined as an event that the path exists but the first path corresponding to the path does not exist;
• the first path corresponding to a path is another path that comprises a quantity of edges that is less than a quantity of edges comprised in the path;
• and
• a second path corresponding to a path is another path that comprises a quantity of edges that is equal to a quantity of edges comprised in the path;
• and
• obtain, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction,
• wherein the instructions further instruct the at least one processor to:
• select a set quantity of edges from the nondeterministic graph;
• determine a combination event corresponding to the selected edges, wherein the combination event indicates a combination of events that one or more edges in the selected edges exist or do not exist;
• and
• calculate a sum of probabilities of occurrence of all combination events corresponding to the selected edges and use the sum as a first cumulative sum;
• when it is determined that the selected set quantity of edges constitute a path, and corresponding combination events satisfy a definition of the first event, calculate a sum of probabilities of occurrence of the combination events that satisfy the definition of the first event and use the sum as a second cumulative sum;
• or
• when it is determined that the selected set quantity of edges constitute a path, and corresponding combination events satisfy a definition of the second event, calculate a sum of probabilities of occurrence of the combination events that satisfy the definition of the second event and use the sum as a third cumulative sum;
• and
• calculate a sum of probabilities of existence of all paths in all the possible paths and use the sum as a fourth cumulative sum, and determine the probability of the first event according to the first cumulative sum, the second cumulative sum, and the fourth cumulative sum, or determine the probability of the second event according to the first cumulative sum, the third cumulative sum, and the fourth cumulative sum.