Abstract

The storage and retrieval of time dependent data in cloud storage provides challenges with respect to energy, processing time and security. In order to provide effective query performance and security, it is necessary to propose new algorithms for optimal and secure storage and retrieval algorithms for providing optimal performance in cloud databases. In addition, the temporal nature of cloud data necessitates the use of rules to satisfy temporal constraints for providing optimal performance in database services. In this paper, we propose new temporal storage and query processing algorithms for effective storage of temporal data in the cloud using Temporal-B-tree which is a new data structure proposed in this paper which effectively checks the temporal constraints. The proposed algorithm performs optimization by reducing Input Output operations, speed, time, energy and at the same time enhances the security. The main advantage of these proposed algorithms for storage and retrieval are that they reduce the retrieval time and also the storage cost. The experimental results which are obtained from this work show that these two new algorithms provide storage efficiency, retrieval efficiency, energy efficiency and increased security.

Full Text
Published version (Free)

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