Data Allocation in Distributed Database Systems在分布式数据库系统中的数据分配.ppt

Data Allocation in Distributed Database Systems在分布式数据库系统中的数据分配.ppt

  1. 1、本文档共20页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Data allocation in DDS Data Allocation in Distributed Database Systems Samira Tasharofi Reza Basseda Introduction Primary concern in DDS Designing the fragmentation and allocation of the underlying database Data allocation goal: To fix the sites where the fragments are located so as to minimize the total data transfer cost, under the storage constraints (i.e., the maximum number of fragments that can be allocated at a site) at each of the sites Introduction (Cont.) The data allocation problem is NP-complete in general and requires heuristics that are fast and are capable of generating high-quality solutions The optimal allocation of database objects highly depends on the query execution strategy employed by a distributed database system The given query execution strategy usually assumes an allocation of the fragments Outline Static Algorithms Dynamic Allocation Algorithms Transparent Data Relocation Conclusion References Static Algorithms Genetic Algorithm: begins by generating an initial population, P (t = 0), and evaluating each of its members with the objective function While the terminator condition is not satisfied, a portion of the population is selected, somehow altered, evaluated, and placed back into the population Static Algorithms (Cont.) The Simulated Evolution Algorithm: The principal difference between a genetic algorithm and an evolutionary strategy is that the former relies on crossover, a mechanism of probabilistic and useful exchange of information among solutions to locate better solutions, while the latter uses mutation as the primary search mechanism In the proposed scheme the chromosomal representation is based on problem data, and solution is generated by applying a fast decoding heuristic (mapping heuristic) in order to map from problem domain to solution domain. Static Algorithms (Cont.) The Mean Field Annealing (MFA) Algorithm Combines the collective computation property of the famous Hopfield Neural Network (HNN) with simulated a

文档评论(0)

ranfand + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档