Constant time data structure for single and distributed networks
AssigneeWells Fargo Bank, N.A.
InventorsGaurav Chhabra, Anil Kumar Omkar, Shreeya Sengupta, Gaurav Wadhwa
Life of this patent
Estimating the term…
Abstract
A data structure is specialized in efficiently representing a key-value pair in a highly optimized way. The data structure is a pointer in a traversal graph that takes advantage of constant time traversal for all operations. The data structure has specific instructions for inserting data nodes, router nodes, and how the expansion or collapse of the graph works. The data structure can be applied where the time to get the result back is most prominent. The data structure can be used to reduce the memory footprint to reach the data that is being searched and achieve a worst-case time complexity in constant time.
Claims20
A computer system capable of traversing a data structure having at least two levels of pointers, comprising:
- one or more processors;
- and
- non-transitory computer-readable storage media encoding instructions which, when executed by the one or more processors, causes the computer system to:
- receive a plurality of data that is contained in the data structure to be traversed;
- generate a hexadecimal digit based on a key;
- in response to a deletion within the data structure, route a node to a proper position inside the data structure at various routing levels by traversing the various levels of the data structure in order of most significant digits of the key to least significant digits, wherein the routing levels are limited;
- and
- insert the node into the data structure with the key and a value.
A computer-implemented method capable of traversing a data structure having at least two levels of pointers, comprising:
- receiving a plurality of data that are contained in the data structure to be traversed;
- generating a hexadecimal digit based on a key;
- in response to a deletion within the data structure, routing a node to a proper position inside the data structure at various routing levels by traversing the various levels of the data structure in order of most significant digits of the key to least significant digits, wherein the routing levels are limited;
- and
- inserting the node into the data structure with the key and a value.
A system for finding a key in a multi-level data structure, comprising:
- one or more processors;
- and
- non-transitory computer-readable storage encoding instructions which, when executed by the one or more processors, causes the system to:
- generate a hexadecimal digit based on the key;
- in response to a deletion within the multi-level data structure, route a node to a proper position inside the multi-level data structure at various routing levels by traversing the various levels of the data structure in order of most significant digits of the key to least significant digits, wherein the routing levels are limited;
- and
- insert the node into the multi-level data structure with the key and a value.
Dependencies are inferred from the claim text.