A Fast Method of Acquiring File Increment Based on Memory Operation
A file and memory technology, which is applied in the field of fast acquisition of file increments based on memory calculations, can solve the problems of slow calculation speed, consumption, and manual intervention, and achieve fast incremental calculation speed, obvious incremental acquisition, and low memory consumption Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0019] The present invention is specifically described below in conjunction with accompanying drawing, as Figure 1-6 shown.
[0020] Step 1, select 2 files that need to get increments. (The old file is called A file, the new file is called B file, and the incremental file is called C file)
[0021] Step 2: Build a 32-point Tire Tree with a depth of D in the memory. The specific depth can be reasonably selected according to the file size or hardware environment. The recommended depth is 4-6.
[0022] The data structure of Tire Tree is as follows figure 1 Shown:
[0023] Step 3: Get the Hash value of file A line by line, select D (4~6) bits in the Hash value as the TireTree index according to the memory and file size, and find the leaf node pointer of the Tire Tree one by one according to the index.
[0024] TireTree as figure 2 Shown (N=32):
[0025] Step 4: Create a text information node at the leaf node, store the Hash value of each line of text and a part of the orig...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


