ACM

Communications of the ACM

Home/Magazine Archive/July 1982 (Vol. 25, No. 7)/Searching in a dynamic memory with fast sequential.../Abstract

Searching in a dynamic memory with fast sequential access

By Om Vikas, V. Rajaraman
Communications of the ACM, July 1982, Vol. 25 No. 7, Pages 479-484
10.1145/358557.358579
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.