Fig. 2

TQC algorithm structure. On the one hand, TQC listens to the user request to determine whether the cache is hit. a If it is hit, the result will be returned directly to the user and the Q value of the action will be updated. b If it is missed, the data in the file system or DB will be loaded to the temporary cache and one or several pieces of data with the smallest Q value in the temporary cache will be replaced. On the other hand, TQC periodically (at a specific stride) adds data to the temporary cache from the list of known contents, replaces one or several files with the smallest Q value, and then observes the change of cache hit ratio so as to allow TQC to learn user requests with low frequency and long period and achieve direct hits