JPS62205590A - Shortening device for retrieval time of picture information - Google Patents

Abstract

PURPOSE:To retrieve efficiently and to shorten a retrieval time by storing the information addresses of retrieved picture information by rearranging them in the decreasing or increasing order and reading them out in accordance with the order in which they were stored. CONSTITUTION:A rearranging control part 302 reads one of the information addresses in an input buffer 301, compares it with the largest address in the preceding time in a comparison part 304 and stores in buffers 307, 308 according to the scale. Similarly, all the addresses in the buffer 301 are stored in the sequence from the smallest. At the same time, among the comparison differences in the comparison part 304, a maximum value MA and a minimum value MI are stored in registers 310, 311. In the reading of the information, according to the values of the MA, MI, a selector 309 is changed over to sequentially take out from the largest address. Thus, the addresses are rearranged so as to make the sum of the moving distance of a reading head a minimum, thereby the retrieval time can be shortened.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates generally to an information retrieval device, and particularly to an image information search time reduction device suitable for shortening image information search time.

[Background of the invention]

Videotex and other companies use a magnetic storage type image memory for each dog because it is necessary to have a large amount of image information as a data bank.When searching for data stored in this magnetic type memory, It is necessary to mechanically move the read head. Therefore, the farther the physical position of the head is from the storage location of the requested image data, the longer the search time will be.

Conventional image information retrieval methods perform information @ retrieval according to the chronological order of image information requests, so if the requested image information is not located in one area on the magnetic memory, the distance traveled by the read head is The search time is long (
There is an inconvenience that this happens.

A related device of this type is "Method and Performance Evaluation of Disk Fist Cache to Commercialize Disk Access in Large General-purpose Machines" by Borus Kaneko, published in Nikkei Encto-A-Nix 19B5.5.11, page 205. There is.

[Purpose of the invention]

An object of the present invention is to provide an image information search time reduction device that reduces memory search time.

[Summary of the invention]

In order to achieve the above object, in the present invention, the search order of the image information to be searched is rearranged so that the sum of the moving distances of the read head becomes minimum, and then the image information is searched.

[Embodiments of the invention]

Hereinafter, one embodiment of the present invention will be described with reference to the drawings.

FIG. 2 is a configuration diagram of an image response system, in which an embedded image tube [10 receives an image request signal 6 from an image control device (DpEl) 11 and calculates an information address and request source information for the image information. It consists of a main control unit [(DPUo) 2, an image information retrieval time reduction unit [(, 507') 5, which rearranges the order of information addresses as described in detail later from the information address, and a disk controller 4, and a magnetic storage long tl
tcDsK) 5 moves a read head (not shown) according to the order of information addresses sent from the disk controller 4, and searches for image information.

FIG. 1 is a detailed block diagram of the image information search time reduction device 3. As shown in FIG. The shortening device 3 has an input buffer (BUF) into which the information address and request source information are input via a bus 7.
O) 501 and array e, tsLfas (CT L)
302', time measurement s (TIM) 305, comparison unit (CMP) 504, final information address holding register (RGO) 305, and input switching selector C3ELO) 3
06, positive polarity buffer (BUI?1') 307, negative polarity buffer (BUF2) 30B, and output switching selector (
SELl) 309 and maximum value register (RGl) 310
and minimum i=register (/?G2)3N.

The above-mentioned messages are stored in the power buffer 301 in the order in which they were forwarded. The number of information stored in this buffer 301, that is, the number of information to be rearranged, is determined by the rearrangement control unit 3.
02, for example, a predetermined number set in advance or the number transferred during a certain period of time given by the time measurement unit 303, and after this number of information is stored in the buffer 301, the sorting control unit 502 outputs a BSY signal to the bus 7 to stop information transfer until the rearrangement process described below is completed.

The control unit 302 reads out one information address in the input buffer 301, and reads it from the V raster 305 using the largest information address at the time of the previous sorting process (the final information address at the time of the previous 1'# report search, that is, (the reading head is stopped at this position) and the comparing section 30
Compare with 4.

Then, the comparison unit 504 switches and controls the selector 306,
If the comparison result is positive, the information address is transferred to the first buffer 307; if the comparison result is negative, the information address is transferred to the second buffer 307.
Move to 08. Next, the control 5302 controls the power buffer 30
When one information address is read from 1, it is transferred to the first bucket 307 or the second bucket 7508 in the same manner as described above.
Move to. At this time, the information is stored while being successively compared with the information address in the storage location so that the addresses are stored in the same buffer in ascending order. In this way, all information addresses in the input buffer 301 are transferred to the first and second buffers 5.
07, moved to 508. At the same time, the maximum value (hereinafter referred to as MA) and the minimum value (hereinafter referred to as MI) among the comparison results of the comparison unit 504 are stored in the respective registers 310.
, 511.

First buffer 307. When transferring the information address in the M2 buffer 508 to the disk controller 4 via the bus 7, the selector 3 is selected according to the value of M A + M I.
09 and read out as follows. If the values of HAνM'l are both positive, the information address is stored only in the first buffer 307 (the second buffer 7608 is empty).
Backqua 307 d protrudes in order, reverse & A t
If both M and I boxes are negative, the second buffer 308 (4
1 buffer 507 is empty) and is read out from Q; ,W
If the polarity of A t MI is different, compare the absolute values,
When the polarity of the smaller absolute value is positive, the information address is transferred from the first buffer 307 to the end of j1 and then transferred to the second buffer 307.
If the value is negative, the second buffer 508 is read out first, and then the first buffer 507 is read out.

The control unit 302 controls the first buffer 507 . g2 buffer 3
The remaining number of information addresses found from 08 is monitored, and the same number of information addresses as the number of information addresses input to the input buffer 301 is selected from the first .08. BSY4M- which was output to bus 7 when read from second buffer 507, 30B
Stop 19. At the same time, the last read information address is transferred to the final information address holding register 305 to prepare for the next sorting process.

By moving the read head in the order of the information addresses read out from the search time reduction device in this manner, it is possible to read out the information to be processed - times with the minimum moving distance, that is, with the minimum search time.

〔Effect of the invention〕

According to the present invention, since image information is searched efficiently, the search time can be shortened.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an image information retrieval time reduction method according to an embodiment of the present invention, and FIG. 2 is an overall configuration diagram of an image response system. 301, 307, 508... Buffer 302... Sorting control unit 304... Comparison unit 305... Final information address holding register fee payment operator Katsuo Ogawa

Claims (1)

[Claims] In an image response device that reads image information stored in a magnetic recording memory, the information addresses of a plurality of image information to be searched are sorted in ascending order or descending order,
An image information retrieval time reduction device characterized by outputting an output to move the read head of the memory in the order of the rearranged information addresses.