Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/332452
Title: Design and Analysis of New Multi Keyword Ranked Search Protocol with Dynamic Updation in Cloud Computing
Researcher: Pawan Kumar Tanwar
Guide(s): Ajay Khunteta and Vishal Goar
Keywords: Computer Science
Computer Science Artificial Intelligence
Engineering and Technology
University: Poornima University
Completed Date: 2020
Abstract: The present research work provides new insights into the applications of cloud computing like multi keyword rank search and dynamic updation. Although the cloud computing provides many facilities including saving of storage and anywhere anytime availability of data but the maintenance of data is still very tedious work. Basically there are three entities involves in the communication of data these are data owner, cloud server and data user. First of all the data owner uploads the data at cloud server in a secure way and at next step the data user queries the data and in reply the cloud server returns the top k (where k is an integer number) documents to the data user. In earlier days the searching of data was restricted to single keyword but in current scenario it is not optimal then comes the multi keyword searching and at next step it becomes multi keyword rank search. In this type of searching the top k ranked documents are retuned. Moreover if any data owner wants to update (modify/insert/delete) the uploaded data then first of all he requires downloading the existing data at local machine and after updating the data he uploads the data at cloud server, which is the wasting of time and local disk space. This research work provides a way to save the local disk space and the time of downloading and again uploading the data by deriving an algorithm which updates the data in a dynamic way. We have proposed the multi property conjunctive word search (MPCWS) schema on the basis of MPT (Multi Property Tree), which we have called MPCWS-MPT. This algorithm satisfies maximum requirements of security and privacy. The experiments shows that in comparison with linear searching our scheme requires little more cost for the formation of index tree along with low computing cost for generating query and trapdoor. The proposed MPCWS-MPT Algorithm supports dynamic update operation (inserts and deletes files). The formation of MPT based index plays a vital role here. The comparative analysis of performances upon various parameter
Pagination: 
URI: http://hdl.handle.net/10603/332452
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
80_recommendation.pdfAttached File242.13 kBAdobe PDFView/Open
certificates.pdf273.94 kBAdobe PDFView/Open
chapter-1.pdf1.64 MBAdobe PDFView/Open
chapter-2.pdf8.64 MBAdobe PDFView/Open
chapter-3.pdf2.47 MBAdobe PDFView/Open
chapter-4.pdf463.51 kBAdobe PDFView/Open
chapter-5.pdf1.29 MBAdobe PDFView/Open
prilimary pages.pdf707.43 kBAdobe PDFView/Open
title page.pdf22.51 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: