JPS6091445A - Information retrieving system - Google Patents

Abstract

PURPOSE:To improve the store efficiency of information without deteriorating the high-speed performance during addition of key words, by transferring a key word group to an idle area of other blocks if any, in case the idle areas of a key word block are not sufficient. CONSTITUTION:A retrieving part of a storage area of an information retrieving system using a sequential index editing system is divided into an index part 8 and a key word block area 9. The area 8 includes a key word 10 and a pointer 11; while the area 9 contains a key word 13, an identification number 12 of a key word block and an idle area 14 respectively. When a key word KUROSAKI is added, the KUROSAWA of the end of a number 02 is transferred to the head of a number 03 since the number 02 of the area 9 has no idle space and the number 03 has the maximum idle space. Then the KUROSAKI is added to the number 02. This can decrease the dividing frequencies of the key word block compared in a conventional case.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention is directed to an information retrieval method for searching and registering a large amount of data in an information retrieval device composed of a data processing device and an external storage device. It's about organization.

Configuration of conventional example and its problems Figure 1 is an example of a storage area organization system for an information retrieval system using an index sequential organization system, and (a) in Figure 1 shows the overall configuration. Its internal structure is shown. 2 is a data area for storing data to be inserted; 1 is an index section used to retrieve data; index section 1 is divided into an index area 3 and a keyword block area 4; 6 represents a keyword block in the keyword block area 4, and 6 represents an index of the keyword block 6 in the index area 3. FIG. 2 shows the logical configuration of the information retrieval method, where 61, 62 and 63 correspond to page 3 of keyword block 6 in FIG. 1, and 7 is a keyword existing in keyword block 6. , index 6 indicates which keyword block the keyword belongs to. Third
The figure shows the basic algorithm when adding keywords in the information retrieval method. 4, 5, and 6 show the index part of the information retrieval method, 8 represents the index part, 9 represents the keyword block group, 10.13 represents the keyword, 11 represents the pointer of the keyword block, 12 represents the identification number of the keyword block, and 14 represents the free area. The fifth figure is the keyword [BANDOHJ added to Figure 4.
Figure 6 is a diagram with the keywords jKU and RO8AKIJ added. In general, when a large amount of registration and deletion is performed in the physical organization of a database that searches and registers a large amount of data, the physical organization Figure 1 shows the method.

As shown in Fig. 2, the index section 1 is divided into an index area 3 and a keyword block group 4, and the keyword block 6 has an empty area as a margin for adding the keyword group and keywords. If there is sufficient free space in the keyword block determined by the index section to be registered,
The keyword is registered in that area, and if there is insufficient free space, the block is divided into two keyword blocks to create a new free space, and then the information search method registered with the keyword is created. There is. In FIG. 4 showing the index part of the information retrieval method, the index section 8 has the first keyword of the keyword block group 9, thereby determining which keyword block the keyword to be registered and searched should belong to. .

In Figure 4, an example of a keyword is “BANDOHJ”.
If you want to add the keyword, first of all, jBAND
OHJ is read (Fig. 3a) and the index section shows that it should be added to the keyword block with the keyword li"ABEj at the beginning (Fig. 3b). There is sufficient free space in the keyword block. exists (if C on page 3 is a yes branch), the keyword ``BANDOHJ'' can be added as is (
Figure 3 e). However, in Figure 5 there is an additional keyword [KU
When adding RO3AKIJ, it cannot be added simply because there is not enough free space in the keyword block with the keyword jKATOHJ at the beginning of the keyword block to be added (if C in Figure 3 is a NO branch). Divide the keyword block into two and use “KATOHJ” and “
Create two keyword blocks with KURODAJ at the beginning (Fig. 3 d), and then enter the keyword ``KURO8''.
AKIJ is being added (Figure 3 e)
. The result is shown in FIG. 6, and it can be seen that the accommodation rate of keywords in the keyword block is poor and there are many empty areas.

This method is very simple and allows high-speed processing, except when dividing into blocks when registering keywords.
There were major problems in that the storage efficiency within the keyword block was poor, the number of required keyword blocks was often large, and the storage area was not used very effectively.

OBJECTS OF THE INVENTION The present invention is intended to eliminate such conventional drawbacks, such as reducing the storage efficiency within keyword blocks due to keyword block division and keyword The present invention provides an excellent information retrieval method that suppresses an increase in the required number of blocks and significantly reduces wasted storage space.

Structure of the Invention The configuration information search method of the present invention is conventional in that even when it becomes necessary to divide a keyword block, the amount of free space in other keyword blocks is checked, and if the keyword block has sufficient free space, By transferring a group of keywords to that keyword block and securing free space, we can reduce the chances of keyword splitting, greatly improving the average accommodation rate of the keyword block, and at the same time By reducing the number of keyword blocks, the storage area is greatly reduced.

DESCRIPTION OF EMBODIMENTS The information retrieval method of the present invention will be explained using the drawings. Fourth
The figure shows the basic algorithm of this information retrieval method. In the information retrieval method of the present invention, even when keyword division is required in the conventional information retrieval method (when C in FIG. 7 is a No branch), the amount of free space in other keyword blocks is checked ( Figure 7 f), if there is free space in another keyword block (if Figure 7 q is Yes branch)
transfers keyword groups without destroying the physical file organization system of index sequential organization system (Fig. 7h).

This reduces the frequency of keyword splitting,
This eliminates wasted storage space by creating more free space than necessary without sacrificing the ease of search and registration of the conventional example. Furthermore, if the free space in all the keyword blocks becomes insufficient (in the case of No branch in Fig. 7q), free space is created by block division as in the conventional example (Fig. 7d). professional information search method using conventional information search methods.
- Comparing the case where block partitioning is performed and the case using this information retrieval method, it can be seen that the frequency of block partitioning is reduced and the efficiency of accommodating other keyword blocks is good.

8 to 12 show the index portion of the information retrieval method of the embodiment using the index sequential organization method (in this embodiment, the keywords in the keyword block are arranged in ascending order of JIS code). 8 represents an index portion, 9 represents a keyword block group, 10.13 represents a keyword, 11 represents a keyword block pointer, 12 represents an identification number of the keyword block, and 14 represents a free area. Figure 8 is a diagram with the keyword rKURO8AKIJ added to Figure 5, and Figure 9 is a diagram with the keyword rKIMU added to Figure 8.
This is the state after adding "RAJ, FKISIJ 4KUDOH", and shows a state in which each keyword block contains nearly the maximum number of keywords. FIG. 10 shows the state after adding the keyword 1mK ITAGAWAJ to the state of FIG. 9. In Figure 6, the keyword f
KUR09be1゛If we consider adding 5AKIJ, index section 8
[:KATOH(KURO8AKI(MI
According to TA (Figure 7b)], however, the keyword block number 02 does not have an empty # area to add a keyword (Figure 7C is N
o branch), then check the free space of keyword blocks 01 and 03 (Fig. 7f), and the result is 01.
It can be seen that both keyword blocks numbered 03 have sufficient free space (if q in Figure 7 is a Yes branch),
Therefore, we compared the amount of free space between No. 01 and No. 02, and since the free space of keyword block No. 03 was larger, we determined the number of keywords that could be transferred based on the amount of free space (one in this case), and In order to transfer it later, the keyword after number 02, FKURO8AWAJ, is changed to 03.
Transfer to the beginning of the numbered keyword block (Fig. 7h)
, then add the keyword "KURO8AKIJ" to the No. 02 keyword block (Fig. 7, 8). As a result, the No. 8
Comparing this with FIG. 6, which is the result of the conventional method, it can be seen that the accommodating efficiency of each keyword block has been improved. By adding further keywords, keywords are transferred without dividing keyword blocks until there is insufficient free space in each keyword block, resulting in a state where there is not enough free space in all keyword blocks as shown in Figure 9. . Furthermore, when the keyword FKI TAGAWAJ is added to this state, it is no longer possible to find sufficient free space in any keyword block (if q in Fig. 7 is a No branch), so keyword number 02, which is the corresponding keyword block, is no longer found. Divide the block into keywords “KATORIJ, FKIMUR”
Keyword block number 02 with AJ, ffKISIJ and keywords FKITAURAJ, a'KUDO
A keyword block numbered 03 with HJ and FKURODAJ is generated, and the keyword block that was originally numbered 03 is shifted and becomes the keyword block numbered 04 (
Figure 7d). Keyword FKITA11 page in that condition
- As a result of adding GAWAJ (Fig. 7e), the state shown in Fig. 10 is obtained. Adding more keywords, the 11th
If the situation is as shown in the figure, the keyword Q'KONISI
When adding J, there is not enough free space in keyword blocks 02 and 04 before and after keyword block 03, so we further check keyword blocks 01 and 05 and find that they both have enough free space but have a larger free space. Keyword transfer occurs to keyword block 01 where there is an area, that is, fAOYAMAJ, the first keyword of keyword block 02, is added to the end of keyword block 01, and keyword block 02 becomes empty due to the keyword transfer. The keywords are moved forward by the amount of time, and the keyword r BANDOHJ is placed at the beginning. Furthermore, since there is free space in the 02th keyword block, the first keyword of the 03rd keyword block, fKATOHJ, is transferred to the end of the 02nd keyword block, and the keywords in the 03rd keyword are moved forward by the amount of that keyword. and the transfer process is completed.
After that, the keyword "KONISIJ" will be added to the 03rd keyword list.

As is clear from the difference between FIG. 6 and FIG. 8, the information retrieval method according to the present invention avoids dividing the keyword block as much as possible by checking the free space of other keyword blocks. The accommodation efficiency can be increased. ! As is clear from a comparison between FIG. 6, in which block division was performed by the conventional information retrieval method, and FIG. 10, in which the present information retrieval method is used, the accommodating efficiency of other keyword blocks is significantly different. In view of the above points, the present information retrieval method has a higher keyword accommodation rate per unit storage area than the conventional example, and is extremely effective when a large amount of information retrieval is required.

In the embodiment described above, keywords are transferred if there is room for one keyword in every keyword block, but if the size of the keyword block is sufficiently large for one keyword, the keyword is transferred. The accommodation rate of the key word 13 in a block may be cut by a certain value (for example, 8o%, etc.), and the keyword transfer may be performed only when the keyword block has an accommodation rate less than or equal to that value.

This prevents deterioration of registration processing time due to frequent keyword transfers, and improves storage area accommodating efficiency while retaining the advantage of high processing speed when keyword blocks are not divided during registration processing. This allows you to take full advantage of the features of this information retrieval method.

Effects of the Invention As described above, the present invention has a keyword section that is generally used when keywords are frequently added or deleted in an information retrieval method having an index section and a keyword block group in the search section. By creating free space in the area and adding keywords to it, we take advantage of the advantage of a method that allows you to search and register at high speed, while reducing the chance of splitting keyword blocks to avoid waste of storage space, which was a major drawback. By increasing the efficiency of accommodating keywords in a keyword block, 14/ζ-di is eliminated. Therefore, it is possible to realize a high-speed search/registration even when storage space is considerably limited, and to realize an information retrieval method that allows a large amount of information to be retrieved without requiring much storage space.

[Brief explanation of drawings]

Fig. 1 is an explanatory diagram of the storage area organization method of an information retrieval method using the index sequential organization method, Fig. 2 is a logical configuration diagram of the information retrieval method, and Fig. 3 is a keyword addition of the conventional information retrieval method. 4, 5, and 6 are diagrams of the index section of the conventional information retrieval method, and FIG. 7 is the diagram of the index section of the information retrieval method according to an embodiment of the present invention when keywords are added. The basic algorithm diagrams and FIGS. 8 to 12 are explanatory diagrams of the index section of the same information retrieval method. 8... Index section, 9... Keyword block group, 10, 13... Keyword, 11
...Keyword block pointer, 12...
...Keyword block identification number, 14...
Free space in the keyword block. Name of agent: Patent attorney Toshio Nakao and 1 other person No. 1
Figure 111-1-1-17'

Claims (1)

[Scope of Claims] An external storage device that stores data to be searched and keywords to be searched, and a device to search for specific data of the data to be searched in the external storage device. The index file has a keyword index file, and the index file includes a keyword block group having a free space capable of storing a plurality of keywords, and an index section having at least one hierarchy for indexing a range of the plurality of keyword blocks. When there is a shortage of free space in a particular keyword block, which may occur when adding a keyword, the amount of free space in at least one of the keyword blocks is checked, and if there is sufficient free space, the keyword is added. An information retrieval method characterized by having −゛ in index file registration function 2, which transfers a keyword group to a block and divides the keyword block without generating a new keyword block if there is insufficient free space. .