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

一种新的封闭立方体查询算法 被引量：1

A New Algorithm to Query Closed Cube
下载PDF
导出
摘要 提出了一种新的封闭立方体查询算法,缩小了查询时需搜索的记录的范围,提高了查询效率。给出了相关的理论分析和证明,并给出相关的封闭掩码集生成算法。实验结果和理论分析证明了新算法是有效的,在75%的情况下能将需查询范围包含的记录数减少到传统方法的92%左右,提高了对封闭立方体的查询效率。 This paper presents a new algorithm to query closed cubes, using this algorithm, the quantity of records being searched will decrease to 92% of that when the traditional algorithm is adapted, for 75% of the cases. Theoretical analysis is brought forward, also an algorithm to generate the closed mask set is given. Experimental results and corresponding analysis show that the new algorithm improves the searching efficiency.
作者 陈富强 奚建清
机构地区 华南理工大学计算机科学与工程学院
出处 《微计算机应用》 2008年第4期63-66,共4页 Microcomputer Applications
基金 广东省科技计划项目(NO2006B11301001) 广州市科技计划项目(NO2006Z3-D3081)资助
关键词 商立方体 封闭立方体 点查询 数据立方体 quotient cube, closed cube, point query, data cube
分类号 TP311.13 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献5

  • 1Gray J,Bosworth A,Layman A,Pirahesh H. Data Cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In: Su SYW, ed. Proc. of the 12th Int'l Conf on Data Engineering. New Orleans: IEEE Computer Society, 1996,152 - 159.
  • 2Lakshmanan L VS, Pei J, HAN JW. Quotient Cube:How to summarize the semantics of a data cube. In: Proceedings of 28th International Conference on Very Large Data Bases, Hong Kong, 2002, Morgan Kaufmann, 2002,778 - 789.
  • 3李盛恩,王珊.封闭数据立方体技术研究[J].软件学报,2004,15(8):1165-1171. 被引量：25
  • 4Zhao Y, Quotient Cube and QC - Tree: Efficient Summarizations for Semantic OLAP. The University of British Columbia, Thesis for Master of Science, 2003.
  • 5Hahn C et al. Edited synoptic cloud reports from ships and land stations over the globe. 1982 -1991. http://cdiac, ornl. gov/fip/ ndp026b/.

二级参考文献13

  • 1Lakshmanan LVS, Pei J, Han JW. Quotient cube: How to summarize the semantics of a data cube. In: Bressan S, Chaudhri AB, Lee ML, Yu JX, Lacroix Z, eds. Proc. of the 23rd Int'l Conf. on Very Large Data Bases. Hong Kong: Morgan Kaufmann, 2002. 778～789.
  • 2Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y. Dwarf: Shrinking the PetaCube. In: Franklin MJ, Moon B, Ailamaki A, eds. Proc. of the 2002 ACM SIGMOD Int'l Conf. on Management of Data. Madison: ACM Press, 2002. 464～475.
  • 3Mumick IS, Quass D, Mumick BS. Maintenance of data cubes and summary tables in a warehouse. In: Peckham J, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Tucson: ACM Press, 1997. 100-111.
  • 4Hahn C, Warren S, London J. Edited synoptic cloud reports from ships and land stations over the globe. 1996. http://cdiac.esd.ornl.gov/cdiac/ndps/ndp026b.html
  • 5Gray J, Bosworth A, Layman A, Pirahesh H. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In: Su SYW, ed. Proc. of the 12th Int'l Conf. on Data Engineering. New Orleans: IEEE Computer Society, 1996. 152～159.
  • 6Agarwal S, Agrawal R, Deshpande PM, Gupta A, Naughton JF, Ramarkrishman R, Sarawagi S. On the computation of multidimensional aggregates. In: Vijayaraman TM, Buchmann AP, Mohan C, Sarda NL, eds. Proc. of the 22nd Int'l Conf. on Very Large Data Bases. Mumb
  • 7Zhao Y, Deshpande PM, Naughton JF. An array-based algorithm for simultaneous multidimensional. In: Peckham J, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Tucson: ACM Press, 1997. 159-170.
  • 8Ross KA, Srivastava D. Fast computation of sparse datacubes. In: Jarke M, Carey MJ, Dittrich KR, Lochovsky FH, Loucopoulos P, Jeusfeld MA, eds. Proc. of the 23rd Int'l Conf. on Very Large Data Bases. Athens: Morgan Kaufmann, 1997. 116～125.
  • 9Harinarayan V, Rajaraman A, Ullman JD. Implementing data cubes efficiently. In: Jagadish HV, Mumick IS, eds. Proc. of the 1996 ACM SIGMOD Int'l Conf. on Management of Data. Montreal: ACM Press, 1996. 205-216.
  • 10Shukla A, Deshpande PM, Naughton JF. Materialized view selection for multidimensional datasets. In: Gupta A, Shmueli O, Widom J, eds. Proc. of the 24th Int'l Conf. on Very Large Data Base. New York: Morgan Kaufmann, 1998. 488～499.

共引文献24

同被引文献11

  • 1李盛恩,王珊.封闭数据立方体技术研究[J].软件学报,2004,15(8):1165-1171. 被引量：25
  • 2GUPTA A , MUMICH I S , SUBRAHMANIAN V S . Maintaining views incrementally [J]. ACM SIGMOD, 1993, 22(2): 46 -50.
  • 3GRAY J, BOSWORTH A, LAYMAN A, et al. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals [ C]//Proceedings of the Twelfth International Conference on Data Engineering. New Orleans: IEEE Computer Society, 1996: 152 - 159.
  • 4LAKSHMANAN L V S, PEI J, HAN J W. Quotient cube: How to summarize the semantics of a data cube [ C ]// Proceedings of VLDB. Hongkong: [s. n. ], 2002:778-789.
  • 5ZHAO Y. Quotient cube and QC-tree: Efficient summarizations for semantic 0LAP [ EB/OL]. [ 2009 - 04 - 10]. http://www. cs. ubc. ca/nest/dbsl/thesis/yzhao thesis. pdf.
  • 6LAKSHMANAN L V S, PEI J, ZHAO YAN. QC-trees: An efficient summary structure for semantic OLAP [ EB/OL]. http://www. cs. sfu. ca/-jpei/publications/qctree. pdf.
  • 7BALMIN A, PAPADIMITRIOU T, PAPAKONSTANTINOU Y. Hypothetical queries in an OLAP environment [ C]// Proceedings of the 26th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann, 2000:220 -231.
  • 8LEVI A, MENDELZON A, SAGIV Y, et al. Answering queries using views [ C]// Proceedings of the 14th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems. New York:ACM Press, 1995:95 - 104.
  • 9SARAWAGI S. Indexing OLAP data [ J]. Data Engineering Bulletin, 1997, 20(1): 36-43.
  • 10CARPINETO C, ROMANO G. Galois: An order-theoretic approach to conceptual clustering [ C]// ICML '90: Proceedings of the 10th International Conference on Machine Learning. Amherst: [ s. n. ], 1993: 33 - 40.

引证文献1

二级引证文献1

微计算机应用
2008年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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