信息不对齐的多域离散数据聚类匹配

Sunil Bollam, J. Kandi
{"title":"信息不对齐的多域离散数据聚类匹配","authors":"Sunil Bollam, J. Kandi","doi":"10.1109/ICESE46178.2019.9194632","DOIUrl":null,"url":null,"abstract":"Outsourcing statistics toward a third party managerial manipulate, when be accomplished within cloud computing, offers increase to protection uncertainties. The facts cooperation may additionally arise because of assaults by way of additional user along with nodes inside the cloud. Consequently, excessive safety procedures be requisite to defend records in the cloud. Nevertheless, engaged safety method should as well recall the optimization of the facts recovery moment in time. Within this term paper, we endorse Division along with Replication of Data inside the Cloud for Optimal Performance along with Security so as to together strategies the safety as well as overall performance issue. In this planned method, we separate a report keen on fragments, in addition to duplicate the split facts in excess of the cloud nodes. every of the nodes stores simplest a single fragment of a exacting facts report that guarantees with the intention of level during case of a success assault, no significant statistics is discovered in the direction of the attacker. Furthermore, the nodes store the fragments, be divided among positive space through way of graph T-coloring toward limit an assailant of guess the places of the fragments. In addition, the planned method does no longer depend on the conventional cryptographic techniques for the statistics safety; thus relieve the structure of computationally exclusive methods. We demonstrate with the intention of the possibility to find in addition to cooperation every the nodes store the fragments of a single document is very low down. We additionally evaluate the presentation of the planned method with ten different frameworks. The better stages of safety with mild overall presentation in the clouds become discovered.","PeriodicalId":137459,"journal":{"name":"2019 International Conference on Emerging Trends in Science and Engineering (ICESE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cluster Matching for Discrete Data with Multiple Domains without Alignment of Information\",\"authors\":\"Sunil Bollam, J. Kandi\",\"doi\":\"10.1109/ICESE46178.2019.9194632\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Outsourcing statistics toward a third party managerial manipulate, when be accomplished within cloud computing, offers increase to protection uncertainties. The facts cooperation may additionally arise because of assaults by way of additional user along with nodes inside the cloud. Consequently, excessive safety procedures be requisite to defend records in the cloud. Nevertheless, engaged safety method should as well recall the optimization of the facts recovery moment in time. Within this term paper, we endorse Division along with Replication of Data inside the Cloud for Optimal Performance along with Security so as to together strategies the safety as well as overall performance issue. In this planned method, we separate a report keen on fragments, in addition to duplicate the split facts in excess of the cloud nodes. every of the nodes stores simplest a single fragment of a exacting facts report that guarantees with the intention of level during case of a success assault, no significant statistics is discovered in the direction of the attacker. Furthermore, the nodes store the fragments, be divided among positive space through way of graph T-coloring toward limit an assailant of guess the places of the fragments. In addition, the planned method does no longer depend on the conventional cryptographic techniques for the statistics safety; thus relieve the structure of computationally exclusive methods. We demonstrate with the intention of the possibility to find in addition to cooperation every the nodes store the fragments of a single document is very low down. We additionally evaluate the presentation of the planned method with ten different frameworks. The better stages of safety with mild overall presentation in the clouds become discovered.\",\"PeriodicalId\":137459,\"journal\":{\"name\":\"2019 International Conference on Emerging Trends in Science and Engineering (ICESE)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Emerging Trends in Science and Engineering (ICESE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICESE46178.2019.9194632\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Emerging Trends in Science and Engineering (ICESE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICESE46178.2019.9194632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

将统计数据外包给第三方管理操作,当在云计算中完成时,会增加保护的不确定性。另外,由于云中的其他用户和节点的攻击,也可能导致事实合作。因此,需要过多的安全程序来保护云中的记录。然而,参与式安全方法也应及时召回事实恢复的优化时刻。在这篇学期论文中,我们认可了云内数据的分割和复制,以实现最佳性能和安全性,从而共同应对安全和整体性能问题。在这种计划的方法中,我们分离了一个热衷于片段的报告,除了复制超过云节点的分裂事实。每个节点存储最简单的精确事实报告的单个片段,以保证在成功攻击的情况下,没有发现攻击者方向的重要统计数据。此外,节点存储碎片,通过图t着色的方式在正空间中划分,以限制猜测碎片位置的攻击者。此外,该方法在统计安全性方面不再依赖于传统的密码技术;从而减轻了计算排他方法的结构。我们的目的是为了找到除了合作之外存储单个文档片段的每个节点的可能性非常低。我们还用十个不同的框架评估了计划方法的呈现。云层中整体呈现温和的较好安全阶段被发现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cluster Matching for Discrete Data with Multiple Domains without Alignment of Information
Outsourcing statistics toward a third party managerial manipulate, when be accomplished within cloud computing, offers increase to protection uncertainties. The facts cooperation may additionally arise because of assaults by way of additional user along with nodes inside the cloud. Consequently, excessive safety procedures be requisite to defend records in the cloud. Nevertheless, engaged safety method should as well recall the optimization of the facts recovery moment in time. Within this term paper, we endorse Division along with Replication of Data inside the Cloud for Optimal Performance along with Security so as to together strategies the safety as well as overall performance issue. In this planned method, we separate a report keen on fragments, in addition to duplicate the split facts in excess of the cloud nodes. every of the nodes stores simplest a single fragment of a exacting facts report that guarantees with the intention of level during case of a success assault, no significant statistics is discovered in the direction of the attacker. Furthermore, the nodes store the fragments, be divided among positive space through way of graph T-coloring toward limit an assailant of guess the places of the fragments. In addition, the planned method does no longer depend on the conventional cryptographic techniques for the statistics safety; thus relieve the structure of computationally exclusive methods. We demonstrate with the intention of the possibility to find in addition to cooperation every the nodes store the fragments of a single document is very low down. We additionally evaluate the presentation of the planned method with ten different frameworks. The better stages of safety with mild overall presentation in the clouds become discovered.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信