Graph framework (database methods) to analyze trillion cell reservoir and basin simulation results

A computer-implemented system, comprising:

• a graph/document structure configured to store graph information and relational data in a multi-relational graph of vertices and edges, wherein the multi-relational graph represents, using the vertices of the multi-relational graph, reservoir simulation inputs, objects, outputs, and reservoir simulation results of a reservoir simulation performed on a reservoir using a reservoir simulation model, and wherein the multi-relational graph represents a full set of the relational data and non-relational data included in the reservoir simulation results;
• one or more processors;
• and
• a non-transitory computer-readable storage medium coupled to the one or more processors and storing programming instructions for execution by the one or more processors, the programming instructions instructing the one or more processors to perform operations comprising:
• storing the multi-relational graph from the reservoir simulation results, including generating the relational data and non-relational data in the graph/document structure;
• storing, as vertices in the multi-relational graph, objects of the reservoir, elements of the reservoir simulation results, and inputs of the reservoir simulation model;
• and
• storing, as edges in the multi-relational graph, relationships between vertices, wherein an edge is defined by a pair of vertices in the multi-relational graph, wherein each edge comprises a label defining a dynamic relationship between two vertices connected by a respective edge, the dynamic relationship between two vertices varying relative to a total number of vertices in the multi-relational graph, wherein the dynamic relationship between two vertices changes over time as new vertices are added to the reservoir simulation wherein each edge defines a ternary relationship comprising an operation allowing an edge to have a plurality of time values, wherein the multi-relational graph is a graph G of vertices V and edges E defined as G=(V, E), wherein each edge E=(i, j) is an edge connecting vertices i and j with i, j∈V, wherein each E⊆(V×V), wherein each E⊆(V×Ω×V), with Ω describing the set of edge labels, wherein E⊆(V×Ω×T*×V), wherein T∈{t|tstart≤t≤tend} in which tstart and tend are simulation begin and end dates, respectively.

A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

• storing a multi-relational graph of vertices and edges representing, as the vertices of the multi-relational graph, reservoir simulation inputs, objects, outputs, and reservoir simulation results of a reservoir simulation performed on a reservoir using a reservoir simulation model, wherein the multi-relational graph represents a full set of relational data and non-relational data included in the reservoir simulation results, and wherein the multi-relational graph stores graph information and relational data in a graph/document structure;
• storing, as vertices in the multi-relational graph, objects of the reservoir, elements of the reservoir simulation results, and inputs of the reservoir simulation model;
• and
• storing, as edges in the multi-relational graph, relationships between vertices, wherein an edge is defined by a pair of vertices in the multi-relational graph, wherein each edge comprises a label defining a dynamic relationship between two vertices connected by a respective edge, the dynamic relationship between two vertices varying relative to a total number of vertices in the multi-relational graph, wherein the dynamic relationship between two vertices changes over time as new vertices are added to the reservoir simulation wherein each edge defines a ternary relationship comprising an operation allowing an edge to have a plurality of time values, wherein the multi-relational graph is a graph G of vertices V and edges E defined as G=(V, E), wherein each edge E=(i, j) is an edge connecting vertices i and j with i, j∈V, wherein each E⊆(V×V), wherein each E⊆(V×Ω×V), with Ω describing the set of edge labels, wherein E⊆(V×Ω×T*×V), wherein T∈{t|tstart≤t≤tend} in which tstart and tend are simulation begin and end dates, respectively.