Fig. 5

Periodic increase of data objects. a The changes of hit ratio at cache capacity C = 64GB and C = 32GB. 3a shows that when the cache capacity is 32 GB, at t = 6, 12, and 18 h, each time new data is generated, LFU robustness is the best and TQC efficiency will decline, because TQC needs some time to learn new files. b indicates that TQC outperforms LFU over a long period of time when the cache increases to 64 GB. This is mainly because LFU accumulates a large number of access requests for a long time which requires more time to judge new data and replace old data. Based on the learning mode of time series, with very little storage space and computing resources, TQC can learn low-frequency and long-period request patterns so as to enhance the overall performance of the algorithm