Title: Improved strategies and adaptive capability allocation algorithm for query result caching

Authors: Libing Qian; Zhenzhou Ji; Jun Bai

Addresses: School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China ' School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China ' School of Computer Science and Technology, Harbin Institute of Technology, Weihai 264209, China

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.

Keywords: query result caching; adaptive capability allocation; caching freshness; hybrid cache; search engines; cost-aware strategies; static caching; dynamic caching; query repeated distance factor; cache capability; system performance; processing time.

DOI: 10.1504/IJWET.2015.072351

International Journal of Web Engineering and Technology, 2015 Vol.10 No.3, pp.272 - 290

Published online: 09 Oct 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article