Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP
The data cube is a critical tool for accelerating online analysis in big data. Due to its exponential space overhead, the quotient cube, as the main data cube compression approach, was proposed to significantly reduce the number of data cells if they are aggregated over the same base tuple set, i.e....
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9570331/ |
| _version_ | 1828406426734690304 |
|---|---|
| author | Quankun Wang Jinguo You Benyuan Zou Yu Chen Xingrui Huang Lianyin Jia |
| author_facet | Quankun Wang Jinguo You Benyuan Zou Yu Chen Xingrui Huang Lianyin Jia |
| author_sort | Quankun Wang |
| collection | DOAJ |
| description | The data cube is a critical tool for accelerating online analysis in big data. Due to its exponential space overhead, the quotient cube, as the main data cube compression approach, was proposed to significantly reduce the number of data cells if they are aggregated over the same base tuple set, i.e. they are cover equivalent to form an equivalence class. Nevertheless, it still poses challenges to efficiently analyze massive data due to high storage space consumption. This paper proposes the reduced quotient cube (RQC) based on the following observation. (i) there are equivalence classes of various sizes in a quotient cube; (ii) the small equivalence classes usually dominate; (iii) the big equivalence classes are more capable of query answering since they can induce more data cells. Unlike the quotient cube, which preserves all the equivalence classes of equal priority, the reduced quotient cube preferentially does those with larger query answering capacity and smaller space occupied capacity. Further, we design its efficient constructing and querying algorithms. The extensive experimental results show that compared with the quotient cube, the reduced quotient cube space is only 11.3%, while the maximum query capacity is 95.9%. The query time of the reduced quotient cube is reduced by 51.24% on average compared to the quotient cube. |
| first_indexed | 2024-12-10T11:11:30Z |
| format | Article |
| id | doaj.art-871a18fc99ad47718f31f365d9bb6993 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-10T11:11:30Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-871a18fc99ad47718f31f365d9bb69932022-12-22T01:51:24ZengIEEEIEEE Access2169-35362021-01-01914152414153510.1109/ACCESS.2021.31202789570331Reduced Quotient Cube: Maximize Query Answering Capacity in OLAPQuankun Wang0https://orcid.org/0000-0002-3478-7855Jinguo You1https://orcid.org/0000-0002-9118-3775Benyuan Zou2https://orcid.org/0000-0002-9164-2927Yu Chen3Xingrui Huang4Lianyin Jia5https://orcid.org/0000-0002-0269-9017Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, ChinaFaculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, ChinaFaculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, ChinaFaculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, ChinaFaculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, ChinaFaculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, ChinaThe data cube is a critical tool for accelerating online analysis in big data. Due to its exponential space overhead, the quotient cube, as the main data cube compression approach, was proposed to significantly reduce the number of data cells if they are aggregated over the same base tuple set, i.e. they are cover equivalent to form an equivalence class. Nevertheless, it still poses challenges to efficiently analyze massive data due to high storage space consumption. This paper proposes the reduced quotient cube (RQC) based on the following observation. (i) there are equivalence classes of various sizes in a quotient cube; (ii) the small equivalence classes usually dominate; (iii) the big equivalence classes are more capable of query answering since they can induce more data cells. Unlike the quotient cube, which preserves all the equivalence classes of equal priority, the reduced quotient cube preferentially does those with larger query answering capacity and smaller space occupied capacity. Further, we design its efficient constructing and querying algorithms. The extensive experimental results show that compared with the quotient cube, the reduced quotient cube space is only 11.3%, while the maximum query capacity is 95.9%. The query time of the reduced quotient cube is reduced by 51.24% on average compared to the quotient cube.https://ieeexplore.ieee.org/document/9570331/Data cubeequivalence classOLAPquotient cubestorage optimization |
| spellingShingle | Quankun Wang Jinguo You Benyuan Zou Yu Chen Xingrui Huang Lianyin Jia Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP IEEE Access Data cube equivalence class OLAP quotient cube storage optimization |
| title | Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP |
| title_full | Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP |
| title_fullStr | Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP |
| title_full_unstemmed | Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP |
| title_short | Reduced Quotient Cube: Maximize Query Answering Capacity in OLAP |
| title_sort | reduced quotient cube maximize query answering capacity in olap |
| topic | Data cube equivalence class OLAP quotient cube storage optimization |
| url | https://ieeexplore.ieee.org/document/9570331/ |
| work_keys_str_mv | AT quankunwang reducedquotientcubemaximizequeryansweringcapacityinolap AT jinguoyou reducedquotientcubemaximizequeryansweringcapacityinolap AT benyuanzou reducedquotientcubemaximizequeryansweringcapacityinolap AT yuchen reducedquotientcubemaximizequeryansweringcapacityinolap AT xingruihuang reducedquotientcubemaximizequeryansweringcapacityinolap AT lianyinjia reducedquotientcubemaximizequeryansweringcapacityinolap |