Distributed data storage method and system based on erasure code
A distributed data and erasure code technology, applied in the field of distributed data storage methods and systems based on erasure codes, can solve problems such as user time extension, delay dependence, disk performance waste, etc., to ensure consistency and integrity Sexual, low-latency effects
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0028] figure 2 It is a flow chart of the erasure code-based distributed data storage method provided in the first embodiment of the present invention, image 3 It is a sequence diagram of the erasure code-based distributed data storage method provided by the first embodiment of the present invention. Please refer to figure 2 and image 3 , the present embodiment mainly describes the flow process of data writing (uploading files), and the method in the present embodiment includes the following steps:
[0029] In step S11, the client sends a data write request to the cache server, and the data write request includes data to be stored.
[0030] Before making a data write request, the client can fragment a large file, that is, divide a large file into multiple fragments, so as to ensure the performance balance of the overall access. The size of the slice can be set according to the actual situation, and the specific implementation manner of the present invention is not limi...
no. 2 example
[0048] Figure 5 It is a flow chart of the erasure code-based distributed data storage method provided by the second embodiment of the present invention; Image 6 It is a sequence diagram of the erasure code-based distributed data storage method provided by the second embodiment of the present invention. This embodiment is based on the first embodiment, and mainly describes the main process of data acquisition (file download), please refer to Figure 5 and Image 6 , the method in this embodiment includes the following steps:
[0049] In step S21, the client sends a data acquisition request to the cache server, and the data acquisition request includes the key value of the data to be acquired.
[0050] In step S22, the cache server checks whether the data to be acquired is locally stored according to the key value, and if so, directly returns the data to be acquired to the client, otherwise, executes step S23.
[0051] Step S23, the cache server sends the data acquisition ...
no. 3 example
[0056] Figure 7 It is a flow chart of the erasure code-based distributed data storage method provided by the second embodiment of the present invention; Figure 8 It is a sequence diagram of the erasure code-based distributed data storage method provided by the second embodiment of the present invention. This embodiment is based on the first embodiment, and mainly describes the main process of data deletion (file deletion), please refer to Figure 7 and Figure 8 , the method in this embodiment includes the following steps:
[0057] Step S31, the client sends a data deletion request to the cache server, and the data deletion request includes the key value of the data to be deleted;
[0058] Step S32, the cache server finds and deletes the locally stored data to be deleted according to the key value;
[0059] Step S33, the cache server sends the data deletion request to the storage server;
[0060] Step S34, the storage server searches for and deletes data index informati...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


