The mechanism towards generation of query evaluation plans particularly in distributed database system can be referred to as optimization of distributed queries. In fact the schema and queries can be linked to logical portions of data. The performance of the system especially in distributed database environment, are dependent on query evaluation plans and cost of queries. Usually, in the distributed database systems, as the queries linked to datasets may be accumulated in several heterogeneous locations, it can enhance the accessibility of inter query plans prioritizing the query execution strategies. In fact, the enhancement of size of clusters also depends on the voluminous data linked with the databases. Accordingly, to make better performance on query execution, suitable optimization criteria can be adopted so that the dependability of query plans can be preserved as well as searching abilities of local and global optimal query plans can be observed. In this work, the heuristic algorithm is implemented to manage the size of the databases in distinct locations with stored voluminous data. The main aim of the proposed algorithm implemented in this work is to focus on search capabilities both locally and globally to minimize the difficulties of linking the criteria while obtaining optimality. As a result, the query plans can be generated with minimal execution cost with better efficiency.