A case for parallelism in data warehousing and OLAP
- 27 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)
- p. 226-231
- https://doi.org/10.1109/dexa.1998.707407
Abstract
In recent years the database community has experienced a tremendous increase in the availability of new technologies to support efficient storage and retrieval of large volumes of data, namely data warehousing and On-Line Analytical Processing (OLAP) products. Efficient query processing is critical in such an environment, yet achieving quick response times with OLAP queries is still largely an open issue. We propose a solution approach to this problem by applying parallel processing techniques to a warehouse environment. We suggest an efficient partitioning strategy based on the relational representation of a data warehouse (i.e., star schema). Furthermore, we incorporate a particular indexing strategy, DataIndexes, to further improve query processing times and parallel resource utilization, and propose a preliminary parallel star-join strategy.Keywords
This publication has 8 references indexed in Scilit:
- Scalability analysis of declustering methods for multidimensional range queriesIEEE Transactions on Knowledge and Data Engineering, 1998
- An overview of data warehousing and OLAP technologyACM SIGMOD Record, 1997
- Improved query performance with variant indexesPublished by Association for Computing Machinery (ACM) ,1997
- Implementing data cubes efficientlyACM SIGMOD Record, 1996
- Multi-table joins through bitmapped join indicesACM SIGMOD Record, 1995
- Query evaluation techniques for large databasesACM Computing Surveys, 1993
- Parallel database systemsCommunications of the ACM, 1992
- Data placement in BubbaPublished by Association for Computing Machinery (ACM) ,1988