Retrieval operations and data representations in a context-addressed disc system

This paper attempts to demonstrate that simple expansion of the processing capabilities of fixed disc read and write heads can avoid the multilevel mappings from high-level retrieval language to machine language and from user oriented data representation (information structure) to machine oriented data representation (storage structure) which are found necessary in conventional von Neumann computers. The processing capabilities built in the disc read and write heads for each disc track allow information files to be segmented and data items stored on all segments to be searched, modified, inserted, deleted, rearranged and rewritten simultaneously as a set of discs are rotating. Information structures such as the network structure, the hierarchical or tree structure and the relational structure are discussed and their implementations and basic search operations in the disc system are described.

[1]  Vincent Y. Lum,et al.  Quantitative evaluation of design tradeoffs in file systems , 1971, SIGIR '71.

[2]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[3]  A. Metaxides,et al.  Data base task group report to the CODASYL programming language committee , 1969, DATB.

[4]  Richard H. Fuller,et al.  Study of associative processing techniques , 1965 .

[5]  E. F. Codd,et al.  Normalized data base structure: a brief tutorial , 1971, SIGFIDET '71.

[6]  G. Jack Lipovski,et al.  The architecture of a context addressed segment-sequential storage , 1972, AFIPS '72 (Fall, part II).

[7]  Barry D. Wessler,et al.  Computer network development to achieve resource sharing , 1899, AFIPS '70 (Spring).

[8]  C. J. Date.  Relational Data Base Systems: A Tutorial , 1974 .

[9]  Stanley Y. W. Su,et al.  The architecture of CASSM: A cellular system for non-numeric processing , 1973, ISCA 1973.

[10]  Charles Kellogg,et al.  The converse natural language data management system: current status and plans , 1971, SIGIR '71.

[11]  Robert William Engles,et al.  A Tutorial on Data-Base Organization , 1972 .

[12]  Codasyl Systems CommitteeCORPORATE.  Introduction to feature analysis of generalized data base management systems , 1971 .

[13]  Stanley Y. W. Su,et al.  Managing semantic data in an associative net , 1971, SIGIR '71.

[14]  James L. Parker,et al.  A Logic-Per-Track Retrieval System , 1971, IFIP Congress.

[15]  A. G. Merten,et al.  Transferability and Translation of Programs and Data , 1974 .

[16]  Martin Kay,et al.  THE MIND SYSTEM: THE STRUCTURE OF THE SEMANTIC FILE , 1970 .

[17]  Naftaly H. Minsky.  Rotating storage devices as partially associative memories , 1972, AFIPS '72 (Fall, part I).

[18]  Stuart C. Shapiro,et al.  A Net Structure Based Relational Question Answerer: Description and Examples , 1969, IJCAI.

[19]  Behrooz Parhami.  A highly parallel computing system for information retrieval , 1972, AFIPS '72 (Fall, part II).

[20]  Gerhard L. Hollander.  Quasi-random access memory systems , 1956, AIEE-IRE '56 (Eastern).