On data structures in associative memories

  • Authors:
  • G. J. Lipovski

  • Affiliations:
  • University of Florida

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

This report discusses the capability of an associative memory to search some useful data bases. The report utilizes a simplified cell and a collection of "assembler language" instructions to show how sets and trees can be searched in the memory. An OR rail and an EXCLUSIVE OR rail are discussed in relation to their use to search ordered and unordered sets, strings and tree data structures. Linked data structures are also discussed. This report is oriented towards the software aspects of the associative memory to lead to further research in the design of high level languages that utilize the capability of the rails.