Data structuring and indexing for data base machines

Authors:
Jayanta Banerjee
Affiliations:
-
Venue:
CAW '80 Proceedings of the fifth workshop on Computer architecture for non-numeric processing
Year:
1980

Citing 4
Cited 1

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
Hierarchical Data-Base Management: A Survey

ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks

Communications of the ACM
A methodology for supporting existing CODASYL databases with new database machines

ACM '78 Proceedings of the 1978 annual conference - Volume 2

A DAG clustering algorithm for design configurations

ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our focus in this paper is not the design of new and improved hardware for data base management. Instead, our main interest is to document the results of our investigation on the data structuring and indexing requirements of the class of data base machines that contain partitioned content-addressable memory (PCAM).