A relational database machine for efficient processing of statistical queries

  • Authors:
  • Hamid Farsi;John Tartar

  • Affiliations:
  • -;-

  • Venue:
  • SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the design of a data base machine for supporting statistical data bases. The primary objective of this research is to introduce an architecture which performs efficiently in executing relational operations on fully transposed files. This objective is met by utilization of two functionally specialized subsystems: category and summary subsystems. The category subsystem exploits the parallel, content addressed search capabilities of associative memories (AM) while the summary subsystem employs a set of functionally equivalent processors suitable for evaluating statistical functions. In order to support processing of category attributes, the design of an extended associative memory has been considered and its features are presented. The most important feature of this AM stems from its ability to sort selected tuples of a relation, with respect to several attributes simultaneously and at the same time to produce an inverted list for each attribute. Sorting is performed by enumeration. The sorted inverted lists are used for efficient execution of relational projection and join operations.