JPH0736921A - Disk data retrieval system - Google Patents

Abstract

PURPOSE:To improve the retrieval response time at the time of the retrieval of data stored on a disk and to grasp the number of all data meeting retrieval conditions. CONSTITUTION:A record to be registered is registered in a relative composition file (b), a relative key for the record is regarded as a bit record, and the key of the record and the bit record are combined and registered in index composition file (c) and (d). At the time of data retrieval, the index composition files (c) and (d) are read in through the index part of the index composition files and the relative composition file (b) is accessed at random from the relative position of a bit field. For retrieval under composite conditions, AND operation is performed as to bit fields meeting the respective retrieval conditions when the conditions indicate AND and OR operation is performed when the conditions indicate OR to grasp the number of data which are retrieved and hit from the positions and number of bits which become '1' in bit fields.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a disk data search method, and more particularly to a disk data search method that can obtain a short-time search response of data stored on a disk and a notification of the total number of hits of search conditions.

[0002]

2. Description of the Related Art Conventionally, there are many methods of storing data on a disk and methods of retrieving the data, and they are applied by making the best use of each method. However, at the application level, there is no method that combines a short search response time and the total number of data items that match the search conditions.

[0003]

As described above, in the conventional disk data search method, it is not possible to grasp the total number of hits for the search condition at the same time when the search is performed, so the total number of data hits for the search condition cannot be calculated. A new application is required to understand. In addition, this new application is required for each system that keeps track of the total number of data items that match the search conditions, which requires a great deal of development man-hours. However, there is a drawback that the search response time becomes long.

[0004]

According to the disk data search method of the present invention, in the disk data search method of an information processing system using a disk system, a record to be registered is registered in a relative organization file and the relative organization file is stored in the relative organization file. As a bit record that indicates the relative key to the registered record by the relative position of the bit field,
A record registration means for creating at least one set of index organization files by combining each key and bit record of the registered records, and a bit field matching each search condition from each of the index organization files at the time of searching by the compound condition. When the composite condition is AND, the bit field read from the read means is ANDed, and when the composite condition is OR, the read means is read from the read means. The relative organization file is searched from the arithmetic means for taking the logical sum of the generated bit fields and the position of bit "1" of the bit field of the result calculated by this arithmetic means, and the number of bits "1" is used as the search condition. It is constituted by having a search means for setting the number of hit records.

[0005]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings.

FIG. 1 is a diagram for explaining a disk data storage system required for an embodiment of the present invention. In this disc data storage method, at least two types of files are prepared on the disc. One is a relative organization file, which stores registered record images. The other one or a plurality is an index organization file, and the value of one item of the record is used as a key, and the data field stores a bit field corresponding to the relative key of the relative organization file. FIG. 1A is a diagram showing an example of a record, and shows a case where the first and second items of the three data items are the keys. Figure 1
FIG. 1B is a diagram showing an example of a relative organization file, and FIG.
The case where a record of the same format is stored is shown. Figure 1
(C) and (d) are diagrams showing an example of the data part of the index organization file. In FIG. 1 (c), X of the record of FIG. 1 (b) is shown.
The value of the field is used as a key, and in the bit field, the relative position of the relative organization file is represented by the relative position of the bit field. In FIG. 1D, the value of the Y field of the record of FIG.
It is constructed in the same way as the X field. When a record is registered / updated / deleted, each file is automatically maintained.

FIG. 2 is a diagram for explaining one embodiment of the present invention. FIG. 2A is a search for a relative organization file when the search condition is the compound condition 1 (X = 1 and Y = A) with respect to the file of FIG. 1, and the total number of records hitting the search condition is grasped. And processing is shown. In FIG. 2 (a),
First, the index organization file of the X field is read from X = 1 of the compound condition 1, and the hit record is set as the record 1. Next, the index organization file of the Y field is read from Y = A of the compound condition 1, and the hit record is the record 2
And In order to obtain the search result, the logical product of the bit field portions of the record 1 and the record 2 is calculated, and this logical product record is set as the record 3. Data can be retrieved from the relative key position of the relative organization file corresponding to the bit position of the value 1 of the bit field of record 3, and at the same time, the composite condition 1 is hit by counting the number of bits of the value 1 of the bit field of record 3 You can grasp the total number of cases.

FIG. 2B shows a search for a relative organization file in the case where the search condition is a compound condition 2 (X = 2 or Y = service) for the file of FIG. 1 and all records hit by the search condition. It shows the process of grasping the number of cases. In FIG. 2B, first, the index organization file of the X field and the Y field is read as in the case of the compound condition 1, and the hit records are set as the record 4 and the record 5, respectively. In order to show the search result, the logical sum of the record 4 and the record 5 is obtained and it is set as the record 6. Similar to record 3, data can be retrieved from the relative key position of the relative organization file corresponding to the bit position of the value 1 of the bit field of record 6,
At the same time, by counting the number of bits of the value 1 of the bit field of the record 6, the total number of hits in the composite condition can be grasped.

[0009]

As described above, according to the present invention, the record is automatically registered in the relative organization file and the index organization file by the system, and the index record of the index organization file is randomly accessed at the time of retrieval. The relative organization file can be read at random from the relative position of the bit field of the read index record, and the logical product of the bit field of the index record that meets each search condition can be read even with the search by compound conditions. Alternatively, there is an effect that the number of records hitting the search and the search condition can be easily grasped from the bit position and the number of bits of the resultant bit field which become “1”, by taking the logical sum.

[Brief description of drawings]

FIG. 1 is a diagram for explaining a disk data storage method used in an embodiment of the present invention.

FIG. 2 is a diagram for explaining an example of the present invention.

[Explanation of symbols]

 1, 2, 6 records

Claims (1)

[Claims] 1. A disk data search method for an information processing system using a disk system, wherein a record to be registered is registered in a relative organization file, and a relative key to the record registered in this relative organization file is set in a relative position of a bit field. As the bit record to be shown, a record registration means for creating at least one set of index organization files by combining each key and bit record of the registered record, and a bit field matching each search condition at the time of searching by the composite condition When the composite condition is AND, the bit field read from the read means for logically reading from the index organization file through random access is ANDed, and when the composite condition is OR, Read from the reading means The relative organization file is searched from the calculating means for taking the logical sum of the bit fields and the position of the bit "1" of the bit field as a result of the calculation by this calculating means, and the number of the bit "1" is hit as the search condition. And a search means for setting the number of records to be recorded.