Searching in a dynamic memory with fast sequential access

  • Authors:

  • Om Vikas;V. Rajaraman

  • Affiliations:

  • National Informatics Centre, New Delhi, India;Indian Institute of Technology, Kanpur, India

  • Venue:
  • Communications of the ACM
  • Year:
  • 1982

Quantified Score

Hi-index 48.22

Visualization

Abstract

This communication presents an algorithm for searching in the Aho-Ullman dynamic memory consisting of (2m - 1) cells. Mean search time of 1.5m steps to the first specified record is obtained with a subsequent sequential access capability. Thus, in such a dynamic memory, the mean access time for content addressing is the same as the mean access time for random addressing.