An associative/parallel processor for partial match retrieval using superimposed codes
暂无分享,去创建一个
[1] G. Jack Lipovski,et al. The architecture of a context addressed segment-sequential storage , 1972, AFIPS '72 (Fall, part II).
[2] Daniel L. Slotnick. Logic per Track Devices , 1970, Adv. Comput..
[3] Diane C. P. Smith,et al. Relational Data Base Machines , 1979, Computer.
[4] John D. Gabbe,et al. Applications of superimposed coding to partial-match retrieval , 1978, COMPSAC.
[5] D.A. Hodges,et al. A review and projection of semiconductor components for digital storage , 1975, Proceedings of the IEEE.
[6] R. M. Bird,et al. Associative/parallel processors for searching very large textual data bases , 1977, CAW '77.
[7] Calvin N. Mooers,et al. Zatocoding applied to mechanical organization of knowledge , 1951 .
[8] Stewart A. Schuster,et al. RAP.2-An Associative Processorfor Databasesand ItsApplications , 1979 .
[9] David K. Hsiao,et al. Structure memory designs for a database computer , 1977, ACM '77.
[10] A.H. Bobeck,et al. Magnetic bubbles—An emerging new memory technology , 1975, Proceedings of the IEEE.
[11] Kenneth C. Smith,et al. RAP.2—An Associative Processor for Databases and Its Applications , 1979, IEEE Transactions on Computers.
[12] C.S. Roberts,et al. Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.
[13] Stanley Y. W. Su,et al. Cellular-Logic Devices: Concepts and Applications , 1979, Computer.
[14] Kenneth C. Smith,et al. RAP: an associative processor for data base management , 1975, AFIPS '75.