Research on cache model in mobile database
Weng Changlin
Abstract
Weng Changlin
Abstract
To improve the performance of mobile database system, a cache model was proposed for mobile database. A kind of synchronization algorithm based on message digest was used in this model. By comparing the value of message digest in mobile client and server, the algorithm completed the cache synchronization, and maintained the consistency of mobile client cache and the data in server. The timeliness of the data and the priority of the transaction were considered in this model. A cache replacement algorithm based on cost function was designed. The experimental results show that the cache hit rate of the proposed algorithm is higher than Least Recently Used( LRU) and Least Access-to-Update Ratio( LA2U) algorithm along with the increase of the number of cache data. At the same time, the restart rate of transaction is lower than LRU and LA2U while the frequency of access increases. The performance of the cache of mobile database is improved.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To improve the performance of mobile database system, a cache model was proposed for mobile database. A kind of synchronization algorithm based on message digest was used in this model. By comparing the value of message digest in mobile client and server, the algorithm completed the cache synchronization, and maintained the consistency of mobile client cache and the data in server. The timeliness of the data and the priority of the transaction were considered in this model. A cache replacement algorithm based on cost function was designed. The experimental results show that the cache hit rate of the proposed algorithm is higher than Least Recently Used( LRU) and Least Access-to-Update Ratio( LA2U) algorithm along with the increase of the number of cache data. At the same time, the restart rate of transaction is lower than LRU and LA2U while the frequency of access increases. The performance of the cache of mobile database is improved.
Key concepts: Computer science, Cache invalidation, Cache algorithms, Cache, Cache pollution, Smart Cache, Cache coloring, Page cache