Double Table Switch: An Efficient Partitioning Algorithm for Bottom-Up Computation of Data Cubes
| Autor: | Qingsong Huang, Jinguo You, Jianqing Xi, Lianying Jia, Jianhua Hu |
|---|---|
| Rok vydání: | 2010 |
| Předmět: | |
| Zdroj: | Advanced Data Mining and Applications ISBN: 9783642173127 ADMA (2) |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|