Abstract: A graph of combinations of entities and parameters corresponding to the combinations of entities may be stored as two tables. The first table may comprise a table that includes all entity combinations, as well as each parameter that corresponds to the entity combinations. Each entity combination may additionally be parseable, such that each entity combination may be parsed to allow for identification of each entity included within a given entity combination. The second table may include an entity combination node corresponding to (and linked to) each entity combination stored within the first table. Each given entity combination node of the second table may then be linked within the second table to each nearest neighbor node of the given node to thereby allow for identifying each entity combination within the first table that includes a particular relevant entity (or set of entities).

Abstract: A graph of combinations of entities and parameters corresponding to the combinations of entities may be generated as a table that comprises a single column of entity combinations. Each entity combination may further be stored in a different row of the single column to thereby allow for efficient storage, search, and traversal of the table. Each corresponding parameter may also be stored in a separate column. Furthermore, each entity combination may be stored in a parseable manner, such that each entity combination may be parsed to allow for identification of each entity included within a given entity combination. Traversing the table may further be improved by generating a second table that includes an entity combination node corresponding to (and linked to) each entity combination stored within the first table. Each given node of the second table may be linked to each nearest neighbor node of the given node.

Abstract: A graph of combinations of entities and parameters corresponding to the combinations of entities may be stored as two tables. The first table may comprise a table that includes all entity combinations, as well as each parameter that corresponds to the entity combinations. Each entity combination may additionally be parseable, such that each entity combination may be parsed to allow for identification of each entity included within a given entity combination. The second table may include an entity combination node corresponding to (and linked to) each entity combination stored within the first table. Each given entity combination node of the second table may then be linked within the second table to each nearest neighbor node of the given node to thereby allow for identifying each entity combination within the first table that includes a particular relevant entity (or set of entities).