View in EDS

Multidimensional query processing algorithm by dimension transformation.

Saved in:
Bibliographic Details
Title: Multidimensional query processing algorithm by dimension transformation.
Authors: Rimi, Rejwana Tasnim, Hasan, K. M. Azharul, Tsuji, Tatsuo
Source: Scientific Reports; 4/11/2023, Vol. 13 Issue 1, p1-11, 11p
Subject Terms: SEARCH algorithms, MULTIDIMENSIONAL databases, PRICE indexes, INFORMATION retrieval, HIGH-dimensional model representation
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 ) 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. [ABSTRACT FROM AUTHOR]
Copyright of Scientific Reports is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
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 ) 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. [ABSTRACT FROM AUTHOR]
ISSN:20452322
DOI:10.1038/s41598-023-31758-7