Efficient key collision handling
US-9846642-B2 · Dec 19, 2017 · US
US10169124B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10169124-B2 |
| Application number | US-201514733895-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 8, 2015 |
| Priority date | Dec 16, 2014 |
| Publication date | Jan 1, 2019 |
| Grant date | Jan 1, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A data structure and a mechanism to manage storage of objects is disclosed. The data structure can be used to manage storage of objects on any storage device, whether in memory or some other storage device. Given an object ID (OID) for an object, the system can identify a tuple that includes a device ID and an address. The device ID specifies the device storing the object, and the address specifies the address on the device where the object is stored. The application can then access the object using the device ID and the address.
Opening claim text (preview).
What is claimed is: 1. A memory management device, comprising: a memory; a data structure stored in the memory, the data structure including: an identifier of an object, wherein the identifier of the object is a hash; and a tuple including an identifier of a physical device and a location on the physical device; and a second data structure, the second data structure including: a second identifier of the object; and the hash, wherein the object is stored on one of a plurality of physical devices including at least one volatile storage device and at least one non-volatile storage device, wherein the second data structure maps the second identifier of the object to the hash and the data structure maps the hash to the tuple to access the object wherein data for the object may be accessed on behalf of an application or an operating system using the second identifier of the object, and wherein the memory management device uses the second identifier of the object, the data structure, and the second data structure to determine the identifier of the physical device and the location on the physical device in the tuple. 2. The memory management device according to claim 1 , wherein the tuple further includes metadata, wherein the metadata is drawn from a set including a security of the object and a sharing of the object. 3. A system, comprising: a computer; a first physical storage device coupled to the computer; a second physical storage device coupled to the computer; a data structure stored in a storage coupled to the computer, the data structure including: an identifier of an object, wherein the identifier of the object is a hash; and a tuple including an identifier of one of the first physical storage device and the second physical storage device and a location on the device identified by the identifier; and a second data structure stored in the storage coupled to the computer, the second data structure including: a second identifier of the object; and the hash, wherein the object is stored on either of the first physical storage device and the second physical storage device, wherein the first physical storage device includes a volatile storage device, wherein the second physical storage device includes a non-volatile storage device, and wherein the second data structure maps the second identifier of the object to the hash and the first data structure maps the hash to the tuple to access the object wherein data for the object may be accessed on behalf of an application or an operating system using the second identifier of the object, and wherein the memory management device uses the second identifier of the object, the data structure, and the second data structure to determine the one of the first physical storage device and the second physical storage device and the location on the device in the tuple. 4. The system according to claim 3 , wherein the tuple further includes metadata, the metadata drawn from a set including a security of the object and a sharing of the object. 5. The system according to claim 3 , wherein: the computer includes a processor that may execute a kernel; and the kernel is operative to allocate memory for an object from the first physical storage device and the second physical storage device. 6. The system according to claim 5 , wherein: the tuple further includes an access counter; and the kernel is further operative to migrate the object from the first physical storage device to the second physical storage device if the access counter crosses a threshold. 7. The system according to claim 5 , wherein: the first physical storage device includes a secure area, the secure area in the first physical storage including a fenced area; and the kernel is operative to allocate storage from the first physical storage device in the secure area if the object is considered secure. 8. A method, comprising: receiving at a processor a request from an application or an operating system to access data for an object, the request including an identifier of the object; using a hash table, translating the identifier of the object to a hash; using an object table, translating the hash to a tuple, the tuple including an identifier of a physical device and a location on the physical device; and accessing the data on behalf of the application or the operating system using the identifier of the physical device and the location on the physical device in the tuple, wherein the physical device is drawn from a set including a volatile storage device and a non-volatile storage device, and wherein the method may support storage of data in both of the volatile storage device and the non-volatile storage device. 9. The method according to claim 8 , the method further comprising: receiving a second request to allocate memory for the object; requesting a kernel to allocate the memory for the object; receiving from the kernel the identifier of the object; and adding an entry to the object table associating the hash with the tuple. 10. The method according to claim 9 , further comprising: hashing the data to generate the hash; and adding an entry to the hash table associating the identifier of the object with the hash. 11. The method according to claim 10 , further comprising: checking the object table to see if the object table already includes the hash; and if the object table already includes the hash, not requesting the kernel to allocate the memory for the object. 12. The method according to claim 9 , wherein: receiving a second request to allocate memory for the object includes receiving the second request to allocate the memory for the object, the second request including metadata pertinent to the object, the metadata drawn from a set including a security of the object and a sharing of the object; and requesting a kernel to allocate the memory for the object includes requesting the kernel to allocate the memory for the object according to the metadata. 13. The method according to claim 12 , wherein adding an entry to the object table associating the hash with the tuple includes adding the entry to the object table associating the hash with the tuple, the tuple including the metadata. 14. The method according to claim 9 , wherein: receiving a second request to allocate memory for the object includes receiving the second request to allocate the memory for the object, the second request specifying that the object is secure; requesting a kernel to allocate the memory for the object includes requesting the kernel to allocate the memory for the object in a secure location on the physical device, the secure location on the physical device including a fenced area; and adding an entry to the object table includes adding the entry to the object table associating the identifier of the object with the tuple, the tuple further including an indicator that the object is secure. 15. The method according to claim 14 , wherein: receiving the second request to allocate memory for the object includes receiving, from the application or the operating system, the second request to allocate the memory for the object, the second request specifying that the object is secure and an indicator of a security process; and requesting a kernel to allocate the memory for the object includes requesting the kernel to allocate the memory for the object in a secure location on the physical device using the security process. 16. The method according to claim 8 , the method further comprising: receiving a third request to de-allocate memory for the object;
at data level, e.g. file, record or object virtualisation · CPC title
in relation to content · CPC title
Saving storage space on storage systems · CPC title
Non-volatile semiconductor memory arrays · CPC title
Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP] · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.