This Article 
 Bibliographic References 
 Add to: 
On Optimal Site Assignment for Relations in the Distributed Database Environment
August 1989 (vol. 15 no. 8)
pp. 1004-1009

In a distributed database environment, the site assignment of relations is a critical issue. When the joint operations in a query involve relations over multiple sites, the site to carry out the joint operation can have a significant impact on the performance. Based on the query descriptions and arrival frequency to each site, a methodology is developed to assign relations and determine joint sites simultaneously. The methodology first decomposes queries into relation steps and then makes site assignments based on either a linear integer programming technique to minimize the amount of intersystem communication while balancing resource utilizations across systems, or a heuristic technique to minimize average response time under similar resource constraints.

[1] P. M. G. Apers, "Query processing and data allocation in distributed database systems," Ph.D. dissertation, Amsterdam, The Netherlands, Sept. 1982: also in Mathematical Centre Tract 156, Amsterdam, The Netherlands, Mar. 1983.
[2] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDD-I),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[3] S. Ceri, S. Navathe, and G. Wiederhold, "Distribution design of logical database schemas,"IEEE Trans. Software Eng., vol. SE-9, no. 4, pp. 487-504, July 1983.
[4] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377-387, June 1970.
[5] D. W. Cornell, D. M. Dias, and P. S. Yu, "On multisystem coupling through function request shipping,"IEEE Trans. Software Eng., vol. SE-12, no. 10, pp. 1006-1017, Oct. 1986.
[6] D. W. Cornell and P. S. Yu, "A vertical partitioning algorithm for relational databases," inProc. 3th IEEE Data Eng., 1987.
[7] D. Cornell and P. S. Yu, "Site assignment for relations and join operations in the distribuled transaction processing enviromment," inProc. 4th Int. Conf. Data Engineering, Los Angeles, CA, Feb. 1988, pp. 100-108.
[8] D. Cornell and P. S. Yu, "On optimal site assignment for relations in distributed database environment," IBM Res. Rep., 1989.
[9] D. Daniels, P. Selinger, L. Hass, B. Lindsay, C. Mohan, A. Walker, and P. Wilms, "An introduction to distributed query compilation in R*," inDistributed Data Bases, H. J. Schneider, Ed. Amsterdam, the Netherlands: North-Holland, 1982. pp. 291-310.
[10] L. W. Dowdy, and D. V. Foster, "Comparative models of the file ss-signment problem,"ACM Comput. Surveys, vol. 14, no. 2, pp. 287-313, June 1982.
[11] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, no. 4598, pp. 671-680, May 1983.
[12] C. V. Ramamoorthy and B. Wah, "The placement of relations on a distributed relational database," inProc. 1st Int. Conf. Distributed Computing Systems, Huntsville, AL, Oct. 1979, pp. 642-649.
[13] D. Sacca and G. Wiederhold, "Database partitioning in a cluster of processors," IBM Res. Rep RJ4076, Oct. 1983.
[14] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[15] L. G. Waters, "Reduction of integer polynomial problems to zero-one linear programming problems,"Oper. Res., vol. 15, pp. 1171- 1174, 1967.
[16] P. S. Yu, D. Cornell, D. M. Dias, and A. Thomasian, "On coupling partitioned database systems," inProc. 6th Int. Conference on Distritbuted Computing Systems, Cambridge, MA, May 1986, pp. 148- 157.
[17] J. L. Wolf, D. M. Dias, B. R. Iyer, and P. S. Yu, "A hybrid data sharing-data partitioning architecture for transaction processing," inProc. 4th Int. Conf. Data Eng., Los Angeles, CA, Feb. 1988.

Index Terms:
relation assignment; joint site determination; query decomposition; average response minimization; optimal site assignment; distributed database environment; relations; joint operations; multiple sites; query descriptions; arrival frequency; relation steps; site assignments; linear integer programming technique; intersystem communication; balancing resource utilizations; heuristic technique; resource constraints; distributed databases; heuristic programming; information retrieval; linear programming
D.W. Cornell, P.S. Yu, "On Optimal Site Assignment for Relations in the Distributed Database Environment," IEEE Transactions on Software Engineering, vol. 15, no. 8, pp. 1004-1009, Aug. 1989, doi:10.1109/32.31356
Usage of this product signifies your acceptance of the Terms of Use.