Optimized data structure

A computer system for storing and retrieving data elements in a computer memory, the computer system comprising:

• a processor;
• and
• a memory communicatively coupled to the processor, the memory comprising software that, when executed by the processor, performs operations that cause the processor to:
• configure, by the processor, the computer memory according to a data structure, the data structure including:
• a data element array including a plurality of sorted data elements, each data element associated with a position in the data element array wherein each data element comprises a key;
• and
• a cluster element array including one or more cluster elements, each cluster element defined by one of one data element from the data element array or a plurality of continuous data elements from the data element array,
• wherein each cluster element is associated with a cluster code for determining the position of one or more data elements in the data element array, the cluster code correlating each data element defining the cluster element with the position of the data element in the data element array;
• wherein the cluster code of each cluster element is determined as a difference between a first data element associated with the cluster element and the position in the data element array where the first data element is stored, wherein the difference is calculated by subtracting the position in the data element array where the first data element is stored from the first data element associated with the cluster element;
• and
• wherein the data structure is associated with an increment value, and wherein two data elements adjacently positioned in the data element array are continuous if a subtraction of one of the two data elements adjacently positioned in the data element array from the other of the two data elements adjacently positioned in the data element array is equal to the increment value.

A data storage and retrieval system for a computer memory, comprising:

• means for configuring the computer memory according to a data structure, the data structure including:
• a data element array including a plurality of sorted data elements, each data element associated with a position in the data element array, wherein each data element comprises a key;
• and
• a cluster element array including one or more cluster elements, each cluster element defined by one of one data element from the data element array or a plurality of continuous data elements from the data element array,
• wherein each cluster element is associated with a cluster code for determining the position of one or more data elements in the data element array, the cluster code correlating each data element defining the cluster element with the position of the data element in the data element array,
• wherein the cluster code of each cluster element is determined as a difference between a first data element associated with the cluster element and the position in the data element array where the first data element is stored, wherein the difference is calculated by subtracting the position in the data element array where the first data element is stored from the first data element associated with the cluster element;
• and
• wherein the data structure is associated with an increment value, and wherein two data elements adjacently positioned in the data element array are continuous if a subtraction of one of the two data elements adjacently positioned in the data element array from the other of the two data elements adjacently positioned in the data element array is equal to the increment value.

A non-transitory memory configured according to a data structure, the data structure comprising:

• a data element array including a plurality of sorted data elements, each data element associated with a position in the data element array, wherein each data element comprises a key;
• an object array corresponding to the data element array, each position of the object array containing an object corresponding to a data element in the corresponding position in the data element array;
• a state array corresponding to the data element array, each position of the state array indicating whether a corresponding position in the data element array contains void data;
• and
• a cluster element array including one or more cluster elements, each cluster element defined by one of one data element from the data element array or a plurality of continuous data elements from the data element array, wherein each cluster element is associated with a cluster code for determining the position of one or more data elements in the data element array, the cluster code correlating each data element defining the cluster element with the position of the data element in the data element array,
• wherein the cluster code of each cluster element is determined as a difference between a first data element associated with the cluster element and the position in the data element array where the first data element is stored, wherein the difference is calculated by subtracting the position in the data element array where the first data element is stored from the first data element;
• and
• wherein the data structure is associated with an increment value, and wherein two data elements adjacently positioned in the data element array are continuous if a subtraction of one of the two data elements adjacently positioned in the data element array from the other of the two data elements adjacently positioned in the data element array is equal to the increment value.

A computer system comprising:

• a memory configured according to a data structure, the data structure comprising:
• a data element array for storing a plurality of data elements, wherein each data element of the plurality of data elements comprises a key;
• an object array corresponding to the data element array, each position of the object array containing an object corresponding to a data element in the corresponding position in the data element array;
• a state array corresponding to the data element array, each position of the state array indicating whether a corresponding position in the data element array contains void data;
• and
• a cluster element array for storing one or more cluster elements, each cluster element defined by one of one data element from the data element array or a plurality of continuous data elements from the data element array, wherein each cluster element is associated with a cluster code correlating each data element defining the cluster element with the position of the data element in the data element array,
• wherein the cluster code of each cluster element is determined as a difference between a first data element associated with the cluster element and the position in the data element array where the first data element is stored, wherein the difference is calculated by subtracting the position in the data element array where the first data element is stored from the first data element associated with the cluster element, and
• wherein the data structure is associated with an increment value, and wherein two data elements adjacently positioned in the data element array are continuous if a subtraction of one of the two data elements adjacently positioned in the data element array from the other of the two data elements adjacently positioned in the data element array is equal to the increment value;
• a request receiver coupled with the memory and operative to receive:
• requests to store data elements in the data structure;
• requests to search for data elements in the data structure;
• and
• requests to delete data elements from the data structure;
• a memory manager coupled with the request receiver and operative to manage the data structure;
• and
• a data transmitter coupled with the memory manager and operative to transmit data responsive to a request received by the request receiver.