期刊文献+

前缀立方的索引 被引量:1

Indexing PrefixCube
下载PDF
导出
摘要 前缀立方是最近提出的一种新的数据立方结构。它利用前缀共享和基本单元组有效地缩小了数据立方的尺寸,相应减少了数据立方的计算时间。为提高前缀立方的查询性能,本文提出了它的一种索引机制Prefix-CuboidTree。文中用真实数据集和模拟数据集进行大量实验,证明了该索引机制的查询性能。 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.
出处 《计算机科学》 CSCD 北大核心 2005年第10期103-107,共5页 Computer Science
基金 国家自然科学基金(项目编号60303030)
  • 相关文献

参考文献10

  • 1Gray J , Bosworth A , Layman A , et al. Data Cube: A Relational Operator Generalizing Group-By, Cross-Tab, and Sub-Totals.In: Proc. of the Int. Conf. on Data Engineering, 1996
  • 2Wang 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
  • 3Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y.Dwarf: Shrinking the PetaCube. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 2002
  • 4Lakshmanan LVS, PeiJ, HanJ. Quotient Cube: How to Summarize the Semantics of a Data Cube. In: Proc. of Int. Conf. on Very Large Data Bases, 202
  • 5Lakshmanan 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
  • 6Feng J, Fang Q, Ding H. PrefixCube: Prefix-sharing Condensed Data Cube. To appear: ACM International Workshop on Data Warehousing and OLAP, 2004
  • 7Feng 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
  • 8Orenstein J A, Merret T H. A Class of Data Structures for Associate Searching. In: Proc. of ACM SIGMOD-PODS Conf. , Portland, Oregon, 1984. 294~305
  • 9Oracle INC. Oracle 9i Spatial, An Oracle Technical White Paper.2001
  • 10Hahn C, Warren S, London J. Edited. Edited synoptic cloud report from ships and land stations over the globe, 1982~ 1991

同被引文献15

  • 1冯玉才,方琼,李曲,冯剑琳.PrefixCube计算的优化[J].计算机科学,2004,31(12):81-85. 被引量:3
  • 2Gray 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.
  • 3Wang 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.
  • 4Sismanis 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.
  • 5Lakshmanan 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.
  • 6Lakshmanan 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.
  • 7Feng 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.
  • 8Volker Gaede,Oliver Günther.Multidimensional access methods[J].ACM Computing Surveys,1998,30(2):170-231.
  • 9Ding H L.Indexinig and maintaining prefixCube:[Master Thesis][D].Wu han:Library of HUST,2005.21-22.
  • 10Feng J,Si H,Feng Y.Indexing and incremental updating condensed data cube[C].In:Proc of the Int.Conf.on Scientific and Statistical Database Management,2003.23-32.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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