Data storage method and apparatus
By separating and determining the location of data in Redis storage, the problem of balancing performance and cost when reducing Redis storage memory is solved, achieving efficient storage performance while reducing memory usage.
CN115878616BActive Publication Date: 2026-07-21CHONGQING UNISINSIGHT TECH CO LTD
View PDF 2 Cites 0 Cited by
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHONGQING UNISINSIGHT TECH CO LTD
- Filing Date
- 2022-11-29
- Publication Date
- 2026-07-21
AI Technical Summary
Technical Problem
The existing technology faces the problem that reducing Redis storage memory can not simultaneously achieve both effectiveness and cost.
Method used
The data to be stored is obtained from the target memory, separated into an identifier part and a data part, the location of the data part in the target memory is determined, and the table index is calculated using a preset table size to form a table identifier. The storage location of the target table in the free static linked list is then determined, and the data is stored. After storage is completed, the free static linked list is updated.
Benefits of technology
While reducing Redis storage memory, we also consider cost and improve storage performance.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN115878616B_ABST
Abstract
The present disclosure relates to the technical field of file processing, and provides a data storage method and device. The method comprises: obtaining to-be-stored data from a target memory, performing separation processing on the to-be-stored data to obtain an identification part and a data part; determining a first position of the data part in the target memory, calculating a first table index using the first position and a preset table size, and composing a table identification using the identification part and the first table index; determining a second position to be stored by the to-be-stored data in a target table corresponding to the table identification in an idle static linked list; storing the to-be-stored data from the second position in the target table, and calculating a third position of an end of storage of the to-be-stored data in the target table after completing the storage, and updating the idle static linked list using the third position.
Need to check novelty before this filing date? Find Prior Art