CN107145306B - Distributed data storage method and system - Google Patents
Distributed data storage method and system Download PDFInfo
- Publication number
- CN107145306B CN107145306B CN201710288001.4A CN201710288001A CN107145306B CN 107145306 B CN107145306 B CN 107145306B CN 201710288001 A CN201710288001 A CN 201710288001A CN 107145306 B CN107145306 B CN 107145306B
- Authority
- CN
- China
- Prior art keywords
- storage
- storage device
- failed
- data
- port information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0727—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a storage system, e.g. in a DASD or network based storage system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
Abstract
The invention provides a distributed data storage method, which comprises the following steps: dividing a storage space of a distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device; and monitoring the working state of each storage device, and when a failed storage device exists, determining the specific position of the failed part in the failed storage device according to any one or more of the starting physical address, the port information or the storage device identifier, and determining the whole failed data group. The method of the invention is adopted to carry out data restoration on the failure part in the failure storage device, namely the first data set replaces all the data sets of the failure part, the method is convenient and fast, the accuracy is high, the time is saved, and the loss is further reduced.
Description
Technical Field
The present invention relates to the field of distributed data storage technologies, and in particular, to a distributed data storage method and system.
Background
In the prior art, the problem of disk failure is handled through data redundancy, generally, each piece of data can be stored on three or more disks, and when a certain disk fails, the remaining two copies can be used for data recovery, so that data loss when the disk is damaged or a storage module is down is prevented. In practice, however, the data recovery strategy must be well designed, or else the problem of data loss is still encountered. When an enterprise builds a storage cluster, a lot of storage servers and disks are usually purchased in the same batch, and disks in the same batch often have similar hardware specifications and drive firmware, that is, a condition of simultaneous failure may occur.
The conventional scheme for dealing with the disk failure problem is to increase the number of copies, that is, modify the original three-copy strategy into four copies, and this simple and rough scheme will seriously increase the storage cost of enterprises, and in addition, after the number of copies is increased, the write performance of data will also be reduced, so that it is not a good scheme.
Generally speaking, the data of the user has obvious cold and hot differences, and the hotter data, i.e. the data accessed more often, is the more important data for the user. This is also an embodiment of the well-known principle of locality in computer systems, i.e. there is a high probability that data accessed by a user at a certain time of day will still need to be accessed in the future. Distributed storage systems provide high availability, even if one copy of data is corrupted, when a user accesses this data, it can still be read from the other copy and returned to the user. However, for important hot data accessed by a user, if the important hot data cannot be repaired as soon as possible, the important data will be lost if the disk continues to be damaged, and the loss to the user is larger.
Disclosure of Invention
The invention provides a distributed data storage method and a distributed data storage system to solve the technical problem that data loss occurs when a disk is damaged and cannot be repaired as soon as possible.
A distributed data storage method, comprising the steps of:
dividing a storage space of a distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device;
monitoring the working state of each storage device, and when a failed storage device exists, determining the specific position of the failed part in the failed storage device according to any one or more of the starting physical address, the port information or the storage device identifier, and determining the whole failed data group;
querying a storage device which survives in the same storage layer, and searching a first data group which corresponds to all data groups of the failed part, wherein the physical address length of the first data group is not less than all data groups of the failed part;
a first data set is selected to replace all data sets of the failed portion.
As an implementation manner, the finding and obtaining the starting physical addresses and the port information of all the storage devices and allocating a unique storage device identifier to each storage device specifically includes the following steps:
setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier to each storage device;
and inquiring the initial physical address and the port information of the corresponding storage equipment according to the code and the unique storage equipment identifier.
As an implementation manner, when the number of the failed storage devices is more than two, a recovery order is generated according to the position order of the storage layer where the failed storage device is located, and the failed storage device is replaced according to the recovery order.
As an implementation manner, the replacement of the failed storage device according to the recovery order means that at least one surviving storage device migrates data into the failed storage device.
As one possible implementation, the failed storage device includes at least one of a failed storage device and a data-damaging device.
A distributed data storage system comprises a hierarchical query module, a monitoring module, a query module and a replacement module;
the storage layering module is used for dividing a storage space of the distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device;
the monitoring module monitors the working state of each storage device, and when a failed storage device exists, the monitoring module determines the specific position of the failed part in the failed storage device according to any one or more of the initial physical address, the port information or the storage device identifier and determines all the failed data groups;
the query module is used for querying the surviving storage devices in the same storage layer and searching a first data group corresponding to all the data groups of the failed part, wherein the physical address length of the first data group is not less than all the data groups of the failed part;
and the replacing module is used for selecting the first data group to replace all the data groups of the failed part.
As an implementable embodiment, the hierarchical query module is configured to:
the searching and obtaining the initial physical addresses and the port information of all the storage devices and allocating a unique storage device identifier for each storage device specifically include the following steps:
setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier to each storage device;
and inquiring the initial physical address and the port information of the corresponding storage equipment according to the code and the unique storage equipment identifier.
As an implementation manner, the replacement module is configured to, when the number of the failed storage devices is more than two, generate a recovery order according to a position order of the storage tier where the failed storage device is located, and replace the failed storage device according to the recovery order.
As an implementation manner, the replacing module is configured to replace the failed storage device according to the recovery order, where at least one surviving storage device migrates data to the failed storage device.
As an implementable embodiment, the monitoring module is configured to: the failed storage device comprises at least one of a failed storage device and a data-damaging device.
Compared with the prior art, the invention has the beneficial effects that:
the invention relates to a distributed data storage method, which comprises the following steps: dividing a storage space of a distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device;
monitoring the working state of each storage device, and when a failed storage device exists, determining the specific position of the failed part in the failed storage device according to any one or more of the starting physical address, the port information or the storage device identifier, and determining the whole failed data group;
querying a storage device which survives in the same storage layer, and searching a first data group which corresponds to all data groups of the failed part, wherein the physical address length of the first data group is not less than all data groups of the failed part;
a first data set is selected to replace all data sets of the failed portion.
The invention relates to a distributed data storage system, which comprises a layered query module, a monitoring module, a query module and a replacement module; the storage layering module is used for dividing a storage space of the distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device;
the monitoring module monitors the working state of each storage device, and when a failed storage device exists, the monitoring module determines the specific position of the failed part in the failed storage device according to any one or more of the initial physical address, the port information or the storage device identifier and determines all the failed data groups;
the query module is used for querying the surviving storage devices in the same storage layer and searching a first data group corresponding to all the data groups of the failed part, wherein the physical address length of the first data group is not less than all the data groups of the failed part;
and the replacing module is used for selecting the first data group to replace all the data groups of the failed part.
The method of the invention is adopted to carry out data restoration on the failure part in the failure storage device, namely the first data set replaces all the data sets of the failure part, the method is convenient and fast, the accuracy is high, the time is saved, and the loss is further reduced.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a schematic partial flow diagram of the present invention;
fig. 3 is a schematic diagram of the system structure of the present invention.
Detailed Description
The above and further features and advantages of the present invention will be apparent from the following, complete description of the invention, taken in conjunction with the accompanying drawings, wherein the described embodiments are merely some, but not all embodiments of the invention.
Please refer to the following examples
Exemplary method
The invention relates to a distributed data storage method, as shown in fig. 1, comprising the following steps:
a distributed data storage method, comprising the steps of:
s1, dividing the storage space of the distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining the initial physical addresses and port information of all the storage devices and allocating unique storage device identifiers for each storage device;
s2, monitoring the working state of each storage device, and when a fault storage device exists, determining the specific position of the fault part in the fault storage device and determining the whole fault data group according to any one or more of the initial physical address, the port information or the storage device identifier;
s3, inquiring the surviving storage devices in the same storage layer, and searching a first data group corresponding to all the data groups of the failed part, wherein the physical address length of the first data group is not less than all the data groups of the failed part;
and S4, selecting the first data group to replace all the data groups of the failed part.
Further, as shown in fig. 2, the finding and obtaining the starting physical addresses and the port information of all the storage devices and allocating a unique storage device identifier to each storage device specifically includes the following steps:
s11, setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier for each storage device;
s12, according to the codes and the unique storage device identifiers, inquiring the initial physical address and the port information of the corresponding storage devices.
The method of the invention is adopted to carry out data restoration on the failure part in the failure storage device, namely the first data group replaces all the data groups of the failure part, the method is convenient and fast, the accuracy is high, the time is saved, and the loss is further reduced.
The invention also discloses a distributed data storage system, which comprises a layered query module 1, a monitoring module 2, a query module 3 and a replacement module 4, as shown in FIG. 3;
the storage layering module 1 is configured to divide a storage space of a distributed system into multiple storage areas, where each area is provided with a plurality of storage devices, search and obtain starting physical addresses and port information of all the storage devices, and allocate a unique storage device identifier to each storage device;
the monitoring module 2 monitors the working state of each storage device, and when a failed storage device exists, determines the specific position of the failed part in the failed storage device according to any one or more of the initial physical address, the port information or the storage device identifier, and determines all the failed data groups;
the query module 3 is configured to query the storage devices that survive in the same storage tier, and search for a first data group that corresponds to all data groups of the failed portion, where a physical address length of the first data group is not less than all data groups of the failed portion;
and the replacing module 4 is used for selecting the first data group to replace all the data groups of the failed part.
The hierarchical query module 1 is configured to: the searching and obtaining the initial physical addresses and the port information of all the storage devices and allocating a unique storage device identifier for each storage device specifically include the following steps:
setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier to each storage device;
and inquiring the initial physical address and the port information of the corresponding storage equipment according to the code and the unique storage equipment identifier.
Embodiments of the present invention rely on exemplary methods and exemplary systems without departing from this scope.
Example 1
A distributed data storage method, as shown in fig. 1, comprising the steps of:
s1, dividing the storage space of the distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining the initial physical addresses and port information of all the storage devices and allocating unique storage device identifiers for each storage device;
s2, monitoring the working state of each storage device, and when a fault storage device exists, determining the specific position of the fault part in the fault storage device and determining the whole fault data group according to any one or more of the initial physical address, the port information or the storage device identifier;
s3, inquiring the surviving storage devices in the same storage layer, and searching a first data group corresponding to all the data groups of the failed part, wherein the physical address length of the first data group is not less than all the data groups of the failed part;
and S4, selecting the first data group to replace all the data groups of the failed part.
As shown in fig. 2, the finding and obtaining the starting physical addresses and the port information of all the storage devices and allocating a unique storage device identifier to each storage device specifically includes the following steps:
s11, setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier for each storage device;
s12, according to the codes and the unique storage device identifiers, inquiring the initial physical address and the port information of the corresponding storage devices.
In setting a code for each storage layer according to the cold and hot degree of the stored data, the cold data refers to data which is not accessed by people or is accessed rarely, the hot data is data which is accessed frequently by people or is liked by people, the codes are set layer by layer according to the cold and hot degree of the data, then the codes are set for the storage devices of each layer, which is actually equivalent to setting a simple matrix, and the storage devices can be directly searched by searching the codes of the layer number and the device codes.
And when the number of the storage equipment with faults is more than two, generating a recovery sequence according to the storage layer positions of the storage equipment with faults, and replacing the storage equipment with faults according to the recovery sequence. And when the number of the failed storage devices is more than two, generating a recovery sequence according to the positions of the failed storage devices and the storage layer, and replacing the failed storage devices according to the recovery sequence. In general, a layer with high data popularity is replaced with priority over a layer with low data popularity, that is, the higher the data popularity is, the more important the storage layer is to users, so that the repair must be prioritized.
The replacement of the failed storage device according to the recovery sequence means that at least one surviving storage device migrates data to the failed storage device.
In this embodiment, the failed storage device is a failed storage device.
In another embodiment, the failed storage device is one of the data-corrupting devices. The replacement method is the same as that for the failed storage device.
A distributed data storage system comprises a hierarchical query module 1, a monitoring module 2, a query module 3 and a replacement module 4;
the storage layering module 1 is configured to divide a storage space of a distributed system into multiple storage areas, where each area is provided with a plurality of storage devices, search and obtain starting physical addresses and port information of all the storage devices, and allocate a unique storage device identifier to each storage device;
the monitoring module 2 monitors the working state of each storage device, and when a failed storage device exists, determines the specific position of the failed part in the failed storage device according to any one or more of the initial physical address, the port information or the storage device identifier, and determines all the failed data groups;
the query module 3 is configured to query the storage devices that survive in the same storage tier, and search for a first data group that corresponds to all data groups of the failed portion, where a physical address length of the first data group is not less than all data groups of the failed portion;
and the replacing module 4 is used for selecting the first data group to replace all the data groups of the failed part.
The hierarchical query module 1 is configured to: the searching and obtaining the initial physical addresses and the port information of all the storage devices and allocating a unique storage device identifier for each storage device specifically include the following steps:
setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier to each storage device;
and inquiring the initial physical address and the port information of the corresponding storage equipment according to the code and the unique storage equipment identifier.
The replacement module 4 is configured to generate a recovery sequence according to the location of the storage layer of the failed storage device when the number of the failed storage devices is more than two, and replace the failed storage devices according to the recovery sequence.
The replacement module 4 is configured to, in the replacing of the failed storage device according to the recovery sequence, perform data migration on the failed storage device by using at least one surviving storage device. Generally, each data group is stored in at least two storage devices in each storage layer, so that failed storage devices are prevented, and when a failed part of one storage device occurs, the same data group as the failed part can be searched in other storage devices and then replaced.
The monitoring module set 2 is: the failed storage device comprises at least one of a failed storage device and a data-damaging device.
The above-mentioned embodiments are provided to further explain the objects, technical solutions and advantages of the present invention in detail, and it should be understood that the above-mentioned embodiments are only examples of the present invention and are not intended to limit the scope of the present invention. It should be understood that any modifications, equivalents, improvements and the like, which come within the spirit and principle of the invention, may occur to those skilled in the art and are intended to be included within the scope of the invention.
Claims (10)
1. A distributed data storage method, comprising the steps of:
dividing a storage space of a distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device;
monitoring the working state of each storage device, and when a failed storage device exists, determining the specific position of the failed part in the failed storage device according to any one or more of the starting physical address, the port information or the storage device identifier, and determining the whole failed data group;
querying a storage device which survives in the same storage layer, and searching a first data group which corresponds to all data groups of the failed part, wherein the physical address length of the first data group is not less than all data groups of the failed part;
a first data set is selected to replace all data sets of the failed portion.
2. The distributed data storage method according to claim 1, wherein the searching and obtaining the starting physical addresses and port information of all the storage devices and allocating a unique storage device identifier to each storage device specifically includes the following steps:
setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier to each storage device;
and inquiring the initial physical address and the port information of the corresponding storage equipment according to the code and the unique storage equipment identifier.
3. The distributed data storage method according to claim 1, wherein when the number of the failed storage devices is two or more, a recovery sequence is generated according to a position sequence of a storage layer where the failed storage devices are located, and the failed storage devices are replaced according to the recovery sequence.
4. The distributed data storage method of claim 3, wherein said replacing of the failed storage device in recovery order is data migration of at least one surviving storage device into the failed storage device.
5. The distributed data storage method of claim 4, wherein the failed storage device comprises at least one of a failed storage device and a data-compromised device.
6. A distributed data storage system, comprising a storage hierarchy module, a monitoring module, a query module, and a replacement module;
the storage layering module is used for dividing a storage space of the distributed system into a plurality of storage areas, wherein each area is provided with a plurality of storage devices, searching and obtaining initial physical addresses and port information of all the storage devices and allocating a unique storage device identifier for each storage device;
the monitoring module is used for monitoring the working state of each storage device, and when a fault storage device exists, the specific position of the fault part in the fault storage device is determined according to any one or more of the initial physical address, the port information or the storage device identifier, and all the fault data groups are determined;
the query module is used for querying the surviving storage devices in the same storage layer and searching a first data group corresponding to all the data groups of the failed part, wherein the physical address length of the first data group is not less than all the data groups of the failed part;
and the replacing module is used for selecting the first data group to replace all the data groups of the failed part.
7. The distributed data storage system of claim 6, wherein the storage tiering module is configured to:
the searching and obtaining the initial physical addresses and the port information of all the storage devices and allocating a unique storage device identifier for each storage device specifically include the following steps:
setting a code for each storage layer according to the cold and hot degree of the stored data, and allocating a unique storage device identifier to each storage device;
and inquiring the initial physical address and the port information of the corresponding storage equipment according to the code and the unique storage equipment identifier.
8. The distributed data storage system of claim 6, wherein the replacement module is configured to, when the number of failed storage devices is two or more, generate a recovery sequence according to a position sequence of a storage tier where the failed storage devices are located, and replace the failed storage devices according to the recovery sequence.
9. The distributed data storage system of claim 8, wherein the replacement module is configured to replace the failed storage device in the restoration order by at least one surviving storage device migrating data to the failed storage device.
10. The distributed data storage system of claim 6, wherein the monitoring module is configured to: the failed storage device comprises at least one of a failed storage device and a data-damaging device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710288001.4A CN107145306B (en) | 2017-04-27 | 2017-04-27 | Distributed data storage method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710288001.4A CN107145306B (en) | 2017-04-27 | 2017-04-27 | Distributed data storage method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107145306A CN107145306A (en) | 2017-09-08 |
| CN107145306B true CN107145306B (en) | 2020-08-21 |
Family
ID=59774498
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710288001.4A Active CN107145306B (en) | 2017-04-27 | 2017-04-27 | Distributed data storage method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107145306B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109117417B (en) * | 2018-09-29 | 2023-02-17 | 深圳比特微电子科技有限公司 | Computing chip and operation method thereof |
| CN111130899A (en) * | 2019-12-30 | 2020-05-08 | 威创集团股份有限公司 | Service recovery method and system for distributed system |
| CN111488245A (en) * | 2020-04-14 | 2020-08-04 | 深圳市小微学苑科技有限公司 | Advanced management method and system for distributed storage |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105959350A (en) * | 2016-04-22 | 2016-09-21 | 深圳市永兴元科技有限公司 | Distributed data storage method and device |
| CN106201354A (en) * | 2016-07-12 | 2016-12-07 | 乐视控股（北京）有限公司 | Date storage method and system |
-
2017
- 2017-04-27 CN CN201710288001.4A patent/CN107145306B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105959350A (en) * | 2016-04-22 | 2016-09-21 | 深圳市永兴元科技有限公司 | Distributed data storage method and device |
| CN106201354A (en) * | 2016-07-12 | 2016-12-07 | 乐视控股（北京）有限公司 | Date storage method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107145306A (en) | 2017-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11023340B2 (en) | Layering a distributed storage system into storage groups and virtual chunk spaces for efficient data recovery | |
| US10126988B1 (en) | Assigning RAID extents and changing drive extent allocations within RAID extents when splitting a group of storage drives into partnership groups in a data storage system | |
| US11567833B2 (en) | Methods and apparatus to assign indices and relocate object fragments in distributed storage systems | |
| AU2015221548B2 (en) | A computer implemented method for dynamic sharding | |
| US10977124B2 (en) | Distributed storage system, data storage method, and software program | |
| US10365983B1 (en) | Repairing raid systems at per-stripe granularity | |
| US10289336B1 (en) | Relocating data from an end of life storage drive based on storage drive loads in a data storage system using mapped RAID (redundant array of independent disks) technology | |
| US9213731B2 (en) | Determining whether to relocate data to a different tier in a multi-tier storage system | |
| US10254964B1 (en) | Managing mapping information in a storage system | |
| US20100161564A1 (en) | Cluster data management system and method for data recovery using parallel processing in cluster data management system | |
| GB2514810A (en) | Rebuilding data of a storage system | |
| US10296252B1 (en) | Reducing drive extent allocation changes while splitting a group of storage drives into partnership groups in response to addition of a storage drive to an array of storage drives in a data storage system that uses mapped RAID (redundant array of independent disks) technology | |
| CN107145306B (en) | Distributed data storage method and system | |
| US10678643B1 (en) | Splitting a group of physical data storage drives into partnership groups to limit the risk of data loss during drive rebuilds in a mapped RAID (redundant array of independent disks) data storage system | |
| CN102194009A (en) | Database hosting method and database hosting platform system | |
| US11016865B2 (en) | Database-level automatic storage management | |
| US6363457B1 (en) | Method and system for non-disruptive addition and deletion of logical devices | |
| CN114721594A (en) | Distributed storage method, device, equipment and machine readable storage medium | |
| US10977130B2 (en) | Method, apparatus and computer program product for managing raid storage in data storage systems | |
| US20100057989A1 (en) | Method of moving data in logical volume, storage system, and administrative computer | |
| US9684668B1 (en) | Systems and methods for performing lookups on distributed deduplicated data systems | |
| US20160266984A1 (en) | Using duplicated data to enhance data security in raid environments | |
| US11449237B2 (en) | Targetless snapshot system replication data pointer table | |
| CN116974458A (en) | Method, electronic device and computer program product for processing data | |
| US11269530B2 (en) | Method for storage management, electronic device and computer program product |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |