Paper Info
Title
Cache-aware load balancing vs. cooperative caching for distributed search engines
Abstract
In this paper we study the performance of a distributed search engine from a data caching point of view. We compare and combine two different approaches to achieve better hit rates: (a) send the queries to the node which currently has the related data in its local memory (cache-aware load balancing), and (b) send the cached contents to the node where a query is being currently processed (cooperative caching). Furthermore, we study the best scheduling points in the query computation in which they can be reassigned to another node, and how this reassignation should be performed. Our analysis is guided by statistical tools on a real question answering system for several query distributions, which are typically found in query logs.
Year
DOI
Venue
2009
10.1109/HPCC.2009.31
HPCC
Keywords
Field
DocType
distributed search engine,cache-aware load balancing,different approach,query computation,distributed systems,scheduling scheme,scheduling,better hit rate,best scheduling point,cache storage,query log,question answering system,question answering,cooperative caching,related data,cached content,resource allocation,search engine,query distribution,statistical tool,load balancing,distributed system,search engines,distributed processing,query processing,cooperative data caching,mathematics,load balance,high performance computing,throughput,relational data,data mining,computer architecture,natural languages
Query optimization,Web search query,Search engine,Query expansion,Computer science,Cache,Scheduling (computing),Load balancing (computing),Web query classification,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-0-7695-3738-2
2
0.39
References 
Authors
21
3
Name
Order
Citations
PageRank
David Dominguez-Sal118916.35
Marta Pérez-Casany2122.41
Josep Lluis Larriba-Pey3102.64