CPC G06F 16/9024 (2019.01) [G06F 16/90335 (2019.01)] | 20 Claims |
1. A method, comprising:
storing, by a computer system, data in a database, wherein the data is indicative of a graph data structure that includes a plurality of nodes connected by a plurality of edges;
determining, by the computer system, that a number of edges connected to a first node of the plurality of nodes satisfies a threshold number;
in response to the determining:
storing, by the computer system in an index row associated with the first node, a first index identifying a first row as having a first range of values corresponding to edges connected to the first node and a second row as having a second range of values corresponding to edges connected to the first node, wherein values within the first and second ranges are of a first data type supported by the first index;
storing, by the computer system in the index row, a second index associated with the first node, the second index identifying a third row as having a third range of values corresponding to edges connected to the first node, wherein values within the third range are of a second data type;
storing, by the computer system in the first row, the values within the first range;
storing, by the computer system in the second row, the values within the second range;
storing, by the computer system in the third row, values within the third range of values; and
wherein the values in the first and second ranges are usable to indicate properties of corresponding ones of the plurality of edges.
|