A fog storage data redundancy elimination method
A data storage and de-redundancy technology, applied in database indexing, database updating, other database retrieval, etc., can solve problems such as node data redundancy, reduce I/O and improve query speed.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0042] Embodiment 1: The fog storage data de-redundancy method includes the following steps:
[0043] Step S1, the mobile terminal makes a query (storage) request to the administrator of the fog node;
[0044] Step S2, the fog administrator checks the statistical content of the fog process log management server, which are the virtual machine resource occupation table and the service (request) process table;
[0045] Step S3, when the available capacity of the fog node satisfies the request of the mobile terminal, the fog computing (storage) server will process the request, de-duplicate and store (query) the data flow incoming to the fog node;
[0046] Step S4, when the available capacity of the fog node satisfies the request of the mobile terminal, the fog computing (storage) server will process the request, and at the same time, the fog administrator will update the current task processing process, and the fog process log management server will update the resource occupation ...
Embodiment 2
[0047] Embodiment 2: as the optimization of embodiment 1, such as figure 1 and figure 2 As shown, the specific implementation of step S3 is:
[0048] S31, incoming data stream chunking
[0049] The data transmitted from the mobile terminal to the fog node is transmitted to the fog (cloud) computing (storage) server, and the data flow is divided into equal length blocks;
[0050] S32, calculate the data block fingerprint
[0051] Select the MD5 algorithm that generates a smaller fingerprint, and perform hash calculation on the divided data blocks to obtain the fingerprint of each data block. Stored in memory as metadata for each data block;
[0052] S33, calculate the index value
[0053] Calculate the hash of the obtained fingerprint again, get the index (integer), and map it to a fixed-size index table. Each index value corresponds to multiple fingerprints. The red-black tree (RBTree) is used as the data storage structure of the fingerprint, and other in-memory Compare...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 

