Method and device for searching file data corresponding to a given search key in a hybrid associative memory

摘要

1. A method of searching for data, in accordance with a predetermined search argument, in a data sequence which is composed of equal sized, smallest units as checking units, e. g. characters, in an arbitrary combination, in a hybrid associative store, wherein units of the data sequence are supplied to an associative logic-linking unit together with parameters required for the checking procedure, e.g. search argument, masks, control operand, characterised in that the following steps are provided : a) at the beginning of a search procedure, commencing from the predetermined start element of the data sequence, the individual characters of the data sequence are firstly consecutively checked with the first character of the search argument until a hit is recognised whereupon a hit signal is generated, b) on the occurrence of a hit signal a hit chaining arrangement activates the hit chain, c) for such time as the hit chain exists, all the following characters of the data sequence are checked with the respective, assigned, consecutive characters of the search argument, d) if the end of the data sequence is reached when the hit chain is in existence, the search is continued with the first character of the next data sequence, maintaining the hit chain, e) when a hit signal fails to occur, the hit chain is broken and a new search procedure is initiated with a start element displaced by one character in relation to the previous start element, and is continued in accordance with step f), f) the search procedure is terminated when all the characters of the search argument have been processed or when all the data sequences have been checked, otherwise it is continued in accordance with step a).