Skip to main content
SpringerLink
Log in

Two-way join optimization in partitioned database systems

  • Complexity And Optimization
  • Conference paper
  • First Online:
ICDT '88 (ICDT 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 326))

Included in the following conference series:

  • 154 Accesses

Abstract

The optimization of two-way joins is studied in order to minimize the response time in a partitioned database. We assume that the background communication network is capable of parallel transmission, which differentiates the response time measure from the total cost measure. However, we do not make the standard simplifying assumption that communications between different sites is uniform, which results in a nonlinear optimization formulation of the problem. Subsequently, we derive a fast polynomial algorithm to solve the problem. Two less general algorithms are also proposed to explore the effect of local semijoins and remote semijoins as reducers. Finally, computational experiments are carried out to investigate the trade-off between the computation time and the quality of solutions as well as to analyze the sensitivity of the solutions to various parameters of our model.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apers, P. M. G., Hevner, A. R. and Yao, S. B., "Optimization Algorithms for Distributed Queries", IEEE Transactions on Software Engineering, Vol. SE-9 No. 1, Jan. 1983, 57–68.

    Google Scholar 

  2. Bernstein, P. A. and Goodman, N., "Query Processing in a System for Distributed Database (SDD-1)", ACM Transactions on Database Systems, Vol. 6, No. 4, Dec. 1981, 602–625.

    Google Scholar 

  3. Ceri, S. and Gottlob, G., "Optimizing Joins between Two Partitioned Relations in Distributed Databases", Journal of Parallel and Distributed Computing, Vol. 3, 1986, 183–205.

    Google Scholar 

  4. Ceri, S. and Pelagatti, G., Distributed database Principle and Systems, McGraw-Hill Book Company, New York, 1985.

    Google Scholar 

  5. Daniels, D. et al., "An Introduction to Distributed Query Compilation in R*.", Distributed Data Bases, H. J. Schneider, ed., North-Holland, 1982.

    Google Scholar 

  6. Epstein, R., Stonebraker M. and Wong, E., "Distributed Query Processing in a Relational Database", Proceedings SIGMOD International Conference on Management of Data, May 1978, 169–180.

    Google Scholar 

  7. Gavish, B. and Segev, A., "Set Query Optimization in Horizontally Partitioned Distributed Database Systems", ACM Transaction on Distributed Database Management Systems, Vol. 11, No. 3, 1986, 265–293.

    Google Scholar 

  8. Hevner, A. R. and Yao, S. B., "Query Processing in Distributed Database systems", IEEE Transaction on Software Engineering, Vol. SE-5, No. 3, May 1979, 177–187, 69–88.

    Google Scholar 

  9. Lafortune, S. and Wong, E., "A State Transition Model for Distributed Query Processing", ACM Transactions on Database System, Vol. 11, No. 3, Sept. 1986, 294–322.

    Google Scholar 

  10. Maier, D., The Theory of Relational Databases, Computer Science Press, Rockville, Maryland, 1983.

    Google Scholar 

  11. Pelagatti, G., and Manning, E. D., "A Model of an Access Strategy in a Distributed Database System", In Proceedings of the IFIP-TC2, Database Architecture, 1979

    Google Scholar 

  12. Segev, A., "Optimization of Join Operations in Horizontal Partitioned Database Systems", ACM Transactions on Database Systems, Vol. 11, No. 1, March 1986, 48–80.

    Google Scholar 

  13. Stonebraker, M. and Neuhold, E., "A Distributed Database Version of INGRES", In Proceedings of the 3rd Berkeley Workshop on the Distributed Data Management and Computer Networks, 1977.

    Google Scholar 

  14. Syslo, M. M., Deo, N. and Kowalik, J., "Discrete Optimization Algorithms with Pascal Programs", Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1983.

    Google Scholar 

  15. Williams, R., et al., "R*: An overview of the architecture", IBM Res. Rep. RJ3325, 1981.

    Google Scholar 

  16. Yu, C. T., Chang, C. C. and Chang, Y., "Two Surprising Results in Processing Simple Queries in Distributed Databases", Proceedings of the IEEE 6th International Computer Software and Application Conference, 1982, 377–384.

    Google Scholar 

  17. Yu, C. T., Chang, C. C., "On the design of a query processing strategy in a distributed databases", Proceedings of the ACM SIGMOD Database Week, 1983, 30–39.

    Google Scholar 

  18. Yu, C. T. and Chang, C. C., "Distributed Query Processing", Computing Surveys, Vol. 16, No. 4, December 1984, 399–433.

    Google Scholar 

  19. Yu, C. T. and Chang, C. C. et al., "Query Processing in a Fragmented Relational Distributed Systems: Mermaid", IEEE Transaction on Software Engineering, Vol. SE-11, No. 8, August 1985, 795–810.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Fang Li & Lawrence V. Saxton

Authors
  1. Fang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lawrence V. Saxton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marc Gyssens Jan Paredaens Dirk Van Gucht

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, F., Saxton, L.V. (1988). Two-way join optimization in partitioned database systems. In: Gyssens, M., Paredaens, J., Van Gucht, D. (eds) ICDT '88. ICDT 1988. Lecture Notes in Computer Science, vol 326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50171-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-50171-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50171-8

  • Online ISBN: 978-3-540-45943-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation