Optimizing resource allocation for approximate real-time query processing

Abstract

Query optimization techniques are proved to be essential for high performance of database management systems. In the context of new querying paradigms, such as similarity based search, exact query evaluation is neither computationally feasible nor meaningful, and approximate query evaluation is the only reasonable option. In this paper a problem of resource allocation for approximate evaluation of complex queries is considered. An approximate algorithm for a near-optimal resource allocation is presented, providing the best feasible quality of the output subject to a limited total cost of a query. The results of experiments have shown that the approximate resource allocation algorithm is accurate and efficient.

An Improved Resource Allocation Model for Grid Computing Environment

“…A genetic algorithm based resource scheduling is presented for mobile cloud computing by [2,20]. The crossover and mutation is used to generate new population.…”

“…In a grid environment, various resources are geographically distributed and used for meeting the demand of high-performance computing. Due to dynamicity and availability issue, discovery [1], selection and allocation of resource [2] is challenging task. Broadly every resource allocation technique follows three phases [3]- Resource discovery-In this phase, a list is made of all resources which are accessible for executing the user request.…”