Scality, S.a.

Vianney Rancurel

Giorgio Regni

Benoit Artuso

Guillaume Gimenez

Jean-Marc Saffroy

David Pineau

Bertrand Demiddelaer

Mudit Verma

Olivier Lemarié

Alain Tauch

Jonathan Gramain

Lam Pham Sy

A method is described that includes providing a snapshot counter for a storage system implemented with multiple distributed consistent database instances. The method further includes recognizing the taking of a snapshot of the storage system by incrementing the snapshot counter from a first snapshot counter value to a second snapshot counter value. The method further includes, in response to a first change for one of the distributed consistent databases subsequent to the taking of the snapshot, performing the following: saving state information of the distributed consistent database as the state information existed prior to the change and associating the first snapshot counter value to the state information. Associating the second snapshot counter's value with the distributed consistent database having the first change. Another method for the taking of a snapshot of a distributed consistent database is also described.

Snapshots and forks of storage systems using distributed consistent databases implemented within an object store

A storage system is described. The storage system includes an object store having a plurality of objects to implement a quota policy or a part of a relational database. The plurality of objects include a first plurality of immutable objects, a second plurality of immutable objects and a head object. The first plurality of immutable objects contain information kept within the database. The second plurality of immutable objects contain a hierarchy of pages for accessing the first plurality of immutable objects. The plurality of objects also include a mutable object that contains a mapping table that maps identifiers of the pages to identifiers of objects of the second plurality of immutable objects. The information is one of: quota policy information; information within a table of a relational database; a stripe of a thin provisioned file.

Distributed consistent database implementation within an object store

A method is described. The method includes fragmenting data of an object for storage into an object storage system into multiple data fragments and performing a first error correction encoding process on the data to generate one or more parity fragments for the object. The method also includes sending the multiple data fragments and the one or more parity fragments over a network to different storage servers of the object storage system. The method also includes performing the following at each of the different storage servers: i) incorporating the received one of the multiple data fragments and one or more parity fragments into an extent comprising multiple fragments of other objects; ii) performing a second error correction encoding process on multiple extents including the extent to generate parity information for the multiple extents; and, iii) storing the multiple extents and the parity information.

Layered error correction encoding for large scale distributed object storage system

A storage system is described. The storage system includes an object store having a plurality of objects containing information. The storage system also includes a cluster of locking nodes to implement a distributed synchronization locking mechanism. The cluster of locking nodes include a proposer node and a plurality of acceptor nodes. The proposer node to broadcast to the acceptor nodes a proposed lock on at least some of the information. The acceptor nodes to vote on the proposed lock based on respective locking information kept in a local store of each acceptor node.

Locking and I/O improvements of systems built with distributed consistent database implementations within an object store

An apparatus is described including a large scale distributed storage system. The large scale distributed storage system includes an object store. The large scale distributed storage system includes a plurality of connector nodes coupled to the object store. The connector nodes are to provide access to the object store for respective users that are respectively coupled to the connector nodes. The connector nodes are to provide the following services for the respective users: a snapshot of a storage system implemented within said object store; branching from a snapshot taken of said storage system implemented within said object store; locking of information kept within said storage system implemented within said object store.

Object storage system capable of performing snapshots, branches and locking

A computer implemented method and system for generating secure universal object identifiers on a multipurpose storage system is disclosed. According to one embodiment, a system comprises a client system in communication with a network. An application server is in communication with the network. A storage cluster is in communication with the network. The storage cluster has a plurality of storage nodes. The client system stores a data object via the application server. The application server generates an object identifier assigned to the data object. The application server stores the data object on a storage node of the plurality of storage nodes. The data object is moved to another application server without moving contents of the data object in the storage cluster.

Method for generating universal objects identifiers in distributed multi-purpose storage systems

A method and system having a probabilistic offload engine for distributed hierarchical object storage devices is disclosed. According to one embodiment, a system comprises a first storage system and a second storage system in communication with the first storage system. The first storage system and the second storage system are key/value based object storage devices that store and serve objects. The first storage system and the second storage system execute a probabilistic algorithm to predict access patterns. The first storage system and the second storage system execute a probabilistic algorithm to predict access patterns and minimize data transfers between the first storage system and the second storage system.

Probabilistic offload engine for distributed hierarchical object storage devices

A multipurpose storage system based upon a distributed hashing mechanism with transactional support and failover capability is disclosed. According to one embodiment, a system comprises a client system in communication with a network, a secondary storage system in communication with the network, and a supervisor system in communication with the network. The supervisor system assigns a unique identifier to a first node system and places the first node system in communication with the network in a location computed by using hashing. The client system stores a data object on the first node system.

Growing community of inventors

La Frette s/Seine, France

Vianney Rancurel