Indian Journal of Science and Technology
Year: 2018, Volume: 11, Issue: 48, Pages: 1-5
S. K. Shaheena Begum* and Prathi Lakshmi Venkata Pavani Sujitha
Objective: To study the efficient phrase search technique on the basis of Bloom filters that is considerably faster compared to existing solutions. Methods/Statistical Analysis: Nowadays, keyword search is very popular technique to retrieve the data from clouds, in which the keyword can be processed over encrypted data and retrieve most of irrelevant results. Many authors investigate the different searching techniques to retrieve sensitive information from the clouds. But few of them only focus on conjunctive keyword search. Hence, in this paper we present An Efficient Phrase Search technique using Bloom filters that are very fast compared with existing techniques and our scheme reduce storage and computational overheads. Findings: To evaluate our scheme we collect the set of 1500 documents and these documents are pre-processed to avoid headers and footers to decrease the distorted in the statistics of the given dataset. Then we apply the Bloom filters technique to improve the performance in our scheme. Finally, our scheme achieves lower storage and computational overheads rather than existing techniques. Applications/Improvements: Our proposed technique explores a series of n-gram filters to uphold the functionality. The scheme manifests a trade-off between storage and false positive rate.
Keywords: Bloom Filters, Cloud Computing, Multiple Keyword Search, Phrase Search
Subscribe now for latest articles and news.