Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Improved strategies and adaptive capability allocation algorithm for query result caching

Improved strategies and adaptive capability allocation algorithm for query result caching 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. Reference to this paper should be made as follows: Qian, L., Ji, Z. and Bai, J. (2015) ` for query result caching', Int. J. Web Engineering and Technology, Vol. 10, No. 3, pp.272­290. Biographical notes: Libing Qian received his MSc in Computer Science from University of Science and Technology of http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Engineering and Technology Inderscience Publishers

Improved strategies and adaptive capability allocation algorithm for query result caching

Loading next page...
 
/lp/inderscience-publishers/improved-strategies-and-adaptive-capability-allocation-algorithm-for-DEkMbKzdd0
Publisher
Inderscience Publishers
Copyright
Copyright © 2015 Inderscience Enterprises Ltd.
ISSN
1476-1289
eISSN
1741-9212
DOI
10.1504/IJWET.2015.072351
Publisher site
See Article on Publisher Site

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. Reference to this paper should be made as follows: Qian, L., Ji, Z. and Bai, J. (2015) ` for query result caching', Int. J. Web Engineering and Technology, Vol. 10, No. 3, pp.272­290. Biographical notes: Libing Qian received his MSc in Computer Science from University of Science and Technology of

Journal

International Journal of Web Engineering and TechnologyInderscience Publishers

Published: Jan 1, 2015

There are no references for this article.