{"title":"No-escape search: Design and implementation ofcloud based directory content search","authors":"Harshit Gujral, Abhinav Sharma, S. Mittal","doi":"10.1109/IC3.2017.8284288","DOIUrl":null,"url":null,"abstract":"Searching in-file content is a crucial task in everyday computing, made particularly difficult due to lack of efficient in-file content search system in windows operating system. The goal of this paper is to present a cloud-based exhaustive in-file content search algorithm using three dimensional hash data structure. To facilitate an abundant size of hash and to save user's memory space we have used cloud for accommodating hash structure. We aim at presenting the user with required retrieval in the time complexity of O (constant), usually within 3–8 seconds. Our retrieval is a comprehensible combination of user's input string, the filename(s) containing it. Also, unlike windows operating system's search system, it permits to include location(s) and even multiple occurrences of user defined string inside a file.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Tenth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2017.8284288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Searching in-file content is a crucial task in everyday computing, made particularly difficult due to lack of efficient in-file content search system in windows operating system. The goal of this paper is to present a cloud-based exhaustive in-file content search algorithm using three dimensional hash data structure. To facilitate an abundant size of hash and to save user's memory space we have used cloud for accommodating hash structure. We aim at presenting the user with required retrieval in the time complexity of O (constant), usually within 3–8 seconds. Our retrieval is a comprehensible combination of user's input string, the filename(s) containing it. Also, unlike windows operating system's search system, it permits to include location(s) and even multiple occurrences of user defined string inside a file.