Adaptive use of a cluster of PCs for data warehousing applications: some problems and issues
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Data access performance in a large and dynamic pharmaceutical drug candidate database
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Approximate Query Answering Using Data Warehouse Striping
Journal of Intelligent Information Systems - Special issue on data warehousing and knowledge discovery
Parallel data intensive computing in scientific and commercial applications
Parallel Computing - Parallel data-intensive algorithms and applications
Frequency-adaptive join for shared nothing machines
Progress in computer research
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Fragtique: Applying an OO Database Distribution Strategy to Data Warehouses
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Focusing on Data Distribution in the WebD2W System
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Performance analysis of "Groupby-After-Join" query processing in parallel database systems
Information Sciences—Informatics and Computer Science: An International Journal
Communication and Memory Optimal Parallel Data Cube Construction
IEEE Transactions on Parallel and Distributed Systems
Algorithms for data warehouse design to enhance decision-making
WSEAS Transactions on Computer Research
An optimal skew-insensitive join and multi-join algorithm for distributed architectures
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
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. In this paper 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.