Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 3440–3444Cite as

Semijoin Program

  • Reference work entry
  • First Online:

  • 5 Accesses

Synonyms

Semijoin reducer

Definition

A semijoin program is a query execution plan for queries to distributed database systems that uses semijoins to reduce the size of relation instances before they are transmitted and further joined. Yet the reduction itself requires that a projection of the relation instances involved in the join onto the join attributes be transmitted. The maximum amount of reduction can be achieved by a semijoin program called a full reducer. Full reducers that do not require the computation of a fixpoint exist for acyclic queries. Fully reducing relation instances is rarely beneficial. However semijoin programs partially reducing selected relation instances may be an effective optimization when the dominant cost of query execution is communication. Considering semijoin programs considerably increases the distributed query optimization search space.

Historical Background

Semijoin programs were first introduced to improve the performance, input/output operations and...

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Bernstein PA, Chiu D-MW. Using semi-joins to solve relational queries. J ACM. 1981;28(1):25–40.

    Article  MATH  Google Scholar 

  2. Bernstein PA, Goodman N. Power of natural semijoins. SIAM J Comput. 1981;10(4):751–71.

    Article  MathSciNet  MATH  Google Scholar 

  3. Bernstein PA, Goodman N, Wong E, Reeve CL, Rothnie Jr JB. Query processing in a system for distributed databases (SDD-1). ACM Trans Database Syst. 1981;6(4):602–25.

    Article  MATH  Google Scholar 

  4. Ceri S, Pelagatti G. Distributed databases: principles and systems. New York: McGraw-Hill; 1984.

    MATH  Google Scholar 

  5. Fagin R. Degrees of acyclicity for hypergraphs and relational database schemes. J ACM. 1983;30(3):514–50.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lal A, Choueiry BY. Constraint processing techniques for improving join computation: a proof of concept. In: Proceedings of the 1st International Symposium on Applications of Constraint Databases; 2004. p. 149–67.

    Chapter  MATH  Google Scholar 

  7. Ozkarahan EA, Schuster SA, Sevcik KC. Performance evaluation of a relational associative processor. ACM Trans Database Syst. 1977;2(2):175–95.

    Article  Google Scholar 

  8. Stocker K, Kossmann D, Braumandl R, Kemper A. Integrating semi-join-reducers into state of the art query processors. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 575–84.

    Google Scholar 

  9. Ullman JD. Principles of database and knowledge-base systems, vol. II. Rockville: Computer Science; 1989.

    Google Scholar 

  10. Valduriez P, Gardarin G. Join and semijoin algorithms for a multiprocessor database machine. ACM Trans Database Syst. 1984;9(1):133–61.

    Article  Google Scholar 

  11. Wallace M, Bressan S, Provost TL. Magic checking: constraint checking for database query optimization. In: Proceedings of the ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications; 1995. p. 148–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National University of Singapore, School of Computing, Department of Computer Science, Singapore, Singapore

    Stéphane Bressan

Authors
  1. Stéphane Bressan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stéphane Bressan .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Computer Science, National Univ. of Singapore, Singapore, Singapore

    Kian-Lee Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Bressan, S. (2018). Semijoin Program. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_709

Download citation

Publish with us

Policies and ethics

Search

Navigation