sub-join面向闪存数据库的查询优化算法 sub-join query optimization algorithm for flash-based database.pdfVIP

下载本文档

1
0
约2.28万字
约 9页
2017-09-05 发布于上海
举报
版权申诉

sub-join面向闪存数据库的查询优化算法 sub-join query optimization algorithm for flash-based database.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

sub-join面向闪存数据库的查询优化算法 sub-join query optimization algorithm for flash-based database

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@ Journal of Frontiers of Computer Science and Technology 1673-9418/2010/04(05)-0401-09 Tel: +86-10 DOI: 10.3778/j.issn.1673-9418.2010.05.002 Sub-Join* , , + , 100872 * Sub-Join: Query Optimization Algorithm for Flash-Based Database LIANG Zhichao, ZHOU Da, MENG Xiaofeng+ Information School, Renmin University of China, Beijing 100872, China + Corresponding author: E-mail: xfmeng@ LIANG Zhichao, ZHOU Da, MENG Xiaofeng. Sub-Join: Query optimization algorithm for flash-based data- base. Journal of Frontiers of Computer Science and Technology, 2010, 4(5): 401-409. Abstract: Compared with hard drive disk (HDD), solid state disk (SSD) has a lot of advantages, such as high ran- dom read performance, low power consumption and lightweight form. Therefore it is envisioned to be next genera- tion data storage instead of HDD. However, the enhancement of query performance for flash-based database is not the same as the I/O ratio of SSD to HDD. The reason is existing databases which are designed for HDD can not take full advantage of high I/O performance of SSD. A new join algorithm, Sub-Join, is proposed. Sub-Join firstly pro- jects the column of join and primary key as Sub-Table, and then executes join operations on Sub-Tables. Finally re- sults are gotten from original table according to the result of join on Sub-Tables. The compared experiments with Oracle Berkeley DB show Sub-Join outperforms original indexed nested-loop join at the ratio of about 40%~100%, which shows the high efficiency of this method. Key words: solid state disk (SSD); flash memory; flash-based database; query optimization; Sub-Join ,