期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种新的前缀立方索引机制

A New Index Mechanism for PrefixCube
下载PDF
导出
摘要 前缀立方在浓缩数据立方的基础上利用前缀共享和基本单元组技术有效地缩小了数据立方的尺寸.由于前缀共享产生的分组结构,浓缩数据立方的索引CuboidTree并不适合前缀立方.所以,根据前缀立方包含分组结构的特性,结合BUB-Tree和R-Tree技术对CuboidTree进行改造,最终得到了一种新的索引机制Bound-CuboidTree.实验证明,这种索引机制比已有的前缀立方索引Prefix-CuboidTree更适合前缀立方的结构. PrefixCube based on condensed cube was proposed to reduce the size of data cube more efficiently by augmenting BST condensing with prefix-sharing. Because of the group structure after prefix-sharing,the CuboidTree for Condensed cube indexing is not appropriate for PrefixCube. By introducing BUB-Tree and R-Tree technique into CuboidTree,a new index mechanism called Bound-CuboidTree was proposed. According to the results of extensive experiments,it is more efficient for PrefixCube than Prefix-CuboidTree.
作者 聂晶 冯剑琳 王元珍
机构地区 华中科技大学计算机科学与技术学院
出处 《小型微型计算机系统》 CSCD 北大核心 2007年第3期451-455,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60303030)资助 中国博士点基金项目(20030487032)资助.
关键词 前缀立方 分组 Bound—CuboidTree prefixCube group Bound-CuboidTree
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献16

  • 1Gray J,Bosworth A,Layman A,etal.Data Cube:a relational operator generalizing group-by,cross-tab,and sub-totals[C].In:Proc.of the Int.Conf.on Data Engineering,1996.152-159.
  • 2Wang W,Feng J,Lu H,etal.Condensed Cube:an effective approach to reducing data cube size[C].In:Proc.of the Int.Conf.on Data Engineering,2002.155-165.
  • 3Sismanis Y,Deligiannakis A,Roussopoulos N,etal.Dwarf:shrinking the petaCube[C].In:Proc.of the ACM SIGMOD Int.Conf.on Management of Data,2002.464-475.
  • 4Lakshmanan L V S,Pei J,Han J.Quotient Cube:how to summarize the semantics of a data cube[C].In:Proc.of Int.Conf.on Very Large Data Bases,2002.778-789.
  • 5Lakshmanan L V S,Pei J,Zhao Y.QC-Trees:an efficient summary structure for semantic OLAP[C].In:Proc.of the ACM SIGMOD Int.Conf.on Management of Data,2003.64-75.
  • 6Feng J,Fang Q,Ding H.PrefixCube:prefix-sharing condensed data cube[C].In:Proceedings of ACM International Workshop on Data Warehousing and OLAP.Washington,D.C.,USA.2004.New York:ACM Press,2004.38-47.
  • 7冯玉才,方琼,李曲,冯剑琳.PrefixCube计算的优化[J].计算机科学,2004,31(12):81-85. 被引量：3
  • 8丁胡临,冯剑琳,聂晶.前缀立方的索引[J].计算机科学,2005,32(10):103-107. 被引量：1
  • 9Volker Gaede,Oliver Günther.Multidimensional access methods[J].ACM Computing Surveys,1998,30(2):170-231.
  • 10Ding H L.Indexinig and maintaining prefixCube:[Master Thesis][D].Wu han:Library of HUST,2005.21-22.

二级参考文献22

  • 1Gray J,Bosworth A,Layman A,Pirahesh H. Data Cube: A Relational Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. In: Proc. of the Int. Conf. on Data Engineering, 1996
  • 2Beyer K,Ramakrishnan R. Bottom-Up Computation of Sparse and Iceberg CUBEs. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1999
  • 3Poess M,Potapov D. Data Compression in Oracle. In: Proc. of Int. Conf. on Very Large Data Bases, 2003
  • 4Table Compression in Oracle9i Release 2: A Performance Analysis. Oracle Whitepaper, 2003
  • 5Gray J,Sundaresan P,Englert S, Baclawski K,Weinberger P J.Quickly Generating Billion-Record Synthetic Databases. In:Proc. of the ACM SIGMOD Int. Conf. on Management of Data,1994
  • 6Lakshmanan L V S,Pei J,Han J. Quotient Cube: How to Summarize the Semantics of a Data Cube. In: Proc. of Int. Conf. on Very Large Data Bases, 2002
  • 7Sismanis Y, Deligiannakis A,Roussopoulos N, Kotidis Y. Dwarf:Shrinkingthe PetaCube. In: Proc. of the ACM SIGMOD Int.Conf. on Management of Data, 2002
  • 8Wang W,Feng J,Lu H,Yu J X. Condensed Cube: An Effective Approach to Reducing Data Cube Size. In: Proc. of the Int.Conf. on Data Engineering, 2002
  • 9Lakshmanan L V S, Pei J,Zhao Y. QC-Trees: An Efficient Summary Structure for Semantic OLAP. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 2003
  • 10Feng J, Si H, Feng Y. Indexing and Incremental Updating Condensed Data Cube. In: Proc of the Int. Conf. on Scientific and Statistical Database Management, 2003

共引文献2

小型微型计算机系统
2007年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部