Skip to main content
SpringerLink
Log in

Effective utilization of copies in a transparent distributed environment

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

In a distributed relational database system, the processing of a query involves data transmission among different sites via a computer network. In a distributed database multiple copies of each relation can be allocated to different, physically distributed sites. In this paper we discuss the query preoptimization problem for join-queries. In general, there is a large number of possibilities to use the copies of the data item in a distributed relational database when evaluating a join-query. We consider the problem of a copy preselection for each relation in a join sequence of a join-query. We show how to express the preselection problem for a given query and data allocation to the network in terms of an integer linear programming problem, namely, a minimum cover problem. It can be treated as a heuristic for the first phase of a join-query optimization, and as such as an input to the final stage of optimization, the execution strategy generation for a join-query. In this paper we assumed that a distributed system provides fully transparent data management, i.e., data allocation to the network and data replication which is revealed to a user. We illustrate the proposed mathematical programming problem through a nontrivial example.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P.M.G. Apers, “Data allocation in distributed database systems,”ACM Trans. Database Syst., vol. 13, pp. 263–304, 1988.

    Google Scholar 

  2. P.A. Bernstein and D.W. Chiu, “Using semijoins to solve relational queries,”J. ACM, vol. 28, pp. 25–40, 1981.

    Google Scholar 

  3. P.A. Bernstein and N. Goodman, “Power of national semijoins,”SIAM J. Comput, vol. 10, pp. 751–771, 1981.

    Google Scholar 

  4. P.A. Bernstein and N. Goodman, “Query processing in a system for distributed database (SDD-1),ACM TODS, vol. 6, pp. 602–625, 1981.

    Google Scholar 

  5. S. Ceri and G. Pelagatti,Distributed Databases, Principles and Systems, McGraw-Hill, New York, 1984.

    Google Scholar 

  6. S. Ceri, B. Pernici, and G. Wiederhold, “Distributed database design methodologies,”Proc. IEEE, vol. 75, pp. 533–546, 1987.

    Google Scholar 

  7. R. Elmasri and S.B. Navathe,Fundamentals of Database Systems, Benjamin/Cummings, Redwood City, CA, 1989.

    Google Scholar 

  8. T. Ibaraki and T. Kameda, “On the optimal nesting order for computingN-relation joins,”ACM Trans. Database Syst., vol. 9, pp. 482–502, 1984.

    Google Scholar 

  9. S. Khoshafian and P. Valduriez, “Sharing persistence and object-orientation: a databse perspective,” inInt. Workshop Database ProgrammingLanguages, Roscoff, France, 1987, pp. 181–205.

    Google Scholar 

  10. G.M. Lohman, C. Mohan, L. Haas, K.J. Daniels, B. Lindsay, P. Selinger and P. Wilms, “Query Processing in R*,” in W. Kim, D.S. Reiner and D.S. Batory (eds),Query Processing in Database Systems, Springer-Verlag, New York, 1985.

    Google Scholar 

  11. M.E. Orlowska, “A generation of transaction execution plans for distributed databases,” in Int. Symp. Systems Research, Baden-Baden, Germany, 1991, pp. 231–236.

    Google Scholar 

  12. M.E. Orlowska, “On valid vertical fragmentation for distributed databases design,” in Int. Symp. Systems Research, Baden-Baden, Germany, 1991, pp. 237–242.

    Google Scholar 

  13. M.E. Orlowska and K.G. Jeffery, “A functional method of data processing based on relational algebra,” CAiSE-91, Computer Science Lecture Notes 498, Springer-Verlag, 1991, pp. 98–126.

  14. M.T. Ozsu, P. Valduriez,Principles of Distributed Database Systems, Prentice-Hall International Editions, 1991.

  15. H.A. Taha,Operations Research, An Introduction, Macmillan, New York, 1982.

    Google Scholar 

  16. J.D. Ullman,Principles of Relational Databases, Computer Science Press, Rockville, MD, 1988.

    Google Scholar 

  17. Y.C. Zhang and M.E. Orlowska, “Parallel Processing for the Full Reduction of a Chain Query in Distributed Databases,”Information Systems, vol. 18, no. 3, pp. 181–187, 1993.

    Google Scholar 

  18. Y. Zhang and M.E. Orlowska, “An efficient test for the valid distribution of relational databases,”J. Knowledge Engg. Software Engg., vol. 2, pp. 589–609, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Queensland, CEDIS, 4072, St Lucia, Brisbane, Qld, Australia

    Maria E. Orlowska

Authors
  1. Maria E. Orlowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Recommended by: R. Elamsri

Rights and permissions

Reprints and permissions

About this article

Cite this article

Orlowska, M.E. Effective utilization of copies in a transparent distributed environment. Distrib Parallel Databases 1, 409–425 (1993). https://doi.org/10.1007/BF01264015

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01264015

Keywords

Search

Navigation