%0 Journal Article
%T Indexing PrefixCube<br>前缀立方的索引
%A DING Hu-Lin
%A FENG Jian-Lin
%A NIE Jing
%A <br>丁胡临
%A 冯剑琳
%A 聂晶
%J 计算机科学
%D 2005
%I 
%X 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.
%K Prefix-CuboidTree
%K PrefixCube
%K Condensed cube
%K Base single tuple<br>Prefix-CuboidTree
%K 前缀立方
%K 浓缩数据立方
%K 基本单元组
%K 数据立方
%K 索引机制
%K 前缀
%K 查询性能
%K 立方结构
%K 计算时间
%K 数据集
%K 元组
%K 共享
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=C03C521CFDBD7778&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=F3090AE9B60B7ED1&sid=89F76E117E9BDB76&eid=D767283A3B658885&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=10