Abstract
The design of a general purpose associative memory is described. Its applications on Prolog clause indexing and on Relational database search/retrieval operations are explored. This associative memory can perform parallel search for multi-word strings or records, and then retrieve any number of pointers or data. It can be used as a standard RAM for random read/write operations, and as a conventional associative memory for relational search and pattern matching.
Research is supported by NSF Grant IRI-881064. Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation.
Preview
Unable to display preview. Download preview PDF.
References
Char, Jois Malathi, Vladimir Cherkassky, Harry Wechsler, and George Lee Zimmerman, “Distributed and Fault-Tolerant Computation for Retrieval Tasks Using Distributed Associative Memories,” IEEE Transactions on Computers, Vol. 37, No. 4, Pages 484–490, April, 1988.
Lee, Dik Lun, "A Distributed Multiple-Response Resolver for Value-ordered Retrieval," Proc. 12th Annual International Symposium on Computer Architecture, Pages 258–265, June, 1985.
Robinson, Ian, "A Prolog Processor Based on a Pattern Matching Memory Device," Proc. International Conference on Logic Programming, Pages 172–179, 1986.
Anderson, Judy M., William S. Coates, Alan L. Davis, Robert W. Hon, Ian N. Robinson, Shane V. Robison, and Kenneth S. Stevens, "The Architecture of FAIM-1," Computer, Pages 55–65, January, 1987.
Moldovan, Dan I. and Yu-Wen Tung, "SNAP: A VLSI Architecture for Artificial Intelligence Processing," Journal of Parallel and Distributed Computing 2, 109–131, 1985.
Naganuma, Jiro, Takeshi Ogura, Shin-Ichiro Yamada, and Takashi Kimura, “High-Speed CAM-Based Architecture for a Prolog Machine (ASCA),” IEEE Transactions on Computers, Vol. 37, No. 11, pages 1375–1383, November 1988.
Lee, Dik Lun, and Lochouskey, Fred, “Text Retrieval Machines,” in Office Automation, D. Tsichritzis, ed., Spring Verley, New York, N.Y., pages 339–375, 1985.
Ogura, Takeshi, Shin-ichiro Yamada, and Junzo Yamada, "A 20Kb CMOS Associative Memory LSI for Artificial Intelligence Machines," IEEE International Conference on Computer Design, Page 574–577, 1986.
Adams, Stuart J., Mary Jane Irwin, and Robert M. Owens, "A Parallel General Purpose CAM Architecture," Advance Research in VLSI, Pages 51–71, 1986.
Sterling, Leon and Ehud Shapiro, The Art of Prolog. The MIT Press, Cambridge, Massachusetts, 1986.
Warren, David H.D., "An Abstract Prolog Instruction Set," Technical Note 309, SRI International, October, 1983.
Foster, Caxton C., Content Addressable Parallel Processors. Van Nostrand Reinhold Co., New York, pages 57–102, 1976.
Foster, Caxton C., Content Addressable Parallel Processors. Van Nostrand Reinhold Co., New York, page 15, 1976.
Robinson, Phillip, "The SUM: An AI Coprocessor," Byte, Pages 169–180, June, 1985.
Kokubu, Akio, Minoru Kuroda and Tatsumi Furuya, "Orthogenal Memory A step Toward Realization of Large Capacity Associative Memory," VLSI 85, E.Horst (editor) Elsevier Science Publisher B.V. (North-Holland), 1986.
Choi, C.H. Ben, “Parallel Distributed Computer Architecture and General Associative Memory for Artificial Intelligent Processing,” Master thesis, Dept. of Electrical Engineering, The Ohio State University, Columbus Ohio, 1988.
Lee, D.L. ALTEP — A cellular processor for high-speed pattern matching. New Generation Computing, Vol. 4, No. 3, pages 225–244, Sept., 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, C.H.B., Lee, D.L. (1989). Generic associative memory for information retrieval. In: Boral, H., Faudemay, P. (eds) Database Machines. IWDM 1989. Lecture Notes in Computer Science, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51324-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-51324-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51324-7
Online ISBN: 978-3-540-46197-5
eBook Packages: Springer Book Archive