sdd1算法的改进及其应用研究-research on improvement and application of sd d1 algorithm.docxVIP

下载本文档

6
0
约5.07万字
约 64页
2018-06-03 发布于上海
举报
版权申诉

sdd1算法的改进及其应用研究-research on improvement and application of sd d1 algorithm.docx

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

sdd1算法的改进及其应用研究-research on improvement and application of sd d1 algorithm

AbstractAs a method of query optimization for distributed database, SDD-1 has its own defects. The two major defects are the communication cost of query plan generated by SDD-1 algorithm is not the least, and it will cost too much time to produce a query plan when there are many query stations. Both of them will reduce the query efficiency.For these two major defects, an I-SDD-1 algorithm based on genetic algorithm is introduced in this paper. I-SDD-1 algorithm uses Genetic Algorithm rather than Hill-climbing algorithm for solving query plan. The population initialization method, population size, fitness function, end condition and other associated genetic operators which are applied to this problem are designed in this paper, and an experiment is also designed to compare SDD-1 algorithm and I-SDD-1 algorithm in efficiency of producing query plan. Then the analysis of the green cleaning database system’s characteristics, based on which I-SDD-1 algorithm is chosen as the query optimization method of green cleaning database system, is present. Finally, a simulation experiment is designed to prove that I-SDD-1 algorithm is better than SDD-1 algorithm in this system.It is proved by the experiments designed in this paper that the communication cost generated by I-SDD-1 algorithm is less than that generated by SDD-1 algorithm in most case. Although when the relatively number of semi-joins is smaller, I-SDD-1 algorithm takes longer time for generating query plan than SDD-1 algorithm, the saving communication cost makes the query efficiency of I-SDD-1 algorithm still higher than SDD-1 algorithm. Moreover, when the relatively number of semi-joins is great, I-SDD-1 algorithm is superior to SDD-1 algorithm in both communication cost and time spent on generating query plan.However, the generic operations have not been designed good enough that the communication cost generated by I-SDD-1 algorithm is always less than SDD-1 algorithm. So it is the future direction of research how