3iCubing: An Interval Inverted Index Approach to Data Cubes

IEEE Access

Rodrigo Rocha Silva¹  Marco Domingues²  Jorge Bernardino² 

[1] Centre for Informatics and Systems of the University of Coimbra (CISUC), University of Coimbra, Coimbra, Portugal;Polytechnic of Coimbra, Coimbra Institute of Engineering (ISEC), Coimbra, Portugal;

关键词: Big data;    data cube;    inverted index;    OLAP;   

DOI  :  10.1109/ACCESS.2022.3142449

来源: DOAJ

【 摘 要 】

The increase in the amounts of information used to analyze data is problematic since the memory necessary to store and process it is getting quite big. The interval inverted index representation was developed to reduce the required memory to store data, and Frag-Cubing is one of the most popular algorithms. In this paper, we propose two new data cubing algorithms: 3iCubing and M3iCubing. 3iCubing is a Frag-Cubing-based algorithm that uses the interval inverted index representation, while M3iCubing uses both a normal and interval inverted index data representation. The algorithms were compared using synthetic and real data sets in indexation and querying operations, both runtime and memory-wise. The experimental evaluation shows that 3iCubing can considerably reduce the memory needed to index a data set, reducing around 25% of the memory used by Frag-Cubing. Moreover, the results show that the interval inverted index representation is dependent on the data skewness to reduce the memory consumption, having positive results with highly skewed and real-world data sets.

【 授权许可】

Unknown