A parallel pipelined relational query processor: An architectural overview

  • Authors:
  • Daniel Gajski;Won Kim;Shinya Fushimi

  • Affiliations:
  • Department of Computer Science, University of Illinois, Urbana, Ill;IBM Research, 5600 Cottle Road, San Jose, Calif.;University of Tokyo, 7-3-1 Hongo Bunkyo-ku, Tokyo 113, Japan

  • Venue:
  • ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper outlines the overall architecture of a query processor for relational queries and describes the design and control of its major processing modules. The query processor consists of only four processing modules and a number of random-access memory modules. Each processing module processes tuples of relations in a bit-serial, tuple-parallel manner for each of the primitive database operations which comprise a complex relational query. The query processor is designed to be manufacturable using existing VLSI technology, and to support in a uniform manner both the numeric and nonnumeric processing requirements a high-level query language like SQL presents.