Abstract: In this paper, the authors propose using the DCA-tree (a modified version of the R^*-tree) to create the high performance data cube aggregate-tree cube (DCA-tree cube). The authors also describe the key techniques such as DCA-tree cube creating, MOLAP rapid querying, DCA-tree cube incremental updating, etc. The analytical result of the algorithm shows that the performance of the DCA-tree cube in querying and updating is better than that of the cube created by the aggregate techniques such as dynamic data cube (DDC), etc. The DCA-tree cube can update incrementally while new data of some dimensions are inserted.

Key words: data cube aggregate-tree cube (DCA-tree cube), multidimensional on-line analysis process (MOLAP), range queries, aggregate technique, incrementally updating, multidimensional data warehouse