The Community for Technology Leaders
RSS Icon
Subscribe
Rio de Janeiro, Brazil
Oct. 24, 2005 to Oct. 27, 2005
ISBN: 0-7695-2446-X
pp: 143-150
Camille Furtado , Federal University of Rio de Janeiro, Brazil
Alexandre A. B. Lima , Federal University of Rio de Janeiro, Brazil
Esther Pacitti , University of Nantes - France
Patrick Valduriez , University of Nantes - France
Marta Mattoso , Federal University of Rio de Janeiro, Brazil
ABSTRACT
On-line analytical processing (OLAP) applications require high performance database support to achieve good response time (crucial for decision making). Database clusters provide a cost-effective alternative to parallel database systems. For OLAP applications, that typically use heavy weight queries, intra-query parallelism yields better performance as it reduces the execution time of individual queries. Intra-query parallelism is based on processing the same query on different subsets of the query table. Combining physical and virtual partitioning to define table subsets provides flexibility in intra-query parallelism while optimizing disk space usage and data availability. Experiments with our partitioning technique using TPC-H benchmark queries on a 32-dual node cluster gave linear and super-linear speedup, thereby reducing significantly the time of typical OLAP heavy weight queries.
INDEX TERMS
null
CITATION
Camille Furtado, Alexandre A. B. Lima, Esther Pacitti, Patrick Valduriez, Marta Mattoso, "Physical and Virtual Partitioning in OLAP Database Clusters", SBAC-PAD, 2005, Computer Architecture and High Performance Computing, Symposium on, Computer Architecture and High Performance Computing, Symposium on 2005, pp. 143-150, doi:10.1109/CAHPC.2005.32
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool