登录 | 注册 | 退出 | 公司首页 | 繁体中文 | 满意度调查
综合馆
列存储数据查询中的连接策略优化方法
  • 摘要

    列存储数据查询优化的重点是列的连接策略.现有的列存储系统通过存储的改变来简化列的连接,致使列的连接缺少查询优化处理,策略单一且无法满足复杂查询.在剖析现有连接选择策略的基础上,提出一种新的连接策略优化方法,即首先利用基于规则的优化方法为列存储数据查询制定优化规则,过滤不可能产生最优计划的候选计划;然后设计了基于代价的优化算法,根据动态Huffman树和左深连接树原理对查询执行顺序进行改进,进一步减少候选计划的规模;根据列存储数据的特点将候选计划中每个连接节点的执行策略归纳为串行连接和并行连接两类,并在此基础上提出代价估计模型,进而可针对这两种连接策略进行代价估计和策略选择.最后在SSB数据集上通过实验证明了方法在列存储数据查询中的有效性.

  • 作者

    孙莉  李静  刘国华  Sun Li  Li Jing  Liu Guohua 

  • 作者单位

    东华大学计算机科学与技术学院 上海 201620/东华大学计算机科学与技术学院 上海 201620;计算机软件新技术国家重点实验室(南京大学)南京210093

  • 刊期

    2013年8期 ISTIC EI PKU

  • 关键词

    列存储  连接策略  查询优化  基于代价  串并行策略  column store  join strategy  query optimization  cost-based  pipeline and parallel strategies 

参考文献
  • [1] Abadi D J. Query execution in column-oriented database systems. Cambridge:Massachusetts Institute of Technology, 2008
  • [2] Copeland G P;Khoshafian S N. A decomposition storage model. New York:ACM, 1985
  • [3] Hankins R A;Patel J M. Data Morphing:An adaptive,cache-conscious storage technique. New York:ACM, 2003
  • [4] Dittrich J. Architecture and implementation of database systems. Institute of Information Systems in Saarland University, 2007
  • [5] Waas F;Cesar G L. Counting,enumerating and sampling of execution plans in a cost-based query optimizer. New York:ACM, 2000
  • [6] José A B;Cunningham P C;Nigel E. Distributed/ heterogeneous query processing in Microsoft SQL Server. Piscataway,NJ:IEEE, 2005
  • [7] Milena G I;Martin L K;Niels J N. An architecture for recycling intermediates in a column store. New York:ACM, 2009
  • [8] Jeffrey S V. Design and analysis of dynamic Huffman codes. Journal of the Association for Computing Machinery, 1987,04
  • [9] Stonebraker M;Abadi D J. C-Store:A columnoriented DBMS. New York:ACM, 2005
  • [10] O'Neil P;O'Neil B;Chen Xuedong. Star schema benchmark revision 3 2009. http://www.cs.umb.edu/~ poneil, 2010-02-09
  • [11] Dominik S;Jakub W;Victoria E. Brighthouse:An analytic data warehouse for ad hoc queries. New York:ACM, 2008
  • [12] MacNicol R;French B. Sybase iq multiplex-designed for analytics. San Francisco:Morgan Kaufmann Publishers, 2004
  • [13] Boncz P A. Monet:A next-generation DBMS kernel for query-intensive applications. Amsterdam:Universiteit van Amsterdam, 2002
  • [14] Abadi D J;Madden S R;Hachem N. Column-stores vs.row-stores:How different are they really. New York:ACM, 2008
  • [15] Idreos S;Kersten Martin L;Manegold Stefan. Selforganizing tuple reconstruction in column stores. New York:ACM, 2009
  • [16] Ailamaki A;Dewitt D J. Weaving relations for cache performance. San Francisco:Morgan Kaufmann Publishers, 2001
  • [17] Turner P M J;Hammond R;Cotton P. A DBMS for large statistical database. New York:ACM, 1979
  • [18] Boncz P;Zukowski M;Nes N. MonetDB/X100:Hyperpipelining query execution. New York:ACM, 2005
  • [19] Carcia-M H. Database System Implementation. Englewood Cliffs,New Jersey:Prentice-Hall,Inc, 2000
  • [20] 周立柱. SQL Server数据库原理--设计与实现. 北京:清华大学出版社, 2004
查看更多︾
相似文献 查看更多>>
3.235.66.217