scispace - formally typeset
Journal ArticleDOI

The design of a rotating associative memory for relational database applications

TLDR
RARES is designed to enhance the performance of an optimizing relational query interface by supporting important high level optimization techniques and can perform tuple selection operations at the storage device and also can provide a mechanism for efficient sorting.
Abstract
The design and motivation for a rotating associative relational store (RARES) is described. RARES is designed to enhance the performance of an optimizing relational query interface by supporting important high level optimization techniques. In particular, it can perform tuple selection operations at the storage device and also can provide a mechanism for efficient sorting. Like other designs for rotating associative stores, RARES contains search logic which is attached to the heads of a rotating head-per-track storage device. RARES is distinct from other designs in that it utilizes a novel “orthogonal” storage layout. This layout allows a high output rate of selected tuples even when a sort order in the stored relation must be preserved. As in certain other designs, RARES can usually output a tuple as soon as it is found to satisfy the selection criteria. However, relative to these designs, the orthogonal layout allows an order of magnitude reduction in the capacity of storage local to the search logic.

read more

Citations
More filters
Journal ArticleDOI

Query Optimization in Database Systems

TL;DR: These methods are presented in the framework of a general query evaluation procedure using the relational calculus representation of queries, and nonstandard query optimization issues such as higher level query evaluation, query optimization in distributed databases, and use of database machines are addressed.
Journal ArticleDOI

A case for intelligent disks (IDISKs)

TL;DR: This work presents a computer architecture for decision support database servers that utilizes “intelligent” disks (IDISKs), which utilize low-cost embedded general-purpose processing, main memory, and high-speed serial communication links on each disk.
Journal ArticleDOI

Implementing a relational database by means of specialzed hardware

TL;DR: New hardware is described which allows the rapid execution of queries demanding the joining of physically stored relations, with the main feature of the hardware being a special store which can rapidly remember or recall data.
Journal ArticleDOI

Parallel algorithms for the execution of relational database operations

TL;DR: In this article, the authors presented and analyzed algorithms for parallel processing of relational database operations in a general multiprocessor framework and introduced an analysis methodology which incorporates I/O, CPU, and message costs.
Journal ArticleDOI

Direct—A Multiprocessor Organization for Supporting Relational Database Management Systems

TL;DR: The design of DIRECT, a multiprocessor organization for supporting relational database management systems is presented, which has a multiple-instruction multiple-data stream (MIMD) architecture that can simultaneously support both intra-query and inter-query concurrency.
References
More filters
Journal ArticleDOI

A relational model of data for large shared data banks

TL;DR: In this article, a model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced, and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.

A Relational Model of Data for Large Shared Data Banks (Original Manuscript)

E. F. Codd
TL;DR: A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Journal ArticleDOI

Optimizing the performance of a relational algebra database interface

TL;DR: An approach for implementing a “smart” interface to support a relational view of data is proposed to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level query specification supplied by the user.
Proceedings ArticleDOI

RAP: an associative processor for data base management

TL;DR: Pointer mechanisms for mapping structures and providing fast access paths have to be implemented by software and data for efficient search mechanisms to handle large data bases within concurrent processing and on-line response limits.
Proceedings ArticleDOI

CASSM: a cellular system for very large data bases

TL;DR: The application view of CASSM, a Clontext Addressed Segment Sequential Memory implemented on a head-per-track disc and an array of non-numeric microprocessors, offers potential solutions to several large data base problems.