Paper Info
Title
OLAP Query Routing and Physical Design in a Database Cluster
Abstract
This article quantifies the benefit from simple data organization schemes and elementary query routing techniques for the PowerDB engine, a system that coordinates a cluster of databases. We report on evaluations for a specific scenario: the workload contains OLAP queries, OLTP queries, and simple updates, borrowed from the TPC-R benchmark.We investigate affinity of OLAP queries and different routing strategies for such queries. We then compare two simple data placement schemes, namely full replication and a hybrid one combining partial replication with partitioning. We run different experiments with queries only, with updates only, and with queries concurrently to simple updates. It turns out that hybrid is superior to full replication, even without updates. Our overall conclusion is that coordinator-based routing has good scaleup properties for scenarios with complex analysis queries.
Year
DOI
Venue
2000
10.1007/3-540-46439-5_18
EDBT
Keywords
Field
DocType
olap query routing,physical design,different experiment,coordinator-based routing,full replication,database cluster,oltp query,olap query,partial replication,different routing strategy,simple updates,simple data placement scheme,simple data organization scheme
Information system,Data mining,Information management,Information processing,Workload,Computer science,Online transaction processing,Partial replication,Physical design,Online analytical processing,Database
Conference
Volume
ISSN
ISBN
1777
0302-9743
3-540-67227-3
Citations 
PageRank 
References 
32
9.66
13
Authors
3
Name
Order
Citations
PageRank
Uwe Röhm130831.42
Klemens Böhm21549323.08
Hans-Jörg Schek339951366.90