SHIEF: A realizable form of associative memory
Benjamin F. Cheydleur · American Documentation · 1963
Abstract To map the connections between index terms and items, a threaded‐list system of organizing a standard computer memory is developed. Two regions of memory are required: one for effecting content‐addressability and the other for associativity and cross‐referencing. Through special microsequencing and finely structured linkaging, the system obviates serialized scanning as a search strategy. When joined with discs and bulk memory, the system can be used for information retrieval without recourse to batch‐processing of retrieval items. Since responses to any one of a large variety of queries can be made within human reaction time, a SHIEF system should meet the speed requirements satisfactory for browsability, including indirect referencing.