Data base processor mage

Authors:
G. Berger Sabbatel
Affiliations:
-
Venue:
CAW '80 Proceedings of the fifth workshop on Computer architecture for non-numeric processing
Year:
1980

Citing 6
Cited 0

The design of a rotating associative memory for relational database applications

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Computer Interconnection Structures: Taxonomy, Characteristics, and Examples

ACM Computing Surveys (CSUR)
A comparative analysis of disk scheduling policies

Communications of the ACM
The architecture of CASSM: A cellular system for non-numeric processing

ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Data Base Machines are Coming, Data Base Machines are Coming!

Computer
RAP: an associative processor for data base management

AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the design of data base processor MAGE. This DBP is based on a hierarchical DB access method. It is composed of two microprocessors, a disk processor and a moving head disk. The processor requirements, design decisions, and architecture are discussed. We start with an overview of DBP framework. The MAGE DB access method is then summarized. Finally, we present the design and implementation of the DBP, with a particular emphasis on the disk processor.