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

  • Authors:
  • Stanley Y. W. Su;George P. Copeland;G. Jack Lipovski

  • Affiliations:
  • University of Florida, Gainesville, Florida;University of Florida, Gainesville, Florida;University of Florida, Gainesville, Florida

  • Venue:
  • SIGPLAN '73 Proceedings of the 1973 meeting on Programming languages and information retrieval
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.