Abstract

In this paper, we propose the Euclidean Distance based Similarity Measurement and Ensuing Ranking (EDSMER) scheme to aid effective document search from outsourced cloud data. It is another attempt to find an alternative to binary based approaches. In this approach, the User or the Data owner needs to filter out the suitable keywords for the document and then the index is prepared. To provide security and privacy, both the data and the index are encrypted and moved to the cloud space. The application of Euclidean Distance based Similarity Measurement and Ensuing Ranking (EDSMER) scheme for document searching takes place after the authorized user requests for the documents through query terms. Initially the authorized user sends a query to Cloud Service Provider to retrieve all the documents which are mapped with the keywords provided by him. The proposed algorithm calculates the distance between the query terms and the index terms. The minimum the distance, the more it is closer towards each other and vice-versa. Our Euclidean Distance based Similarity Measurement and Ensuing Ranking (EDSMER) scheme greatly enhances the system functionality by sending the most relevant documents instead of transmitting all documents back. The experimental validations are performed on RFC and FIRE dataset. Through experimental analysis, we prove that our proposed approach is secure and efficient as well as exhibits better recall and precision rate in the IR system to deal with the document-retrieval process.

Highlights

  • This paper is intended to develop a document searching algorithm based on ranking through finding of similarity between two set of data by way of Euclidean distance calculation

  • The user query is processed with keywords from Cloud Service Provider (CSP) in the EDSMER algorithm to find the smallest distance between the words using Euclidean approach

  • After the trap door is created, the inputted keywords from authorized user are received by EDSMER algorithm

Read more

Summary

Introduction

This paper is intended to develop a document searching algorithm based on ranking through finding of similarity between two set of data by way of Euclidean distance calculation. The ultimate objective of this algorithm is to rank the relevant documents based on the received user query words. Euclidean Distance Based Similarity Measurement And Ensuing Ranking Scheme For Document Search From Outsourced Cloud Data

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.