This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An O(n+k) Algorithm for Ordered Retrieval from an Associative Memory
March 1988 (vol. 37 no. 3)
pp. 368-371
The problem of retrieving an ordered list of k words that satisfy a given search condition from an associative memory of m words of n bits each is addressed. A fast ordered retrieval algorithm is proposed, along with a logic design for a cellular associative memory which mechanizes the algorithm. The algorithm is of time complexity O(n+k). By contrast, the fastest previously known algorithms, b

[1] E. H. Frei and J. Goldberg, "A method for resolving multiple responses in a parallel search file,"IRE Trans. Electron. Comput., vol. EC-10, pp. 718-722, Dec. 1961.
[2] M. H. Lewin, "Retrieval of ordered list from a content-addressed memory,"RCA Rev., vol. 23, pp. 215-229, June 1962.
[3] R. R. Seeber and A. B. Lindquist, "Associative memory with ordered retrieval,"IBM J. Res. Develop., vol. 6, pp. 126-136, Jan. 1962.
[4] H. S. Miller, "Resolving multiple responses in an associative memory,"IEEE Trans. Electron. Comput., vol. EC-13, pp. 614-616, Oct. 1964.
[5] A. Wolinsky, "A simple proof of Lewin's ordered retrieval theorem for associative memory,"Commun. ACM, vol. 11, pp. 448-450, July 1968.
[6] G. A. Anderson, "Multiple match resolvers: A new design method,"IEEE Trans. Comput., vol. C-23, pp. 1317-1320, Dec. 1974.
[7] C. C. Foster,Content Addressable Processors. New York: Van Nostrand Reinhold, 1976.
[8] C. V. Ramamoorthy, J. L. Turner, and B. W. Wah, "A design of a fast cellular associative memory for ordered retrieval,"IEEE Trans. Comput., vol. C-27, pp. 800-815, Sept. 1978.
[9] D.-L. Lee, "Fast algorithms for associative memories," M. Sc. Thesis, Dep. Comput. Sci., Univ. Alberta, 1984.
[10] W. A. Davis and D.-L. Lee, "Fast search algorithms for associative memories,"IEEE Trans. Comput., vol. C-35, pp. 456-461, May 1986.

Index Terms:
ordered retrieval; associative memory; search condition; logic design; time complexity; content-addressable storage; logic design.
Citation:
D.-L. Lee, W.A. Davis, "An O(n+k) Algorithm for Ordered Retrieval from an Associative Memory," IEEE Transactions on Computers, vol. 37, no. 3, pp. 368-371, March 1988, doi:10.1109/12.2176
Usage of this product signifies your acceptance of the Terms of Use.