Query processing in distributed databases involves the transfer of query from one site to another. As a result of this complexity, additional storage space and time may be needed, which could result in cost overhead since cost is often associated with query execution especially in distributed database. These costs could arise from input/output (I/O), CPU used at each site, cost of transferring data between sites, etc. With increasing volume and complexities of data and information been processed in large databases these days, it becomes very paramount to have a query execution strategy and optimization technique for efficient retrieval of information. In order to minimize the response time and resource utilization of systems, it is necessary to optimize query processing in distributed databases. Various techniques have been used in the past but these techniques all require that the user have a good knowledge of the whole data thus making them unsuitable for autonomous distributed databases where nodes are unaware of each other. This paper proposed an object- oriented technique that can be used for processing information with minimum response time and resource usage in distributed databases. The result of our technique actually shows that data can be retrieved with minimal delay.
展开▼
