Design Considerations for Data-Flow Database Machines.

Abstract

This paper presents a discussion of the application of data-flow machine concepts to the design and implementation of database machines which execute relational algebra queries. We analyze the performance of multiprocessor nested-loops and sort-merge join algorithms and show that the nested-loops algorithm is generally superior. Three levels of operand granularity for data-flow database machines are introduced and compared using the nested-loops join algorithm. We demonstrate that relation-level granularity is too coarse and that tuple-level granularity is too fine. The third level of granularity, a page of a relation, is shown to be the best choice from both hardware and software viewpoints. Finally a preliminary design for a data-flow database machine which utilizes page-level granularity and supports distributed control of instruction execution is presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1980
Accession Number
ADA086374

Entities

People

  • David J. Dewitt
  • Haran Boral

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Arbitration
  • Bandwidth
  • Computer Programs
  • Contracts
  • Database Management Systems
  • Databases
  • Instructions
  • Mathematics
  • Multiprocessors
  • Numerical Analysis
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Relational Databases
  • Simulations
  • United States

Fields of Study

  • Computer science
  • Engineering

Readers

  • Database Systems and Applications
  • Parallel and Distributed Computing.