【摘要】 前缀立方是最近提出的一种新的数据立方结构。它利用前缀共享和基本单元组有效地缩小了数据立方的尺寸,相应减少了数据立方的计算时间。为提高前缀立方的查询性能,本文提出了它的一种索引机制Prefix-CuboidTree。文中用真实数据集和模拟数据集进行大量实验,证明了该索引机制的查询性能。更多还原

【Abstract】 Recently a new data cube structure called PrefixCube is proposed, which reduces the size of normal data cube and hence the data cube computation time efficiently by augmenting BST condensing with prefix-sharing. To improve query processing performance, in this paper, we propose a new mechanism called Prefix-CuboidTree for indexing a Pre- fixCube. Extensive experiments are conducted to demonstrate the effectiveness of Prefix-CuboidTree using both syn- thetic and real world data.更多还原