The architecture of a context addressed segment-sequential storage

Authors:
Leonard D. Healy;Gerald J. Lipovski;Keith L. Doty
Affiliations:
U.S. Naval Training Equipment Center, Orlando, Florida;University of Florida, Gainesville, Florida;University of Florida, Gainesville, Florida
Venue:
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Year:
1972

Citing 7
Cited 7

Programming Languages, Information Structures, and Machine Organization.

Programming Languages, Information Structures, and Machine Organization.
On data structures in associative memories

ACM SIGPLAN Notices
A Glass Delay Line Content-Addressed Memory System

IEEE Transactions on Computers
Control Storage Use in Implementing an Associative Memory for a Time-Shared Processor

IEEE Transactions on Computers
Some applications for content-addressable memories

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
An associative processor

AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
The architecture of a large associative processor

AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference

Magnetic Bubble Memory Architectures for Supporting Associative Searching of Relational Databases

IEEE Transactions on Computers
Database Computers A Step Towards Data Utilities

IEEE Transactions on Computers
Sorting with associative secondary storage devices

AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
A specialized architecture for textual information retrieval

AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
RAP: an associative processor for data base management

AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Some problems in associative processor applications to data base management

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Optimization of the file access method in content-addressable database access machine (CADAM)

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new approach to the problem of searching large data bases. It describes an architecture in which a cellular structure is adapted to the use of sequential-access bulk storage. This organization combines most of the advantages of a distributed processor with that of inexpensive bulk storage.