Optimization of Data Access in Distributed Systems
Alan R. Hevner, S. Bing Yao · Purdue e-Pubs (Purdue University System) · 1978
The application of computer network technology ~o-database systems has produced much interest in distributed database systems.Query processing on a distributed system is seen to be quite a different problem from query processing on a centralized system.A query requiring data from two or more distinct nodes in the network must be solved by a distribution strategy that consists of a schedule of local data proceasing and data transmissions.Two cost measures, total time and response time, are used to judge the quality of a given distribution st~ategy.Methods that find efficient distribution strategies for queries are proposed and snalyzed.Algo~ithms that embody simple distribution tactics are shown to be optimal in the sense of minimizing response time and total time for a special class of queries.A method fs proposed to extend the optimal algorithms to derive efficient distribution strategies fo~general query processing in distributed database systems.