Relational Assignments for Distributed Database Systems
Original Publication Date: 1988-Jun-01
Included in the Prior Art Database: 2005-Feb-15
A technique is described whereby transaction characteristics and arrival frequency to each site in a distributed database system assigns relations so as to minimize the amount of inter-system communications. Algorithms are used to decompose queries into simple relational steps and expanded with potential message steps, so as to equalize the workload across systems. The concept simultaneously balances resource utilization among the various systems, resulting in effective optimization of performance for the distributed database systems. In prior art, finding an optimum assignment of the relations to the different distributed database system sites and selecting the most efficient strategy for processing a query has presented problems in that query strategies attempt to minimize the hardware resource requirements for each query.