Please use this identifier to cite or link to this item:
|Title:||Diversified caching for replicated web search engines||Authors:||Xu, C
|Issue Date:||2015||Publisher:||IEEE Computer Society||Source:||Proceedings - International Conference on Data Engineering, 2015, v. 2015-May, 7113285, p. 207-218 How to cite?||Abstract:||Commercial web search engines adopt parallel and replicated architecture in order to support high query throughput. In this paper, we investigate the effect of caching on the throughput in such a setting. A simple scheme, called uniform caching, would replicate the cache content to all servers. Unfortunately, it does not exploit the variations among queries, thus wasting memory space on caching the same cache content redundantly on multiple servers. To tackle this limitation, we propose a diversified caching problem, which aims to diversify the types of queries served by different servers, and maximize the sharing of terms among queries assigned to the same server. We show that it is NP-hard to find the optimal diversified caching scheme, and identify intuitive properties to seek good solutions. Then we present a framework with a suite of techniques and heuristics for diversified caching. Finally, we evaluate the proposed solution with competitors by using a real dataset and a real query log.||Description:||2015 31st IEEE International Conference on Data Engineering, ICDE 2015, 13-17 April 2015||URI:||http://hdl.handle.net/10397/35629||ISBN:||9781479979639||DOI:||10.1109/ICDE.2015.7113285|
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Dec 11, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.