Amplidata N.v.

Western Digital Technologies, Inc.

Hgst Netherlands, B.v.

Frederik De Schrijver

Bastiaan Stougie

Wim De Wispelaere

Romain Raymond Agnes Slootmaekers

Wouter Van Eetvelde

Koen De Keyser

Joost Yervante Damad

Bart De Vylder

Carl Rene D'Halluin

Kristof Mark Guy De Spiegeleer

Jochen Maes

Thomas Demoor

Stijn Devriendt

Arne De Coninck

Sam De Roeck

Lien Joke Boelaert

Nicolas Maria Sylvain Trangez

Jan Doms

Stefaan Vervaet

Annelies Cuvelier

Nicolas Trangez

Example distributed storage systems, delete managers, and methods provide for managing dependent delete operations among data stores. Dependent data operation entries and corresponding dependency sets may be identified in an operations log. Dependent data operations may be identified in each shard and data operation entries. A delete process for the data objects in the dependency set may be delayed until the delete process for the dependent data object completes.

Managing dependent delete operations among data stores

Systems and methods for distributed storage systems using dynamic spreading policies are described. Distributed storage elements may be accessed using various storage paths through hierarchically organized storage system components to store data blocks corresponding to data elements. A higher priority hierarchical spreading policy is selected for determining the storage elements to receive the data blocks. If the first hierarchical spreading policy is determined not to have been met, a lower priority hierarchical spreading policy is selected and the data blocks are stored according to the lower priority hierarchical spreading policy. Data block stored at the lower priority hierarchical spreading policy may automatically be migrated to the higher priority hierarchical spreading policy.

Distributed object storage system with dynamic spreading

A method and computer device for storage and retrieval of a data object on a storage medium. The method includes steps of disassembling the data object into a predetermined number of redundant sub blocks, storing the redundant sub blocks on the storage medium, retrieving at least a predetermined multiple of a minimal spreading requirement of the redundant sub blocks from the storage medium, and assembling the data object from any combination of a particular number of the redundant sub blocks, the particular number corresponding to a predetermined multiple of a minimal spreading requirement. The computer device includes modules for performing the steps.

Object storage system for an unreliable storage medium

A distributed object storage system has a monitoring agent and/or a maintenance agent configured to determine for each of a plurality of repair tasks the actual concurrent failure tolerance of a corresponding repair data object. The actual concurrent failure tolerance corresponds to the number of storage elements that store sub blocks of the repair data object and are allowed to fail concurrently.

Distributed object storage system

There is provided a distributed object storage system that includes several performance optimizations with respect to efficiently storing data objects when coping with a desired concurrent failure tolerance of concurrent failures of storage elements which is greater than two and with respect to optimizing encoding/decoding overhead and the number of input and output operations at the level of the storage elements.

Hybrid distributed storage system

A distributed object storage system comprises an encoding module configured to calculate for a plurality of predetermined values of the spreading requirement the cumulative size of the sub fragment files when stored on the file system with the predetermined block size; and select as a spreading requirement from said plurality of predetermined values a calculated value that is equal to one of said predetermined values for which the cumulative size is minimal.

Distributed object storage system comprising performance optimizations

The present disclosure relates to systems and methods for dynamic sharding of a database comprising data identifiable by keys comprised within a global ordered range. When handling a request for data of at least one key: providing the request to a predetermined shard store; the predetermined shard store verifying, by means of its local subrange collection, whether the at least one key is present in a local subrange of a shard stored on the predetermined shard store; and when at least one key is not present in a local subrange of a shard stored on the predetermined shard store, returning a message comprising the local subrange collection of the predetermined shard store.

Computer implemented method for dynamic sharding

A distributed object storage system includes several performance optimizations with respect to storing very small data objects, very large data objects and CRC calculations.

The invention concerns a distributed object storage system () that comprises a spreading module () which makes a selection of a number of storage elements () being larger or equal to a desired spreading width by means of a spreading policy that comprises rules for selecting storage elements () in function of a first hierarchy level identifier () and/or a second hierarchy level identifier ().

Hierarchical, distributed object storage system

The invention concerns a distributed object storage system () comprising a maintenance agent () instructing an encoding module () to disassemble a repair data object into a specific number of repair sub blocks, this specific number being equal to or greater than said number of missing sub blocks and less then the predetermined number of sub blocks during a regular storage operation.

Growing community of inventors

Wenduine, Belgium

Frederik De Schrijver