General caching method

Abstract

This invention advances a kind of general slow storage method which is used to fetch the storied data in the slow storage. In that includes: step one, in the slow storage sets up an interface used to fetch the external data connecting with the external data source; step two, separate the slow storage area into multiple slow storage sector and storage one data only in one slow storage sector and then locate the names for every slow storage sector and the data main key value; step three, when the slow storage system receiving the data access request call on the corresponding slow storage sector according to the request access slow storage sector's name and data main key value and then judge the slow storage sector whether storied the request data if it had storied it would output the request data and if not it would fetch the request data from the external data source through the interface and preserve the request data at the slow storage sector and then output it.

Description

technical field [0001] The invention relates to a data processing method, in particular to a data caching method. Background technique [0002] At present, in the application of business software systems, the requirements for system processing performance are getting higher and higher, so frequent database operations and file reading and writing should be avoided. In order to solve the problem of inefficient data reading, the use of caching technology must be considered. Cache is to store certain data in the memory. When the system needs to access this data, it can directly read it from the memory, which reduces the time-consuming of database operations and file reading and writing. In a real environment, for a large amount of data, it is impossible for the system to cache all the data in the memory, so it is necessary to use a certain strategy to eliminate cache items, and the cache needs to update it when its cache items change. . [0003] At present, most of the existi...

AI Technical Summary

Problems solved by technology

[0003] At present, most of the existing cache systems use the LRU (least recently used) algorithm. The LRU algorithm is a relatively simple elimination selection algorithm, which cannot truly reflect the usage of the content in the cache.

[0004] At present, some existing cache systems do not provide cache synchronization function in order to achieve simplicity, which will lead to deviations between cached data and real data

Although some cache systems provide the cache synchronization function, the cost of cache synchronization is too high because of the consumption of a large amount of system resources.

Images