A Tile Data Cache Replacement Policy Based on Hierarchical Relationship and Correlation Degree

To solve the problems that server and network pressure is too large and tile response time is too long in tile spatial data transmission, a data cache preplacement method named Value Evaluation of Associated Tiles was put forward in this paper. This method combined the tiles of hierarchy and the correlation between adjacent tiles, and the value of tiles was defined. On the basis of this method, the tile value and cache space were abstracted as 0/1 knapsack problem, and solved by ant colony algorithm. Experimental results showed that this method was significantly improved in tile hit rate and byte hit rate, especially in the small cache capacity, the cache hit rate was significantly higher than other algorithms.