Query Optimisation in a Complex Network
George Semeczko · 1993
In distributed database design, the problem of query optimisation is an important one. In a distributed database system queries are optimised to reduce either communication costs or response time. As the creation of queries and the state of a database system are not static, it is often desired that query optimisers should be executed at run time and not run as a compiling process at design time. Therefore it is desirable that query optimisers not only return an efficient query plan but also carry out the query optimisation efficiently. In this paper we take an existing query optimisation algorithm and show how it can be executed more efficiently. This is done by reducing the complexity of the algorithm by using knowledge about the network configuration.