Query processing in a system for distributed databases (SDD-1)

  • Authors:

  • Philip A. Bernstein;Nathan Goodman;Eugene Wong;Christopher L. Reeve;James B. Rothnie, Jr.

  • Affiliations:

  • Harvard Univ., Cambridge, MA;Harvard Univ., Cambridge, MA;Univ. of California at Berkeley, Berkeley;Massachusetts Institute of technology, Cambridge;Computer Corp. of America, Cambridge, MA

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1981

Quantified Score

Hi-index 0.04

Visualization

Abstract

This paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each Datalanguage query into a relational calculus form called an envelope, which is essentially an aggregate-free QUEL query. This paper is primarily concerned with the optimization of envelopes.Envelopes are processed in two phases. The first phase executes relational operations at various sites of the distributed database in order to delimit a subset of the database that contains all data relevant to the envelope. This subset is called a reduction of the database. The second phase transmits the reduction to one designated site, and the query is executed locally at that site.The critical optimization problem is to perform the reduction phase efficiently. Success depends on designing a good repertoire of operators to use during this phase, and an effective algorithm for deciding which of these operators to use in processing a given envelope against a given database. The principal reduction operator that we employ is called a semijoin. In this paper we define the semijoin operator, explain why semijoin is an effective reduction operator, and present an algorithm that constructs a cost-effective program of semijoins, given an envelope and a database.