An optimized solution for ranking based on data complexity

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud Computing is an emerging field with lot of possibilities for the maintenance at the Infrastructure Layer and Software Layer. A storage architecture is associated with two processes namely the storage and the retrieval process. The storage architecture plays a vital role in how quickly the data is retrieved. The retrieved data is presented as per the weight of the retrieved data. This paper presents a novel secure storage and the ranking mechanism for the documents for cloud. As no previous reference for any data is kept at the server, the data is encrypted based on the co-relation between the data files calculated by Cosine similarity. The ranking of the retrieved data is done through Supervised Machine learning mechanism. The evaluation of the parameters are done on the base of computation time and total number of true retrievals on multi-keyword search. Multiple dataset from Kaggle are used to perform and cross validate the proposed algorithm.

Cite

CITATION STYLE

APA

Malhotra, S., & Singh, W. (2019). An optimized solution for ranking based on data complexity. International Journal of Innovative Technology and Exploring Engineering, 8(11), 4132–4139. https://doi.org/10.35940/ijitee.J9636.0981119

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free