搜索变得简单:一个基于多线程的桌面搜索引擎

Prakhar Gupta, R. Negi, S. Shekhar
{"title":"搜索变得简单:一个基于多线程的桌面搜索引擎","authors":"Prakhar Gupta, R. Negi, S. Shekhar","doi":"10.1109/CSNT.2017.8418570","DOIUrl":null,"url":null,"abstract":"This paper proposes the faster version of the searching tool used in desktops. The searching tool normally used is based on sequential search i.e. the drives are searched in a sequential manner one after the other which is time consuming. In this paper we have proposed a version based on the multithreading approach, the number of threads equal to the number of drives in the desktop are created. Since multiple threads can be executed simultaneously so all the drives are searched simultaneously rather than sequentially. The searching results are displayed to the user. The proposed version is checked multiple times on different desktops and results are obtained in the less time than the normal searching tool. The version is totally implemented in java, efficient and fast searching tool.","PeriodicalId":382417,"journal":{"name":"2017 7th International Conference on Communication Systems and Network Technologies (CSNT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Searching made easy: A multithreading based desktop search engine\",\"authors\":\"Prakhar Gupta, R. Negi, S. Shekhar\",\"doi\":\"10.1109/CSNT.2017.8418570\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes the faster version of the searching tool used in desktops. The searching tool normally used is based on sequential search i.e. the drives are searched in a sequential manner one after the other which is time consuming. In this paper we have proposed a version based on the multithreading approach, the number of threads equal to the number of drives in the desktop are created. Since multiple threads can be executed simultaneously so all the drives are searched simultaneously rather than sequentially. The searching results are displayed to the user. The proposed version is checked multiple times on different desktops and results are obtained in the less time than the normal searching tool. The version is totally implemented in java, efficient and fast searching tool.\",\"PeriodicalId\":382417,\"journal\":{\"name\":\"2017 7th International Conference on Communication Systems and Network Technologies (CSNT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 7th International Conference on Communication Systems and Network Technologies (CSNT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNT.2017.8418570\",\"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 7th International Conference on Communication Systems and Network Technologies (CSNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2017.8418570","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了桌面搜索工具的快速版本。通常使用的搜索工具是基于顺序搜索,即以顺序的方式一个接一个地搜索驱动器,这是耗时的。在本文中,我们提出了一个基于多线程方法的版本,线程的数量等于桌面中创建的驱动器的数量。由于多个线程可以同时执行,所以所有驱动器都是同时搜索的,而不是按顺序搜索的。搜索结果显示给用户。建议的版本在不同的桌面上进行多次检查,并在比常规搜索工具更短的时间内获得结果。本版本完全用java语言实现,是高效快速的搜索工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Searching made easy: A multithreading based desktop search engine
This paper proposes the faster version of the searching tool used in desktops. The searching tool normally used is based on sequential search i.e. the drives are searched in a sequential manner one after the other which is time consuming. In this paper we have proposed a version based on the multithreading approach, the number of threads equal to the number of drives in the desktop are created. Since multiple threads can be executed simultaneously so all the drives are searched simultaneously rather than sequentially. The searching results are displayed to the user. The proposed version is checked multiple times on different desktops and results are obtained in the less time than the normal searching tool. The version is totally implemented in java, efficient and fast searching tool.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信