Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Properties of semijoin sequences

Abstract

The problem of finding optimum semijoin sequence for an arbitrary query under linear cost function for the transmission cost is NP-hard. Hence heuristic algorithms with desirable properties are explored. In this paper four properties of semijoin programs for distributed query processing are identified. The use of these properties in constructing semijoin sequence is justified. An existing algorithm is modified incorporating these properties. Empirical comparison with existing algorithms shows the superiority of the proposed algorithm.

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

References

  1. [1]

    Apers, P.M.G., Hevner, A.R. and Yao, S.B., Optimization algorithm for distributed queries,IEEE Trans. on Software Eng.,28:1 (1983), 57–68.

  2. [2]

    Bernstein, P.A. and Chiu, D.M., Using semijoin to solve relational queries,J. ACM,28:1 (1981), 25–40.

  3. [3]

    Black, P.A. and Luk, W.S., A New Heuristic for Generating Semijoin Programs for Distributed Query Processing, IEEE COMPSAC, 1982, 581–588.

  4. [4]

    Chung, C. W. and Irani, K.B., A Semijoin Strategy for Distributed Query Optimization, IEEE Int. Conf. on Distributed Computing System, 1984.

  5. [5]

    Codd, E.F., A relational model of data for large shared data banks,CACM,13:6 (1970), 377–389.

  6. [6]

    Hevner, A.R., Optimization of Query Processing in Distributed Databases, PhD Dissertation, Purdue University, Lafayette, Indiana, Sept., 1979.

  7. [7]

    Hevner, A.R. and Yao, S.B., Query Processing on a Distributed Database, Procs. 3rd Berkeley Workshop on Distributed Data Management and Comp. Networks, August, 1978.

  8. [8]

    Hevner, A.R. and Yao, S.B., Query processing in distributed database system,IEEE Trans on Soft. Eng., SE-5:3 (1979), 177–187.

  9. [9]

    Goodman, N.et al., Query Processing in SDD-1: A system for Distributed Databases, Tech. Rep. CCA-79-06. Computer Corporation of America, 1979.

  10. [10]

    Bernstein, P.A., Goodman, N., Wong, E., Reeve, C.L. and Rothnie, Jr. J.B., Query processing in a system for distributed databases (SDD-1),ACM TODS,6:4 (1981), 602–625.

  11. [11]

    Srinivasan, B., and Ooi, B.C., Optimal Properties of Semijoin Sequences for Distributed Query Processing, Technical Report, National University of Singapore, July, 1987.

  12. [12]

    Wong, E., Retrieving Dispersed Data from SDD-1: A System for Distributed Databases, Proc. 2nd Berkeley Workshop on Distributed Management and Computer Networks, May, 1977, 217–235.

  13. [13]

    Yao, S.B., Approximating block access in database organisation,CACM,20:4 (1977), 260–261.

  14. [14]

    Yu, C.T. and Chang, C.C., Distributed query processing,ACM Computing Surveys,16:4 (1984), 399–433.

  15. [15]

    Yu, C.T. and Chang, C.C., On the Design of a Query Processing Strategy in a Distributed Database Environment, Proc. ACM SIGMOD, 1983, 30–39.

  16. [16]

    Yu, C.T. and Ozsoyoglu, M.E., An Algorithm for Tree Query Membership of a Distributed Query, IEEE COMPSAC, 1979, 306–312.

Download references

Author information

Correspondence to Beng C. Ooi.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ooi, B.C., Srinivasan, B. Properties of semijoin sequences. J. of Comput. Sci. & Technol. 4, 106–115 (1989). https://doi.org/10.1007/BF02943358

Download citation

Keywords

  • Query Processing
  • Attribute Size
  • User Site
  • Transmission Cost
  • Assembly Site