MOLAP cube based on parallel scan algorithm

Authors:
Krzysztof Kaczmarski;Tomasz Rudny
Affiliations:
Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland;Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland
Venue:
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Year:
2011

Citing 8
Cited 1

CubiST: a new algorithm for improving the performance of ad-hoc OLAP queries

Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Condensed Cube: An Efficient Approach to Reducing Data Cube Size

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
PrefixCube: prefix-sharing condensed data cube

Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
A programming language

A programming language
Scan primitives for GPU computing

Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
High-dimensional OLAP: a minimal cubing approach

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Searching High-Dimensional Neighbours: CPU-Based Tailored Data-Structures Versus GPU-Based Brute-Force Method

MIRAGE '09 Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques
Comparing GPU and CPU in OLAP cubes creation

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science

High-performance online spatial and temporal aggregations on multi-core CPUs and many-core GPUs

Proceedings of the fifteenth international workshop on Data warehousing and OLAP

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new approach to multidimensional OLAP cubes implementation by employing a massively parallel scan operation. This task requires dedicated data structures, setting up and querying algorithms. A prototype implementation is evaluated in aspects of robustness and scalability for both time and storage.