CN109117292B - Cluster storage method and device and cluster storage system - Google Patents
Cluster storage method and device and cluster storage system Download PDFInfo
- Publication number
- CN109117292B CN109117292B CN201710480600.6A CN201710480600A CN109117292B CN 109117292 B CN109117292 B CN 109117292B CN 201710480600 A CN201710480600 A CN 201710480600A CN 109117292 B CN109117292 B CN 109117292B
- Authority
- CN
- China
- Prior art keywords
- storage
- allowed
- cluster
- servers
- file
- 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
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- 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/0709—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 distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
-
- 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/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/062—Securing storage systems
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Human Computer Interaction (AREA)
- Databases & Information Systems (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A method of cluster storage, comprising: determining the number of storage servers allowed to fail according to a preset erasure code and the number of cluster storage servers; determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the erasure codes and the number of the storage servers allowed to fail; and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server. A cluster storage device and a cluster storage system are provided. The scheme can ensure the high availability of the storage system and the safety of data in limited storage resources.
Description
Technical Field
The embodiment of the invention relates to but not limited to internet communication and cloud computing technologies, in particular to a cluster storage method and device and a cluster storage system.
Background
With the continuous development of internet communication and cloud computing technologies, the stored data is increased explosively, and higher requirements are put forward on the number of storage server hardware and the safety and reliability of a cluster storage system.
In order to ensure high availability and data security of an existing cluster storage system, a redundancy strategy generally adopts two modes, namely a multi-copy mode or an Erasure Code (EC) mode, so as to ensure that normal services of the whole system are not affected when a certain node fails or crashes. The copy mode generally adopts 2 copies, and tolerates the fault or downtime of the server where the 1 copy is located. In the erasure code mode, a data file is divided into N data blocks with equal length by setting different N and M (both positive integers) values, and the N + M data blocks are generated by RS (Reed-Solomon) and other codes and stored on different storage nodes. According to any N blocks in the N + M data blocks, the original file can be restored, and the storage node where the M data blocks are located is tolerant of failure or downtime. If N is 6 and M is 2, the storage node is generally configured with N + M, which is a total of 8 servers, in order to ensure the security and reliability of data. 2 storage nodes are tolerated to be simultaneously in fault or downtime, and the normal use of the service is not influenced. In order to ensure data security, the storage server in the prior art must be greater than or equal to N + M, a large number of storage servers are needed, and the cost is too high.
Disclosure of Invention
The embodiment of the invention provides a cluster storage method and device and a cluster storage system, which are used for ensuring the high availability and the data security of the storage system in limited storage resources.
A method of cluster storage, comprising:
determining the number of storage servers allowed to fail according to a preset erasure code and the number of cluster storage servers;
determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the erasure codes and the number of the storage servers allowed to fail;
and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server.
Optionally, the determining the number D of storage servers allowed to fail according to the preset erasure code N, M and the number S of clustered storage servers is determined by:
d is less than or equal to (M × S)/(N + M) rounded down, wherein N, M is a positive integer.
Optionally, the determining, according to the erasure code M and the number D of storage servers allowed to fail, the number C of copies of the storage file chunk at most allowed to be stored on each storage server is determined by:
c is equal to M/D integer, wherein M is a positive integer.
Optionally, N is a positive integer between 1 and 10, and M is a positive integer between 1 and 6.
An apparatus of cluster storage, comprising:
the first determining module is used for determining the number of storage servers allowed to have faults according to a preset erasure code and the number of the cluster storage servers;
the second determining module is used for determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the erasure codes and the number of the storage servers allowed to have faults;
and the selection module is used for coding the partitioned file copies according to the redundancy strategy of the erasure code after receiving the write request message, and selecting the storage server for storage according to the copy number of the storage file blocks which are allowed to be stored at most on each storage server.
Optionally, the first determining module determines, according to the preset erasure code parameter N, M and the number S of the cluster storage servers, the number D of storage servers allowed to fail, by: d is less than or equal to (M × S)/(N + M) rounded down, wherein N, M is a positive integer.
Optionally, the second determining module determines, according to the erasure code M and the number D of storage servers allowed to fail, the number C of copies of the storage file block allowed to be stored at most on each storage server, which is determined by: c is equal to M/D integer, wherein M is a positive integer.
Optionally, N is a positive integer between 1 and 10, and M is a positive integer between 1 and 6.
An apparatus of cluster storage, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of:
determining the number of storage servers allowed to fail according to a preset erasure code and the number of cluster storage servers;
determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the erasure codes and the number of the storage servers allowed to fail;
and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server.
A cluster storage system comprises a plurality of storage servers and the cluster storage device.
The embodiment of the invention provides a cluster storage method and device and a cluster storage system, which can realize the high availability and the data security of the storage system in limited storage resources.
Drawings
Fig. 1 is a flowchart of a cluster storage method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a cluster storage apparatus according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of a cluster storage system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features of the embodiments in the present application may be arbitrarily combined with each other without conflict.
Example one
Fig. 1 is a flowchart of a cluster storage method according to an embodiment of the present invention, and as shown in fig. 1, the method according to the embodiment includes:
and step 13, after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the number of the copies of the file partitions which are allowed to be stored at most on each storage server.
The method of the embodiment can fully utilize the limited storage resources and ensure the high availability of the storage system and the safety of data.
The erasure code mode divides a data file into N data blocks with equal length by setting different N and M (both positive integers) values, generates N + M data blocks by RS (Reed-Solomon ) and other codes, and stores the data blocks on different storage nodes. In this embodiment, under the condition of limited storage resources, an erasure code pattern (EC N: M: D) redundancy policy is implemented, where N takes a value range: 1-10, wherein the value range of M is as follows: 1-6, wherein N, M are all positive integers.
D is the number of servers which are in failure or are down, and the value of D is calculated according to a certain algorithm according to the limited total number (S) of the storage servers, namely: d is less than or equal to (M × S)/(N + M) rounded down. For example, the whole cluster storage system has only 5 storage servers, and with EC 6:2 redundancy, D is equal to 1, and D cannot be greater than 1.
According to the RS encoding algorithm, when equal to or less than M data blocks are lost, the lost data blocks can be recovered by RS encoding. D ═ M × S)/(N + M) ensures that the number of data blocks stored on the failed storage server is less than or equal to the value of M.
In an embodiment, when selecting a storage server to which a file block is stored, the cluster storage system controls the number of copies stored on any storage server according to the number (D) of servers that are allowed to fail or go down, and calculates the number (C) of copies that are allowed to store the file block at most on each storage server, where: and C is rounded by M/D.
According to the method, the number C of the data blocks on the storage servers is less than or equal to M/D according to the condition that D is (M x S)/(N + M), C is (N + M)/S, and the condition that when a certain storage server fails or a downtime service accesses to a normal mode is ensured
For example: adopting an EC 6:2, D is 1 redundancy strategy, and the maximum number of allowed storage copies on a single storage server is 2; with the configuration 10:3, D is 1, the number of copies of a file chunk allowed to be stored on a single storage server is at most 3.
In this embodiment, under the condition that the resource of the storage server is limited, based on an erasure code N: M redundancy policy, when the block file copies are stored, the storage server where the block file copies are to be stored is located according to a consistent Hash (Hash) algorithm, and whether the number of existing block file copies on the current storage server is less than C is counted, where: and C is rounded by M/D. If the value is less than C, the storage server is selected, otherwise, other storage servers are selected. And when a certain storage server fails or crashes, the normal access of the service is ensured, and the storage data is safe.
Example two
Fig. 2 is a schematic diagram of a cluster storage apparatus according to an embodiment of the present invention, and as shown in fig. 2, the apparatus according to the embodiment includes:
the first determining module is used for determining the number of storage servers allowed to have faults according to a preset erasure code and the number of the cluster storage servers;
the second determining module is used for determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the erasure codes and the number of the storage servers allowed to have faults;
and the selection module is used for coding the partitioned file copies according to the redundancy strategy of the erasure code after receiving the write request message, and selecting the storage server for storage according to the copy number of the storage file blocks which are allowed to be stored at most on each storage server.
The device of the embodiment can fully utilize the limited storage resources and ensure the high availability of the storage system and the data security.
In an embodiment, the first determining module determines the number D of storage servers allowed to fail according to the preset erasure code parameter N, M and the number S of cluster storage servers, by: d is less than or equal to (M × S)/(N + M) rounded down, wherein N, M is a positive integer.
In an embodiment, the second determining module determines, according to the erasure code parameter M and the number D of storage servers allowed to fail, the number C of copies of at most file blocks allowed to be stored on each storage server, which is determined by: c is equal to M/D integer, and M is a positive integer.
Wherein N is a positive integer between 1 and 10, and M is a positive integer between 1 and 6.
An embodiment of the present invention further provides a device for cluster storage, including: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of:
determining the number of storage servers allowed to fail according to a preset erasure code and the number of cluster storage servers;
determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the erasure codes and the number of the storage servers allowed to fail;
and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server.
EXAMPLE III
Fig. 3 is a schematic diagram of a cluster storage system according to an embodiment of the present invention, and as shown in fig. 3, the cluster storage system according to this embodiment includes a plurality of storage servers and the above cluster storage device, and may further include a network management subsystem, where,
the functional modules in the cluster storage device may be divided differently, and may include: the system comprises a management module, a database module and a file access module.
The network management subsystem is used for the functions of cluster storage system deployment, storage system configuration management, monitoring, alarming, performance display and the like, provides a visual interface and is convenient for system maintenance and setting.
The application program accesses the cluster storage System through standard interfaces such as NFS (Network File System)/CIFS (Common Internet File System)/POSIX (Portable Operating System Interface of UNIX)/FTP (File Transfer Protocol).
The method for storing the cluster storage system comprises the following steps:
step 101, when a cluster storage system is deployed/opened, setting an EC N/M numerical value in a network management subsystem according to service requirements and the number of current cluster storage servers, wherein the N value range is as follows: 1-10, wherein the value range of M is as follows: 1-6. The number of the cluster storage servers is configured: and S, the network management subsystem sends the relevant configuration data to the database module through a Transmission Control Protocol (TCP), and the database module stores the configuration data on a local disk.
And step 102, the database module calculates the number D of servers which are allowed to fail or go down according to the N, M and the S value, and stores the number D on the local disk.
D, value calculation algorithm: d is less than (M x S)/(N + M), rounded down. If 5 storage servers are configured in the cluster storage system, and an EC 6:2 redundancy strategy is adopted, the number D of the servers which are allowed to break down or go down is 1.
103, the application program accesses the cluster storage system through NFS, when receiving a write request message of the application program, the file access module sends a creation request to the management module, the management module writes metadata information carried in the write request message to the database module, and returns an erasure code N, M redundancy policy information to the file access module;
step 104, the file access module encodes according to an erasure code N, M redundancy strategy and sends a request message for storing the position of the block file copy to the management module, the management module transfers a related request to the database module, the database module locates a server to be stored in the block file copy according to a consistent Hash algorithm, and meanwhile, whether the number of the existing block file copies on the storage server is less than C is calculated, wherein: and C is rounded by M/D. If the number of the storage servers is smaller than C, the server is selected, otherwise, other storage servers in the cluster are selected, the management module sends the information of the selected storage servers to the file access module, and the file access module writes the information of the selected storage servers into the selected storage servers according to the block files.
And 105, when D storage servers are in fault or crash, the erasure code N: M and the system provide normal read-write service, for example, the cluster system has 5 storage servers, adopts EC 6:2 and has one server crash, the number of the blocked copies stored on any one storage server is 2 according to the high-reliability system method, and the cluster system can provide normal read-write service.
An embodiment of the present invention further provides a device for cluster storage, including: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of:
determining the number of storage servers allowed to fail according to a preset erasure code parameter N, M and the number of cluster storage servers, wherein N, M are positive integers;
determining the copy number of the storage file blocks allowed to be stored at most on each storage server according to the parameter M of the erasure code and the number of the storage servers allowed to fail;
and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server.
At present, in order to improve market competitiveness of products, video monitoring or other similar products can reduce the number of storage servers, improve system storage redundancy, reduce hardware cost, and avoid that the normal use of services and data safety are affected when some or part of servers are in fault or breakdown.
It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing the relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a magnetic or optical disk, and the like. Alternatively, all or part of the steps of the above embodiments may be implemented using one or more integrated circuits. Accordingly, each module/unit in the above embodiments may be implemented in the form of hardware, and may also be implemented in the form of a software functional module. The present invention is not limited to any specific form of combination of hardware and software.
The foregoing is only a preferred embodiment of the present invention, and naturally there are many other embodiments of the present invention, and those skilled in the art can make various corresponding changes and modifications according to the present invention without departing from the spirit and the essence of the present invention, and these corresponding changes and modifications should fall within the scope of the appended claims.
Claims (6)
1. A method of cluster storage, comprising:
rounding down by D which is less than or equal to (M x S)/(N + M) according to a preset erasure code N, M and the number S of the cluster storage servers, wherein N, M is positive integers, and determining the number D of storage servers which are allowed to fail;
according to the erasure code M and the number D of the storage servers allowed to fail, taking C as M/D for rounding, wherein M is a positive integer, and determining the copy number C of the storage file blocks allowed to be stored at most on each storage server;
and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server.
2. The method of claim 1, wherein:
n is a positive integer between 1 and 10, and M is a positive integer between 1 and 6.
3. An apparatus of cluster storage, comprising:
a first determining module, configured to round down by D less than or equal to (M × S)/(N + M) according to a preset erasure code N, M and a number S of clustered storage servers, where N, M is a positive integer, and determine a number D of storage servers that are allowed to fail;
a second determining module, configured to determine, according to the erasure code M and the number D of storage servers allowed to fail, a copy number C of at most allowed storage file blocks on each storage server, where C is equal to M/D rounded, where M is a positive integer;
and the selection module is used for coding the partitioned file copies according to the redundancy strategy of the erasure code after receiving the write request message, and selecting the storage server for storage according to the copy number of the storage file blocks which are allowed to be stored at most on each storage server.
4. The apparatus of claim 3, wherein:
n is a positive integer between 1 and 10, and M is a positive integer between 1 and 6.
5. An apparatus of cluster storage, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of:
rounding down by D which is less than or equal to (M x S)/(N + M) according to a preset erasure code N, M and the number S of the cluster storage servers, wherein N, M is positive integers, and determining the number D of storage servers which are allowed to fail;
according to the erasure code M and the number D of the storage servers allowed to fail, taking C as M/D for rounding, wherein M is a positive integer, and determining the copy number C of the storage file blocks allowed to be stored at most on each storage server;
and after receiving the write request message, coding the partitioned file copies according to the redundancy strategy of the erasure code, and selecting a storage server for storage according to the copy number of the file partitions which are allowed to be stored at most on each storage server.
6. A cluster storage system comprising a plurality of storage servers and the apparatus of cluster storage of claim 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710480600.6A CN109117292B (en) | 2017-06-22 | 2017-06-22 | Cluster storage method and device and cluster storage system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710480600.6A CN109117292B (en) | 2017-06-22 | 2017-06-22 | Cluster storage method and device and cluster storage system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109117292A CN109117292A (en) | 2019-01-01 |
| CN109117292B true CN109117292B (en) | 2021-07-13 |
Family
ID=64732692
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710480600.6A Active CN109117292B (en) | 2017-06-22 | 2017-06-22 | Cluster storage method and device and cluster storage system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109117292B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110209670B (en) * | 2019-05-09 | 2022-03-25 | 北京猫盘技术有限公司 | Data processing method and device based on network storage device cluster |
| CN110990189A (en) * | 2019-11-29 | 2020-04-10 | 北京金山云网络技术有限公司 | Data storage method and device, electronic equipment and computer readable storage medium |
| CN112882908B (en) * | 2019-11-29 | 2023-08-01 | 北京百度网讯科技有限公司 | Method and device for generating information |
| CN117240873B (en) * | 2023-11-08 | 2024-03-29 | 阿里云计算有限公司 | Cloud storage system, data reading and writing method, device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103838860A (en) * | 2014-03-19 | 2014-06-04 | 华存数据信息技术有限公司 | File storing system based on dynamic transcript strategy and storage method of file storing system |
| CN103984607A (en) * | 2013-02-08 | 2014-08-13 | 华为技术有限公司 | Distributed storage method, device and system |
| CN105630418A (en) * | 2015-12-24 | 2016-06-01 | 曙光信息产业(北京)有限公司 | Data storage method and device |
| CN106527993A (en) * | 2016-11-09 | 2017-03-22 | 北京搜狐新媒体信息技术有限公司 | Mass file storage method and device for distributed type system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10073738B2 (en) * | 2015-08-14 | 2018-09-11 | Samsung Electronics Co., Ltd. | XF erasure code for distributed storage systems |
-
2017
- 2017-06-22 CN CN201710480600.6A patent/CN109117292B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103984607A (en) * | 2013-02-08 | 2014-08-13 | 华为技术有限公司 | Distributed storage method, device and system |
| CN103838860A (en) * | 2014-03-19 | 2014-06-04 | 华存数据信息技术有限公司 | File storing system based on dynamic transcript strategy and storage method of file storing system |
| CN105630418A (en) * | 2015-12-24 | 2016-06-01 | 曙光信息产业(北京)有限公司 | Data storage method and device |
| CN106527993A (en) * | 2016-11-09 | 2017-03-22 | 北京搜狐新媒体信息技术有限公司 | Mass file storage method and device for distributed type system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109117292A (en) | 2019-01-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2908254A1 (en) | Data redundancy implementation method and device | |
| US8751897B2 (en) | Distributed system for fault-tolerant data storage | |
| CN109117292B (en) | Cluster storage method and device and cluster storage system | |
| CA2751358C (en) | Distributed storage of recoverable data | |
| US9626245B2 (en) | Policy based hierarchical data protection | |
| KR101960993B1 (en) | Efficient application-aware disaster recovery | |
| US10042566B2 (en) | Intelligent read strategy within a dispersed storage network (DSN) | |
| US7925856B1 (en) | Method and apparatus for maintaining an amount of reserve space using virtual placeholders | |
| US20070162523A1 (en) | System and method for storing a data file backup | |
| US10901642B2 (en) | Managing data container instances in a dispersed storage network | |
| US20140325260A1 (en) | Slice migration in a dispersed storage network | |
| US11003557B2 (en) | Dynamic data restoration from multiple recovery sites implementing synchronous remote mirroring | |
| CN111045853A (en) | Method and device for improving erasure code recovery speed and background server | |
| US10067998B2 (en) | Distributed sync list | |
| CN115470041A (en) | Data disaster recovery management method and device | |
| CN107589917B (en) | Distributed storage system and method | |
| CN112988461B (en) | Data backup method, edge node, data center and computer storage medium | |
| US10678639B2 (en) | Quasi-error notifications in a dispersed storage network | |
| US10853175B1 (en) | Storage unit (SU) operative to service urgent read requests | |
| US20240045777A1 (en) | Processing of Data Access Requests in a Storage Network | |
| US20230176949A1 (en) | Managing Copy Revisions in a Distributed Storage System | |
| CN116132003A (en) | Video data fault tolerance method, device, equipment and storage medium | |
| CN115408345A (en) | Data storage method and device applied to parallel file system | |
| CN117931512A (en) | Cloud storage-based adaptive fault tolerance method, device, equipment and storage medium | |
| US20180373595A1 (en) | Modifying allocation of storage resources in a dispersed storage network |
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 |