Multidimensional query processing algorithm by dimension transformation

Abstract

Multidimensional query processing is an important access pattern for multidimensional scientific data. We propose an in-memory multidimensional query processing algorithm for dense data using a higher-dimensional array. We developed a new array system namely a Converted two-dimensional Array (C2A) of a multidimensional array of dimension n ($$n > 2$$ n > 2 ) where the n dimensions are transformed into 2 dimensions. Using the C2A, we design and analyze less complex algorithms that show improve performance for data locality and cache miss rate. Therefore, improved performance for data retrieval is achieved. We demonstrate algorithms for single key and range key queries for both Traditional Multidimensional Array(TMA) and C2A. We also compare the performance of both schemes. The cost of index computation gets high when the number of dimensions increases in a TMA but the proposed C2A based algorithm shows less computation cost. The cache miss rate is also lower for in C2A based algorithm than TMA based algorithm. Theoretical and experimental results show that the performance of C2A based algorithm outperforms the TMA-based algorithms.