Journal IJCRT UGC-CARE, UGCCARE( ISSN: 2320-2882 ) | UGC Approved Journal | UGC Journal | UGC CARE Journal | UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, International Peer Reviewed Journal and Refereed Journal, ugc approved journal, UGC CARE, UGC CARE list, UGC CARE list of Journal, UGCCARE, care journal list, UGC-CARE list, New UGC-CARE Reference List, New ugc care journal list, Research Journal, Research Journal Publication, Research Paper, Low cost research journal, Free of cost paper publication in Research Journal, High impact factor journal, Journal, Research paper journal, UGC CARE journal, UGC CARE Journals, ugc care list of journal, ugc approved list, ugc approved list of journal, Follow ugc approved journal, UGC CARE Journal, ugc approved list of journal, ugc care journal, UGC CARE list, UGC-CARE, care journal, UGC-CARE list, Journal publication, ISSN approved, Research journal, research paper, research paper publication, research journal publication, high impact factor, free publication, index journal, publish paper, publish Research paper, low cost publication, ugc approved journal, UGC CARE, ugc approved list of journal, ugc care journal, UGC CARE list, UGCCARE, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, ugc care list 2021, ugc approved journal in 2021, Scopus, web of Science.
How start New Journal & software Book & Thesis Publications
Submit Your Paper
Login to Author Home
Communication Guidelines

WhatsApp Contact
Click Here

  Published Paper Details:

  Paper Title

DYNAMIC MULTI KEYWORD RANKED SEARCH BASED ON BLOOM FILTERS

  Authors

  MANSOOR MIYA,  G.PRAVEEN BABU

  Keywords

Cloud Computing, Encryption, Ranked search scheme, cipher, Data Vector, Stemming algorithm, Efficiency

  Abstract


Mobile cloud computing has entered a new era of technology which would help in keeping large quantity of data in a lesser cost. Platforms for accessing and computing of large amount of data are much more viable than previous days. Researchers have been using large volumes of data for producing out puts and they consider data as an asset. Now a days data is being outsourced for conducting research in different sectors like market study, military purposes, tackling terrorist attacks ,whether forecasting etc this increased the value of data and it has to be kept safe. To preserve the nature of data high level encryption should be done while transferring the data but this may cause problems when multiple users try to access data from a cloud source. Researchers are trying to develop new encryption technique to reduce the risk of security while transferring the data. Solutions that are being discussed are a multi keyword search scheme supporting result ranking by adopting k nearest neighbors knn technique and another is a dynamic searchable encryption scheme through blind storage to conceal access pattern of the search user. Searching the encrypted data should be easy and should provide an easy feeling like using a search engine in the internet. It should also support multi key word search easy identification of relevant search result. The data base would be large the searchable encryption scheme should be in such a way that it would result in minimum delay. The ideal scheme for providing better performance is a multi keyword ranked search.

  IJCRT's Publication Details

  Unique Identification Number - IJCRT2202063

  Paper ID - 215511

  Page Number(s) - a479-a484

  Pubished in - Volume 10 | Issue 2 | February 2022

  DOI (Digital Object Identifier) -   

  Publisher Name - IJCRT | www.ijcrt.org | ISSN : 2320-2882

  E-ISSN Number - 2320-2882

  Cite this article

  MANSOOR MIYA,  G.PRAVEEN BABU,   "DYNAMIC MULTI KEYWORD RANKED SEARCH BASED ON BLOOM FILTERS", International Journal of Creative Research Thoughts (IJCRT), ISSN:2320-2882, Volume.10, Issue 2, pp.a479-a484, February 2022, Available at :http://www.ijcrt.org/papers/IJCRT2202063.pdf

  Share this article

  Article Preview

  Indexing Partners

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
Call For Paper May 2024
Indexing Partner
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
DOI Details

Providing A Free digital object identifier by DOI.one How to get DOI?
For Reviewer /Referral (RMS) Earn 500 per paper
Our Social Link
Open Access
This material is Open Knowledge
This material is Open Data
This material is Open Content
Indexing Partner

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer