Double Table Switch: An Efficient Partitioning Algorithm for Bottom-Up Computation of Data Cubes

摘要：

Bottom-up computation of data cubes is an efficient approach which is adopted and developed by many other cubing algorithms such as H-Cubing, Quotient Cube and Closed Cube, etc. The main cost of bottom-up computation is recursively sorting and partitioning the base table in a worse way where large amount of auxiliary spaces are frequently allocated and released. This paper proposed a new partitioning algorithm, called Double Table Switch (DTS). It sets up two table spaces in the memory at the beginning, where the partitioned results in one table are copied into another table alternatively during the bottom-up computation. Thus DTS avoids the costly space management and achieves the constant memory usage. Further, we improve the DTS algorithm by adjusting the dimension order, etc. The experimental results demonstrate the efficiency of DTS.

关键词： Data warehouse Data cube Bottom-up computation Partitioning algorithm Double Table Switch

作者: Jinguo You Lianying Jia Jianhua Hu Qingsong Huang Jianqing Xi

作者单位: School of Information Engineering and Automation,Kunming University of Science and Technology, Kunmi School of Computer Science and Engineering, South China University of Technology,Guangzhou, Guangdon

会议类型: 国际会议

会议名称: 6th International Conference on Advanced Data Mining and Applications(第六届先进数据挖掘及应用国际会议 ADMA 2010)

会议地点: 重庆

会议语种:英文

页码: 183-190

在线出版日期: 2010-11-19（万方平台首次上网日期，不代表论文的发表时间）