Paper Info
Title
Cache-Aware Query Routing in a Cluster of Databases
Abstract
Abstract: We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster runs an off-the-shelf DBMS and holds a copy of the whole database. The cluster has a coordinator that routes each query to an appropriate component. Considering queries of realistic complexity, e.g., TPC-R, this article addresses the following questions: Can routing benefit from caching effects due to previous queries? Since our components are black-boxes, how can we approximate their cache content? How to route a query, given such cache approximations? To answer these questions, we have developed a cache-aware query router that is based on signature approximations of queries. We report on experimental evaluations with the TPC-R benchmark using our PowerDBdatabase cluster prototype. Our main result is that our approach of cache approximation routing is better than state-of-the-art strategies by a factor of two with regard to mean response time.
Year
DOI
Venue
2001
10.1109/ICDE.2001.914879
ICDE
Keywords
Field
DocType
cache storage,distributed databases,query processing,relational databases,software performance evaluation,PowerDB,TPC-R,cache approximations,cache-aware query routing,database cluster,experimental evaluations,mean response time,off-the-shelf database,query response time,relational databases,signature approximations
Query optimization,Data mining,Query language,Query expansion,Computer science,Sargable,Web query classification,Theoretical computer science,Cache algorithms,Spatial query,Online aggregation,Database
Conference
ISSN
ISBN
Citations 
1063-6382
0-7695-1001-9
22
PageRank 
References 
Authors
1.19
13
3
Name
Order
Citations
PageRank
Uwe Röhm130831.42
Klemens Böhm21549323.08
Hans-Jörg Schek339951366.90