Hypergraph data storage method and apparatus with temporal characteristic and hypergraph data query method and apparatus with temporal characteristic

A hypergraph data query method, wherein a hypergraph comprises a node and a hyperedge, the hyperedge is an edge connected to any quantity of nodes, and the method is used to query a corresponding first hyperedge from a plurality of file directories in a file system based on a first number, and comprises:

• determining, based on the first number, a first storage table that stores first hyperedge data, and reading the first hyperedge data from the first storage table, wherein the first storage table is located in a first file, the first file is located in a first file directory, the first file further comprises a second storage table that stores first target data of a node, and the first target data comprises a number of the node and a relationship between the first hyperedge and the node;
• reading first storage location information from the first hyperedge data, wherein the first storage location information indicates a storage location of a node connected to the first hyperedge in the second storage table;
• reading first target data of N nodes from the second storage table based on the first storage location information;
• and
• returning raw edge data of the first hyperedge based on at least the first target data of the N nodes.

A hypergraph data query method with a temporal characteristic, wherein a hypergraph comprises a node and a hyperedge, the hyperedge is an edge connected to any quantity of nodes, the method is used to query a plurality of corresponding hyperedges from a file system based on a first time interval, each file directory in the file system has a corresponding time window, and the method comprises:

• determining several target file directories whose time windows are comprised in the first time interval from the file system based on the first time interval;
• reading data of any first hyperedge from a first storage table in any target file in any target file directory, wherein the data comprises a target number of the first hyperedge and first storage location information, and the first storage location information indicates a storage location of a node connected to the first hyperedge in a second storage table;
• reading first target data of N nodes from the second storage table in the target file based on the first storage location information, wherein the first target data comprises a number of the node and a relationship between the first hyperedge and the node;
• determining raw edge data of the hyperedge based on at least the first target data of the N nodes and the target number;
• and
• determining a set of raw edge data determined from all files in the several target file directories as query result data.