Competition is always a good thing in IT world. It forces us to do our best. Nowadays, in the area of cloud computing, it is at the peak between the larger number of cloud users and cloud providers who view for the opportunity to use and provide services. Competition among cloud users means the price of cloud services never fall very low and between cloud providers mean the price of services never rises very high. It gives an opportunity to users toa find good cloud resource provider who provideQoS at the cheapest rate, on the other hand, competition between providers to attract the cloud users. This leads to use pay-per-use model of cloud computing but the growing structured and unstructured datasets force us to enhance the flexibility of database resources in cloud computing. We present the elasticity definition for the DBaaS and improve the response time of the database resources such as random access memory access efficiency by using the bloom filter space efficient data structure. It filter the records before join operation of the complex query. On improving the response time it directly affects the elasticity of the DBaaS. We consider the venerable relational database(RDBMS) instead of the native database (NOSQL) for the complex queries of OLAP workload and achieve the 40% enhancement in elasticity over the without bloom filter models. This achievement eases the life of cloud providers to follow the use pay-per-use principle to attract their client.