Stored data with temporal proximity analysis for very large scale data with very low built in latency

A method for retrieving data from a content addressable memory system having a location addressable high-dimensional store and a plurality of content addressable store levels each is associated with a reference to data in the location addressable high-dimensional store, the method comprising:

• mapping the location addressable high-dimensional store to a sparse distributed memory space;
• searching a content addressable store level for a desired content word using at least one temporal attribute within a Hamming space;
• retrieving data from the sparse distributed memory space via the location addressable high-dimensional store which has been mapped, using data reference associated with the desired content word if the desired content word is found;
• and
• analyzing the data which has been retrieved from the sparse distributed memory space by
• converting, by a hashing logic, the data retrieved into a first logical address and payload data;
• translating, by a hardware translation unit, the first logical address into a first physical address on a storage device;
• comparing, by a hardware exclusive OR (XOR) unit, a first address vector for the first logical address to a second address vector for a second logical address to derive a Hamming distance between the first and second logical addresses;
• and
• retrieving, by a hardware retrieval unit, other payload data that is stored at a second physical address whose second logical address is within a predefined Hamming distance within the Hamming space from the first logical address, wherein a Hamming distance between the first logical address and the second logical address is derived by the hardware XOR unit.

A computer program product for retrieving data from a content addressable memory system having a location addressable high-dimensional store and a plurality of content addressable store levels each is associated with a reference to data in the location addressable high-dimensional store, the product having a computer readable non-transitory storage medium comprising program code operable for:

• mapping the location addressable high-dimensional store to a sparse distributed memory space;
• searching a content addressable store level for a desired content word using at least one temporal attribute within a Hamming space;
• retrieving data from the sparse distributed memory space via the location addressable high-dimensional store which has been mapped, using data reference associated with the desired content word if the desired content word is found;
• and
• analyzing the data which has been retrieved from the sparse distributed memory space by
• converting, by a hashing logic, the data retrieved into a first logical address and payload data;
• translating, by a hardware translation unit, the first logical address into a first physical address on a storage device;
• comparing, by a hardware exclusive OR (XOR) unit, a first address vector for the first logical address to a second address vector for a second logical address to derive a Hamming distance between the first and second logical addresses;
• and
• retrieving, by a hardware retrieval unit, other payload data that is stored at a second physical address whose second logical address is within a predefined Hamming distance within the Hamming space from the first logical address, wherein a Hamming distance between the first logical address and the second logical address is derived by the hardware XOR unit.