US 4,366,551 AGranted

Associative memory search system

OwnerKlaus E. Holtzinventor

Life of this patent

Estimating the term…

Loading patent…

Abstract

A knowledge storage and retrieval method is performed to result in a single address number of a storage region which represents a large quantity of information. A first character of a data sequence and a starting number are directed into a two-position buffer to form an input matrix. The storage locations of the storage region are addressed to see if the matrix is found in the storage region. If the matrix is found, the address number of the storage location of the storage region at which it is found is then stored in the second position of the buffer region. Then the next data character is directed into the first position of the buffer region and the searching step is repeated. If the matrix in the buffer region is not found in the storage region, the matrix is stored in a free storage location of the storage region and the address number of the free storage location is directed into the second position of the buffer. The next data character is moved into the first position and the searching step is repeated. Eventually, all of the data characters of a data sequence will be stored and the address number representing a storage location of the last-to-be stored data character will represent all of the data characters of the data sequence that were stored.

Claims7

Dependent claims

A machine implemented method of conversion of a data sequence into a single address number of an addressable storage location in a storage region, comprising the steps of:

(a) providing a storage region having a plurality of machine addressable storage locations for storing machine readable data characters;
(b) directing the first data character of a data sequence and a starting number into respective first and second positions of a two-position, machine operable buffer region, the data character and the starting number, when received in respective positions of the buffer region, defining a machine readable input character matrix;
(c) machine addressing the storage locations of the storage region and machine reading the content of each storage location to determine if the input character matrix in the buffer region is stored in the storage region;
(d) if the input character matrix in the buffer region is not stored in said storage region, storing the input character matrix in a free storage location of said storage region and directing the address number of said free storage location into the second position of the buffer region;
(e) if the input character matrix in the buffer region is storage in a storage location of said storage region, directing the address number of the storage location at which the input character matrix is stored into the second position of the buffer region;
(f) directing the next data character of said data sequence into said first position of the buffer region to cause the next data character and the address number in respective positions of the buffer region to form another machine readable input character matrix;
(g) repeating steps c through f for each of the next and remaining data characters of the data sequence;
and
(h) terminating the repeating step after the input character matrix corresponding to the last data character of the data sequence has been stored or found to be stored in said storage region, the address number of the storage location which identifies the last input character matrix being operable to represent the data sequence.

6 more elements

A machine implemented method of associating together a particular pair of related sets out of a group of sets, each set having a plurality of machine readable data sequences with the data sequences of each set capable of being stored in a plurality of addressable storage locations of a first storage region available, respectively, for each set, each set being represented by an identifying address number, the identifying address number of a set being the address number of the storage location in the respective first storage region corresponding to the last data sequence of the set, said method comprising:

(a) providing a second storage region having a plurality of machine addressable storage locations, each storage location of the second storage region having first and second positions for storing the respective identifying address numbers of each of a plurality of pairs of related sets of machine readable data sequences;
(b) directing the identifying address number of a selected set of data sequences into a first position of a two-position, machine operable buffer zone;
(c) machine addressing the storage locations of the second storage region and machine reading the identifying address numbers in the first positions of the storage locations thereof to find if the identifying address number of the selected set of data sequences is stored in the first position of a storage location of the second storage region;
(d) if the identifying address number of the selected set of data sequences is found in the first position of a storage location of the second storage region, machine reading the identifying address number in the second position of such storage location and using it to determine which other set of the group of sets is related to the selected set of data sequences;
(e) if the identifying address number of the selected set of data sequences is not found in the first position of a storage location of the second storage region, providing an identifying address number of a set of data sequences intended to be related to said selected set of data sequences, directing said identifying address number of the related set into the second position of the buffer zone, and storing the contents of the buffer zone in the first and second positions of a free storage location of said second storage region, whereby the selected set of data sequences will be associated with said set of data sequences intended to be related.

2 more elements

A machine implemented method of converting a specific set of a group of sets of machine readable data sequences into a single output address number of a machine addressable storage location in a primary storage region, each data sequence of said specific set having a number of data characters capable of being stored in respective machine addressable storage locations of a data sequence storage region and each data sequence being identified by a machine readable identifying address number, each identifying address number identifying the storage location of the data sequence storage region at which the last data character of the respective data sequence is stored, said method comprising:

(a) providing a primary storage region having a plurality of machine addressable storage locations, the storage locations of the primary storage region being capable of storing respective identifying address numbers of a group of sets of data sequences;
(b) directing machine readable identifying address numbers of said specific set of data sequences into respective positions of a multiple-position, machine operable buffer zone to form an input matrix;
(c) machine addressing the storage locations of the primary storage region and machine reading the set of identifying address numbers in each storage location thereof to find if the input matrix is stored in a storage location of the primary storage region;
(d) if the input matrix is found to be stored in a storage location of the primary storage region, determining the address of the storage location of the primary storage region at which the input matrix is stored, the last-mentioned address being said single output address number of said specific set of data sequences;
and
(e) if the input matrix is found not to be stored in a storage location of the primary storage region, storing the input matrix in a free storage location of the primary storage region, the address number of the last-mentioned storage location being said single output address number of said specific set of data sequences.

3 more elements

Dependencies are inferred from the claim text.

Facts

Application: 06/087,280Filed 22 Oct 1979 · continuation
Priority: 16 Jun 1975
Granted: 28 Dec 1982
Term ends: Not estimatedThe source records don’t support an estimate.

Classification5 codes

G06N 3/044
Architecture, e.g. interconnection topology: recurrent networks, e.g. Hopfield networks
Y10S 707/961
Organization of data: associative
Y10S 707/99931
Data processing: database and file management or data structures: database or file accessing
G06N
AI and machine learning