Method of searching for data sequences which correspond to a pre-defined search argument and are contained in a hybrid associative memory

摘要

A method by which it can be established whether a search argument is included in character strings, which are stored in a memory (B-SP), is given. The search is carried out using a logic device (ASS-FL), which consists of logic units (ALV0 to ALV63), which work autonomously and independently of each other. The first character of the search argument is fed from a parameter memory (PAR-SP) to the logic units (ALV to ALV63). Similarly, the first characters of the character strings (ZK0 to ZK63) which are stored in a field (F1) of the memory (B-SP) are fed in parallel to the logic units (ALV0 to ALV63) which are assigned to these character strings. Logic units which establish, for example, that the characters of the character string and those of the search argument are equal, output a hit signal (T), and the other logic units are blocked. The search procedure is then carried out with the second character of the search argument and the second character of the character string. The search procedure in a field (F) is always broken off if none of the logic units (ALV) outputs a hit signal, and otherwise when all the characters of the search argument correspond to all the characters of at least one character string in the field. If no character string of a field corresponds to the search argument, the search procedure in this field is broken off very quickly, since on average after two ... Original abstract incomplete. IMAGE