2006•Journal of Shandong UniversityRequires access

An optimized method for minimal cubing approach

MA Jia-sai

Abstract

Data cube has been playing an important role in the high dimensional OLAP operations.However,when it comes to many applications of high-dimensional data warehouse,the efficiency of querying analysis is a critical issue.For instance,some applications are over one hundred dimension about 10~6 tuples.Under this circumstance,it is unfeasible to reduce analyzed time by constructing materialized data cube wholly.OLAP operations on high-dimensional data set can be done by using minimal cubing approach.The high dimensions can be partitioned properly to accelerate querying analysis by studying the historical records of OLAP operations.By doing this the efficiency of OLAP operations can be improved with the similar space complexity.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Online analytical processing, Computer science, Data cube, Data warehouse, Cube (algebra), Dimension (graph theory), Tuple, Set (abstract data type)