期刊文献+

基于语义分解的联机分析处理查询并行优化方案

Parallel OLAP query optimization method based on semantic decomposition
下载PDF
导出
摘要 利用联机分析处理(OLAP)查询中存在的语义关联,对聚集关系与语义分解关系进行了形式化描述,并基于这些关系定义了查询与查询集之间的补集关系,在执行OLAP查询集时,可以利用这些关系尽可能地识别查询集中查询的公共部分,并且可以在查询时从多个角度来采取并行优化措施。实验验证表明采用并行优化方案后,系统的整体效率得到了提高。 This article first gave out formalization definitions of aggregation relation and semantic decomposition relation between the Online Analytical Processing(OLAP) queries.Then the definition of supplementary set between the query and query set was provided.The common query in OLAP set could be found by using these relations and the OLAP queries could be optimized by parallel method from many aspects.Test results show that the system's overall efficiency has been improved by adopting parallel optimization method.
作者 魏莉 杨科华
出处 《计算机应用》 CSCD 北大核心 2010年第7期1956-1958,共3页 journal of Computer Applications
基金 湘南学院科研基金资助项目(09Y028) 广东省产学研项目(2007A090302079)
关键词 联机分析处理 语义关联 语义分解 查询集 并行查询优化 Online Analytical Processing(OLAP) semantic relation semantic decomposition query set parallel query optimization
  • 相关文献

参考文献5

  • 1SHIM J,SCHEUERMANN P,VINGRALEK R.Dynamic caching of query results for decision support system[C] // Proceedings of the 11th International Conference on Scientific and Statistical Database Management.Washington,DC:IEEE Computer Society,1999:254-263.
  • 2YANG J,KARLAPLEM K,LI Q.Algorithms for materialized view design in data warehousing environment[C] // Proceedings of the 23rd International Conference on Very Large Data Bases.San Francisco:Morgan Kaufmann Publishers,1997:136-145.
  • 3薛永生,黄震华,段江娇,张延松,吕晓华.一种并行处理多维连接和聚集操作的有效方法[J].计算机研究与发展,2004,41(10):1661-1669. 被引量:2
  • 4杨科华.提高联机分析处理(OLAP)性能若干关键技术的研究[D].南京:东南大学,2006.
  • 5Transaction Processing Performance Council TPC.TPC benchmarks H and R (decision support)[EB/OL].[2009-08-06].http://www.tpc.org/.

二级参考文献22

  • 1H Gupta, V Harinarayan, A Rajaraman, et al. Index selection for OLAP. In: Proc of the 15th Int'l Conf on Int'l Council for Open and Distance Education. Los Alamitos, CA: IEEE Computer Society Press, 1997. 136~154
  • 2I S Mumick, D Quass, B S Mumick. Maintenance of data cubes and summary tables in a warehouse. ACM SIGMOD Record,1997, 26(2): 132~141
  • 3C Li, X S Wang. A data model for supporting on-line analytical processing. In: KBarker, U Manitoba, eds. Proc of the 5th Int'l Conf on Information and Knowledge Management CIKM' 96.New York: ACM Press, 1996. 81~88
  • 4E Bertino, W Kim. Indexing technique for queries on nested objects. IEEE Trans on Knowledge and Data Engineering, 1989,1(2): 196~214
  • 5C Zou, B Salzberg, R Ladin. Back to the future: Dynamic hierarchical clustering. In: Proc of the 16th Int'l Conf on Int'l Council for Open and Distance Education. Oslo: SEAMEO,1998. 578~587
  • 6S Xiaojun, H Qing. Efficient embedding k-ary complete trees into hypercubes parallel processing symposium. In: Proc of the 12th Int'l Conf on Data Engneering. Los Alamitos: IEEE Computer Society Press, 1996. 24~31
  • 7W Peng, L Per-Ake. Eager aggregation and lazy aggregation. In:D Umeshwar, et al eds. Proc of the 21st Int'l Conf on Very Large Data Bases. San Francisco: Morgan Kaufmann, 1995. 345~357
  • 8S Agarwal, R Agrawal, P M Deshpande. On the computation of multidimensional aggregates. In: T M Vijayaraman, A P Buchmann, C Mohan eds. Proc of the 22nd Int'l Conf on Very Large Data Bases VLDB' 96. San Francisco: Morgan Kaufmann,1996. 506~521
  • 9J Gray, A Bosworth, A Layman, et al. Data cube: A relational aggregation operator generalizing group-by, cross-tab & sub-total.In: D Umeshwar, et al eds. Proc of the 21st Int'l Conf on Very Large Data Bases. San Francisco: Morgan Kaufmann, 1995. 345~357
  • 10F Olken, D Rotem. Simple random sampling from relational databases. In: Proc of the 12th VLDB. San Francisco: Morgan Kanfmann, 1986. 160~169

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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