利用优化技术获取相关数据分区的新方法

S. Saravanan, V. Venkatachalam
{"title":"利用优化技术获取相关数据分区的新方法","authors":"S. Saravanan, V. Venkatachalam","doi":"10.1109/ICRTCCM.2017.26","DOIUrl":null,"url":null,"abstract":"Over the past several decades there is an exceptionally large improvement in the computer technology which leads to an uncountable number of data and information emerging in and all over the world. Due to this tremendous and huge dump of data as well as web data most popular search engines are experiencing a lot of irrelevant retrieval of data. The major aspire of this proposed Improved Weis to identify an accurate data search and also to generate data that comes from anywhere. Furthermore, the data itself may be too large to store on a single machine such that the computers are inter connected with each other by the massive internet storage technologies. This approach mainly focuses on design of search engines and its infrastructure grave. Improved Micro partitioning is a modularized approach of cloud computing mainly framed to overcome the pitfalls in the traditional search engine and also in manipulation of large information stored in a single computer. The Map Reduce Task Scheduling algorithm which has been used in the cloud helps in overcoming the challenges of conventional methodologies. The map reduce protocol model is a simple model that makes the data to save in different locations by partitioning the data technique. Additionally in order to avoid the uneven distribution of data the data sampling technique is used. Henceforth, the Search engine in cloud produces low-latency and the data materialization will increase the efficiency in its optimized search and thus outperforms the traditional approaches.","PeriodicalId":134897,"journal":{"name":"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Method for Acquiring Relevant Data Partitioning by Optimization Techniques\",\"authors\":\"S. Saravanan, V. Venkatachalam\",\"doi\":\"10.1109/ICRTCCM.2017.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Over the past several decades there is an exceptionally large improvement in the computer technology which leads to an uncountable number of data and information emerging in and all over the world. Due to this tremendous and huge dump of data as well as web data most popular search engines are experiencing a lot of irrelevant retrieval of data. The major aspire of this proposed Improved Weis to identify an accurate data search and also to generate data that comes from anywhere. Furthermore, the data itself may be too large to store on a single machine such that the computers are inter connected with each other by the massive internet storage technologies. This approach mainly focuses on design of search engines and its infrastructure grave. Improved Micro partitioning is a modularized approach of cloud computing mainly framed to overcome the pitfalls in the traditional search engine and also in manipulation of large information stored in a single computer. The Map Reduce Task Scheduling algorithm which has been used in the cloud helps in overcoming the challenges of conventional methodologies. The map reduce protocol model is a simple model that makes the data to save in different locations by partitioning the data technique. Additionally in order to avoid the uneven distribution of data the data sampling technique is used. Henceforth, the Search engine in cloud produces low-latency and the data materialization will increase the efficiency in its optimized search and thus outperforms the traditional approaches.\",\"PeriodicalId\":134897,\"journal\":{\"name\":\"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTCCM.2017.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTCCM.2017.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在过去的几十年里,计算机技术有了非常大的进步,这导致了无数的数据和信息出现在世界各地。由于这种巨大的数据转储以及网络数据,大多数流行的搜索引擎都经历了大量不相关的数据检索。这个改进的Weis的主要目标是识别准确的数据搜索,并生成来自任何地方的数据。此外,数据本身可能太大,无法存储在一台机器上,这样计算机就可以通过大规模的互联网存储技术相互连接。该方法主要关注搜索引擎的设计及其基础架构。改进的微分区是一种模块化的云计算方法,主要是为了克服传统搜索引擎的缺陷,以及在单个计算机中存储的大量信息的操作。在云中使用的Map Reduce任务调度算法有助于克服传统方法的挑战。map - reduce协议模型是一种简单的模型,它通过数据分区技术使数据保存在不同的位置。此外,为了避免数据的不均匀分布,采用了数据采样技术。因此,云中的搜索引擎具有低延迟性,数据物化将提高其优化搜索的效率,从而优于传统方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Method for Acquiring Relevant Data Partitioning by Optimization Techniques
Over the past several decades there is an exceptionally large improvement in the computer technology which leads to an uncountable number of data and information emerging in and all over the world. Due to this tremendous and huge dump of data as well as web data most popular search engines are experiencing a lot of irrelevant retrieval of data. The major aspire of this proposed Improved Weis to identify an accurate data search and also to generate data that comes from anywhere. Furthermore, the data itself may be too large to store on a single machine such that the computers are inter connected with each other by the massive internet storage technologies. This approach mainly focuses on design of search engines and its infrastructure grave. Improved Micro partitioning is a modularized approach of cloud computing mainly framed to overcome the pitfalls in the traditional search engine and also in manipulation of large information stored in a single computer. The Map Reduce Task Scheduling algorithm which has been used in the cloud helps in overcoming the challenges of conventional methodologies. The map reduce protocol model is a simple model that makes the data to save in different locations by partitioning the data technique. Additionally in order to avoid the uneven distribution of data the data sampling technique is used. Henceforth, the Search engine in cloud produces low-latency and the data materialization will increase the efficiency in its optimized search and thus outperforms the traditional approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信