Method and device for achieving high-efficient storage of data with non-fixed lengths

Abstract

The invention discloses a method and a device for achieving high-efficient storage of data with non-fixed lengths. The method comprises the following steps: dividing a data storage space into a plurality of blocks, when the data are stored, cutting the to-be-stored data into multiple sections according to sizes of the data storage space blocks, and storing each section of data into one block according to the sequence of each section of data in the to-be-stored data; combining the addresses of the storing blocks into an array chain table according to storing sequence; and saving major keys of the to-be-stored data and the array chain table into an internal storage hash table. The method and the device for achieving the high-efficient storage of the data with the non-fixed lengths can effectively improve utilization rate of the storage space.

Description

technical field [0001] The invention relates to the technical field of data access, in particular to a method and device for realizing high-efficiency storage of variable-length data. Background technique [0002] Data access is one of the most common tasks and functions of application service programs in the wireless Internet field. Since data information varies widely, the size of the same type of information that needs to be stored in the same storage space also varies widely. Therefore, it is necessary to constantly balance between data storage efficiency and disk space utilization maximization to find an optimal solution. [0003] Existing Solution 1: Database [0004] Database technology is a relatively mature data storage technology, forming a complete system and norms. Its disadvantages are: large-scale data reading and writing is slow, and the processing performance of a single data source with high concurrent access is poor. [0005] Existing Solution 2: Sequent...

AI Technical Summary

Problems solved by technology

Its disadvantages are: large-scale data reading and writing is slow, and the processing performance of a single data source with high concurrent access is poor

[0009] 3. When deleting a section of data in the middle, the efficiency of moving forward or subsequent data is slow, or keeping it empty causes waste, and the data operation cannot be completed efficiently

[0013] 2. Since the size of the block is fixed, but the size of the stored data is different, it will cause a lot of waste of storage space in the file, such as figure 1 shown

[0014] It can be seen that the storage space utilization rate of the existing data access technology still needs to be improved

Images