Distributed Query Plan generation using Aggregation based Multi-Objective Genetic Algorithm
Vikram Singh, Vikash Mishra · 2014
In a major decision for the query processor of the database management system in centralized as well as distributed environments is how a query can produce the efficient result. A distributed database (DDB) helps to improve network performance, reliability, availability and modularity. The DDB consists of multiple, logically interrelated an autonomous database over a well structured computer network. The performance of distributed database system is dependent on how efficiently a query plans are processed. The distribution, heterogeneity and autonomy are three important issues that may affect querying data in DDB. In DDB query processing requires data communication among sites, the cost of communication plays important & critical role on the selection of optimistic query plans. The selection of optimal query plans is the core activity of DQP; this optimistic task is NP-complete in nature. The data transmissions along with the local data processing constitute a distribution strategy for a query. This strategy is referred to as Distributed Query Processing (DQP).