Data reconstruction in distributed data storage system with key-based addressing
US9417955B2 · kind B2 · utility
6Cited by
6References
32Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 22, 2014 |
| Grant date | Aug 16, 2016 |
| Priority date | — |
| Expiry date | Dec 11, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2211/1061
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In a Distributed Virtual Array data storage system, data chunks making up data containers are stored in a key order in storage devices according to layouts specified in a layout data structure. When any of the storage devices becomes inaccessible, the storage devices iteratively return, in storage order, their stored chunks. Chunks belonging to the same container are identified and, if that container had a chunk in the inaccessible storage device, are used to reconstruct the inaccessible chunk. The chunks of the container are then stored according to an updated layout. The keys are independent of physical storage locations.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.