Join processing in relational databases

  • Authors:
  • Priti Mishra;Margaret H. Eich

  • Affiliations:
  • -;Southern Methodist Univ., Dallas, TX

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 1992

Quantified Score

Hi-index 0.01

Visualization

Abstract

The join operation is one of the fundamental relational database query operations. It facilitates the retrieval of information from two different relations based on a Cartesian product of the two relations. The join is one of the most diffidult operations to implement efficiently, as no predefined links between relations are required to exist (as they are with network and hierarchical systems). The join is the only relational algebra operation that allows the combining of related tuples from relations on different attribute schemes. Since it is executed frequently and is expensive, much research effort has been applied to the optimization of join processing. In this paper, the different kinds of joins and the various implementation techniques are surveyed. These different methods are classified based on how they partition tuples from different relations. Some require that all tuples from one be compared to all tuples from another; other algorithms only compare some tuples from each. In addition, some techniques perform an explicit partitioning, whereas others are implicit.