Patent GB-1197429-A (GB)
Title: Automatic information retrieval system
Inventor: FUJIMURA EIJI
IPC: G06F17/30
Filed: 1968-04-16
Abstract: 1,197,429. Information retrieval system. E. FUJIMURA. 16 April, 1968. No. 36114/69. Headings G4A and G4C. An information retrieval system comprises a random access memory having a plurality of addresses each defined by a pair of co-ordinates x and y, a comparator, means for presenting to said comparator on inquiry data code Iq and the contents K of successive addresses x, y in said random access memory for comparison, said means being arranged to start with address x = y = 1 and including x calculating means arranged to change the value of x to x + 1 after each comparison and y calculating means responsive to said comparator to change the value of y to 2y - 1 after each comparison in which K exceeds Iq and to change the value of y to 2y after each comparison in which Iq exceeds K, and means for detecting when Iq equals K. The system is used in an automated telephone number information system in which the telephone numbers are associated with binarydecimal codes based on at least part of the subscriber's name, his occupation and his address, in which the numbers with associated codes are stored in a file memory comprising drums or discs and the random access (core) memory referred to above stores keywords to provide a means of quick access to the relevant track of the file memory. The values K in the random access memory are the initial values of the codes in each track and are arranged as a conventional logarithmic look-up table, whereby each comparison eliminates half the remaining possible tracks. Means may be provided for deriving a subscriber's code automatically from the first (say) 5 letters of his first and second names, from the postal area and street (say) of his address (using look-up tables if necessary) and from coarse and fine generic classifications of occupational terms. The codes may be divided into a first part and a second part, the first part being used to access the most likely part of the track (based on statistical analysis of entries having the same first parts) and the full code being used for exact matching. In the arrangement shown (Fig. 1), an operator sat at a desk 101 uses a keyboard 102 to enter details (name, address, occupation) of the subscriber enquired about into a processor 103 which is programmed to derive the associated code and to search through its memory including drums 104 for a matching code. The associated telephone number (or numbers plus codes if there is no exact or unique match) are printed out by a typewriter 105 or printer 107 for the operator to communicate to the enquirer. A stand-by processor 103<SP>1</SP> is provided together with connections including an area interconnect buffer 110 to systems for other telephone areas. The arrangement may include an endless tape unit 108 for reproducing standard messages, such as " thank you for waiting " and an audio reproducer unit 106 for reconstructing the sounds of the retrieved telephone numbers. New information is fed into the system by a reader 109 for cards, paper tape or magnetic tape. Rules are laid down for selecting what information should be keyed in on receiving an enquiry, but certain subscribers are entered twice where for example their name consists of two parts which may be quoted in either order. The tracks are only partially filled initially to allow for expansion of stored information, but overflow into other tracks is permitted. A tape unit 112 stores information about the failures, i.e. enquiries for which a number has not been retrieved.