Improved strategies and adaptive capability allocation algorithm for query result caching Online publication date: Fri, 09-Oct-2015
by Libing Qian; Zhenzhou Ji; Jun Bai
International Journal of Web Engineering and Technology (IJWET), Vol. 10, No. 3, 2015
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Engineering and Technology (IJWET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook