A Hierarchical Associative Architecture for the Parallel Evaluation of Relational Algebraic Database Primitives.

Abstract

Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a relational algebra on a proposed non-von Neumann machine based on a hierarchy of associative storage devices. This architecture permits an O(log n) decrease in time complexity over the best known evaluation methods on a conventional computer system, without the use of redundant storage, and using currently available and potentially competitive technology. In many cases of practical import, the proposed architecture may also permit a significant improvement (by a factor roughly proportional to the capacity of the primary associative storage device) over the performance of previously implemented or proposed database machine architectures based on associative secondary storage devices. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1979
Accession Number
ADA083573

Entities

People

  • David Elliot Shaw

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Classification
  • Computational Science
  • Computer Programming
  • Computer Science
  • Computers
  • Content Addressable Memory
  • Database Management Systems
  • Databases
  • Information Processing
  • Information Science
  • Information Systems
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Relational Databases

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Engineering
  • Database Systems and Applications