Abstract

Query result caching has attracted overwhelming attention in recent years to enhance the performance of search engines. In this paper, we present approaches to improve cost-aware strategies for static and dynamic caching, and further propose an adaptive capability allocation algorithm for hybrid caching. More precisely, we introduce a query repeated distance factor to improve the classical static result caching. We describe the worth of caching based on the query popularity and design a novel mechanism to further improve the dynamic policies. By designing a Queue-Hash cache internal structure, our adaptive capability allocation algorithm is employed to adjust the cache capability to further improve the efficiency in a hybrid cache combining static and dynamic caching policies. The experimental results demonstrate that the improved approaches can increase the overall system performance, particularly in terms of the average processing time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call