Highly Parallel Processing of Relational Databases.

Abstract

New computer architectures are feasible because of the advances in VLSI design and fabrication technologies. Among them, highly parallel structures coordinate hundreds of thousands of processing elements that function cooperatively. These structures are especially useful in solving computationally intensive problems. This thesis applies the highly parallel approach to improve the efficiency in processing relational database queries. High-performance algorithms for basic relational operations are explored. Efficient composition of these algorithms to process whole queries is also investigated.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1983
Accession Number
ADA137961

Entities

People

  • C. C. Hsiao

Organizations

  • Purdue University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Content Addressable Memory
  • Database Management Systems
  • Databases
  • Digital Communications
  • Language
  • Linear Arrays
  • Mass Storage
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Relational Database Management Systems
  • Relational Databases
  • Software Development

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Parallel and Distributed Computing.