网站大量收购闲置独家精品文档,联系QQ:2885784924

云计算的安全架构与技术_第6节.ppt

  1. 1、本文档共44页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
云计算的安全架构与技术_第6节

Chains of Privileges and Metadata * Dirty Data Management in Cloud Database Introduction Data quality problem is caused by dirty data refers to inconsistent, inaccurate, erroneous, redundant, and outdate data Massive data sets contain dirty data in higher probability the difficulty of maintaining massive data errors in large storage devices will lead to more errors in data the probability of inconsistent data becomes large Platform for massive data management is necessary to manage dirty data in cloud databases * Introduction Building cloud databases is a feasible way to manage massive data sets In cloud database, three types of compute nodes master is to manage slave nodes router is to store index in cloud database slave stores data and process query locally * Cloud database * Cloud database Example of cloud database one master node two router nodes To store node index to locate slave nodes which possibly contain query results six slave nodes To store representatives and data index * Cloud database When a query is injected it is sent to a router the router searches the index to find the set of slaves containing the query results. After index searching, the query is sent to a set of slave nodes Slave nodes return local results these results are merged as final query results * Storage Model for Dirty Data Based on the inconsistency in dirty data cluster-based strategy is used to store the data the tuples in table T is partitioned into {C1:{P1, P2, P3}, C2:P4, C3:{P5, P6, P7}, C4: P8g} In a cloud database dirty data are distributed on multiple slave nodes partitioned based on the differences among tuples * Indexing Structures for Dirty Data The indexing structures have three tiers Representatives tuples in same cluster are identified by a representative tuple Data index data indices are constructed to find representative for a query Node index efficiently locating all relative compute nodes possibly contain query

文档评论(0)

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

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

1亿VIP精品文档

相关文档