Indexing PrefixCube
前缀立方的索引

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 PrefixCube. Extensive experiments are conducted to demonstrate the effectiveness of Prefix-CuboidTree using both synthetic and real world data.