Abstract: Provided is a distributed storage device that reduces the number of inter-node communication in inter-node deduplication. The storage node determines whether data that is a processing target duplicates with data stored in the shared block storage. When it is determined that the data is duplicated, deduplication of the data that is the processing target is performed by storing information on a storage destination of the data related to the duplication with a storage node that processes the data that is the processing target. When a read request of the data is received, the storage node that processes the data that is the processing target reads the data in the shared block storage using the information on the storage destination.

Abstract: A storage unit stores first data including the processing target information and second data including processing history information obtained by processing the processing target information based on a processing request; the first data and the second data include a plurality of data associated with different transactions; servers include a first server and a plurality of second servers; the plurality of second servers synchronize and hold the first data and the second data; and the first server that has received the processing request reads the first data of a processing target from a second server, processes the processing request, stores the second data including the processing history information and the first data reflecting a processing result in an own server, and transmits the second data configured to reflect the processing in the first data of the second server to the second server.

Abstract: To reduce load concentration due to failover. A distributed storage system includes: a plurality of distributed FS servers; and one or more shared storage arrays. The distributed FS servers include logical nodes, which are components of a logical distributed file system, the plurality of logical nodes of the plurality of servers form a distributed file system in which a storage pool is provided, and anyone of the logical nodes processes user data input to and output from the storage pool and inputs and outputs the user data to and from the shared storage array, and the logical node is configured to migrate between the distributed FS servers.

Abstract: A computer system stores management information that manages a workflow and a deletion flag that indicates deletion of data in the workflow hidden from a user. The computer system executes a workflow that includes one or more processes that convert input data into output data. The computer system includes a lineage of the executed workflow including information of the input data and the output data in the management information. The computer system deletes data selected from data in the executed workflow, and sets the deletion flag of the selected data in the management information. The computer system, in response to an access to first data to which the deletion flag is set, regenerate the first data based on the management information and removes the deletion flag of the first data in the management information.

Abstract: A distributed storage places data units and parity units constituting a stripe formed by divided data into storage nodes in a distributed manner. In reference to determination formulas, either a full-stripe parity calculation method or an RPM parity calculation method is selected so as to minimize an amount of network traffic.

Abstract: A computer system (e.g. a file system) for managing blocks, comprises a memory unit including a memory and a processing unit including a processor and coupled to the memory unit. The memory unit is configured to store metadata of data including objects. The metadata points to blocks storing the objects in a storage unit including multiple different sized blocks. The processing unit is configured to, for at least one of the objects, determine different sized blocks for storing the object, from among free blocks in the multiple different sized blocks of the storage unit.

Abstract: A distributed storage system includes a plurality of storage nodes including: a storage device for storing data in such a way that the data can be written thereto and read therefrom; a memory in which a software program is recorded; and a CPU for executing the software program. The memory stores group management information in which a group configured with a plurality of storage nodes and the storage nodes that configure the group are associated with each other and recorded. The CPU converts data into a plurality of data blocks so that the data is redundant at a predetermined data protection level, and stores the data blocks into each of a plurality of storage nodes belonging to the same group based on the group management information.

Abstract: A storage system and a data migration method that appropriately migrate data without adding a device are provided. The storage system includes one or more nodes. A data migration section instructs a data processing section to migrate data of a migration source system to a migration destination system. When the data processing section receives the instruction to migrate the data, and stub information of the data exists, the data processing section reads the data from the migration source system based on the stub information, instructs the migration destination system to write the data, and deletes the stub information. When the migration of the data is completed, the data migration section instructs the migration source system to delete the data.

Abstract: In a distributed storage of data objects in a cluster system, a data object is distributed across a group of node apparatuses in units of data blocks. For each child object, the metadata structure of the respective child object is stored to one of the node apparatuses of the group of node apparatuses for managing locations of data blocks of the data object and includes a root metadata node and one or more direct metadata nodes, optionally further including one or more indirect metadata nodes; and the metadata structure of the parent object is distributed across the plural node apparatuses of the group of node apparatuses for managing locations of child objects of the data object and includes, on each node apparatus of the group of node apparatuses, a root metadata node and one or more direct metadata nodes, optionally further including one or more indirect metadata nodes.

Abstract: A data deduplication device reduces a processing load in deduplication. Storage target data includes a content including a plurality of blocks having a structure in which transaction data and a hash value of a preceding block are associated with each other. A storage includes a storage device and a processor, which (1) acquires a hash value associated with one or more blocks of a chunk including the block in the content, and specifies a fingerprint corresponding to the chunk based on the acquired one or more hash values of the block, (2) determines whether the fingerprint corresponding to the chunk is the same as a fingerprint of a chunk stored in the storage device, and (3) does not store the chunk in the storage device when it is determined to be the same, and stores the chunk in the storage device when it is determined to not be the same.

Abstract: When a second storage device in a second site receives an update notification regarding a first element updated according to a write request from a first host, from a first storage device in a first site, for a second element specified on the basis of the update notification, the second storage device manages data of the first element corresponding to the second element as latest data. The first storage device provides a first volume capable of including a plurality of first elements. The second storage device provides a second volume capable of including a plurality of second elements corresponding to the plurality of first elements. When the second storage device receives a read request from a second host, the second storage device determines whether or not data of the first element corresponding to a read source second element (second element specified from the read request) is the latest data.

Abstract: A data de-duplication in a distributed storage of data objects in a cluster system, in which plural data objects are distributed across a group of node apparatuses and stored in units of data blocks. Each metadata structure including a root metadata node and one or more direct metadata nodes, and optionally including one or more indirect metadata nodes; and a metadata object is stored for managing de-duplicated data blocks based on a metadata structure of the metadata object wherein at least one direct metadata node of the metadata structure of the metadata object includes a block reference pointing to a de-duplicated data block being associated with two or more data objects. Preferably, each of the metadata structures of the two or more data objects being associated with the de-duplicated data block includes a respective direct metadata node including an object reference to the metadata structure of the metadata object.

Abstract: A computer system includes a plurality of task processing nodes capable of executing tasks and a task management node which determines which a task processing node to allocate a new task and each task processing nodes includes a memory capable of caching data to be used by an allocation task which is a task allocated to the task processing node. The task management node stores task allocation history information including a correspondence relationship between the allocation task and the respective task processing node A CPU of the task management node determines a degree of similarity between the new task and the allocated task, determines the task processing node to which the new task should be allocated from the task processing nodes included in the task allocation history information based on the degree of similarity, and allocates the new task.

Abstract: A distributed storage system includes a first node group consisting of a plurality of nodes and a second node group consisting of a plurality of nodes. Each of the first node group and the second node group distributes and stores data of an assigned object to a plurality of constituent nodes. The first node group includes at least one first node shared with the second node group and at least one second node not shared with the second node group. The second node group includes the at least one first node and at least one third node not shared with the first node group.

Abstract: The present disclosure relates to a data storage system, and processes and computer programs for such data storage system, for example including processing of: managing one or more metadata tree structures for storing data to one or more storage devices of the data storage system in units of blocks, each metadata tree structure including a root node pointing directly and/or indirectly to blocks, and a leaf tree level having one or more direct nodes pointing to blocks, and optionally including one or more intermediate tree levels having one or more indirect nodes pointing to indirect nodes and/or direct nodes of the respective metadata tree structure; maintaining the root node and/or nodes of at least one tree level of each of at least one metadata structure in a cache memory; and managing I/O access to data based on the one or more metadata structures, including obtaining the root node and/or nodes of the at least one tree level of the metadata structure maintained in the cache memory from the cache memory an

Abstract: Provided is a distributed ledger device, aiming at easily and appropriately determining a status of operational processing on a distributed ledger in a certain distributed ledger device at another distributed ledger device. A BC node in a BC system including a plurality of BC nodes that manage a distributed ledger for a predetermined target transaction, the BC node including: the storage device; and the processor, in which the storage device stores the distributed ledger, and the processor, when executing processing relating to the distributed ledger, transmits content information indicating contents of the processing to be managed by another BC node that manages the distributed ledger. The processor may transmit an instruction to register the content information in another distributed ledger managed by the plurality of BC nodes that manage the distributed ledger.

Abstract: Efficient pre-reading is performed in data transmission and reception between an Edge node and a Core node. An information processing device includes a storage device, outputs client request data based on a request of a client, and stores predetermined pre-read data in the storage device before the request of the client. The device includes: a relevance calculation module configured to calculate relevance between data based on an access history of the data; and a pre-reading and deletion module configured to determine data to be deleted from the storage device using the relevance when data having predetermined relevance with the client request data is to be stored to the storage device as the pre-read data and a storage capacity of the storage device is insufficient if at least one of the client request data and the pre-read data is to be stored to the storage device.

Abstract: It is provided a storage system comprising at least one controller and a storage device. The at least one controller verifies, for each predetermined storage area within a logical volume provided to the host computer, whether data of the each predetermined storage area is duplicated to another storage area. The storage device holds unshared data associated only with the storage area and shared data associated with the storage area and the another storage area in the case where the data of the each predetermined storage area is identical to the data of the another storage area. The at least one controller reads the unshared data in the case where a request to read the data is received under a state in which the unshared data and the shared data are held, and releases an area in which the unshared data is stored at predetermined timing.

Abstract: An object of the invention is to enable a fine grain access control in a unit finer than an access unit specified in a specification of application software such as a block-chain and a database. A data management system, in which data to be processed by an information processing device is accessed by a file system in which date is accessed in a file unit, stores fine grain access information related to a file to be accessed. The fine grain access information includes a position of the file, an access right to the file, and retention information, and access to the file from the information processing device is controlled based on the fine grain access information. The file includes a block-chain block, and the fine grain access information is stored as an extended attribute in the file including the block-chain block.

Abstract: Each of multiple nodes has a processor, a memory, and a storage region. In a process of updating a stripe, the processors generate an intermediate parity from a data block included in a first node and a parity block included in the first node and included in the stripe to be processed, transfer the intermediate parity to a second node, cause the intermediate parity to be stored as a parity in a block of the second node, and configure the stripe with the data block from which the intermediate parity has been generated, the block storing the parity, and a data block included in a node other than the first and second nodes and included in the stripe to be processed.