Method to increase random I/O performance with low memory overheads
US9430156B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 12, 2014 |
| Grant date | Aug 30, 2016 |
| Priority date | — |
| Expiry date | Mar 11, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F3/0685
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In response to a request for stored data, retrieving an index entry, based on an identifier of the requested data, corresponding to an indexed block of storage containing the requested data. The index entry includes a start location of an indexed storage block and sub-block locators that identify the start of one or more sub-blocks within the indexed storage block. The sub-block containing the requested data is determined and the corresponding sub-block locator is read to find the starting location of the sub-block. Without reading the entire indexed storage block, the sub-block may be read from the starting location of the sub-block, decompressed, and the decompressed requested data read from the sub-block may be transmitted to the client. In this way, fewer I/O operations are needed that read the requested data, and memory needed for storing index information is minimized.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.