JPH09330322A - Data retrieval device - Google Patents

Abstract

(57) [Summary] [Object] When data is searched by designating two or more types, the search time increases according to the number of data types. SOLUTION: A conversion table in which a conversion code composed of a binary code different from each other for each type name of search target data and a type name of data are described in association with each other is provided, and a plurality of data type names are designated as search targets. In this case, the conversion table is referred to and the logical sum of the binary codes is calculated and used as the file conversion value. Next, the type names of the sequentially called data are converted into conversion codes using the conversion table, and the logical product of the converted conversion code and the file conversion value is obtained, and if it is not 0, it is the search target data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data search device used for searching data by designating two or more data types from a plurality of types of data groups stored in a file.

[0002]

2. Description of the Related Art Conventionally, when trying to retrieve data by specifying two or more data types from a plurality of types of data groups stored in a file, after calling individual data in the file in order. The determination as to whether or not the data is search target data is made for each designated type. FIG. 3 is a flowchart showing an example of the processing,
A case is shown in which data of type numbers “3”, “9”, and “12” are searched from the data file having the configuration shown in Table 1.

[0003]

[Table 1]

Conventionally, as shown in the flow chart of FIG. 3, the classification numbers of all the data in a file to be searched are sequentially called from the beginning, and the classification number of the data is the classification number "3" of the search target. , "9", "1"
2 ”is determined (step 2
01, 202, 203), and if they match, the data body for the type number is taken out.

[0005]

However, in these processing methods, when there are a plurality of type numbers to be searched,
There has been a problem that the number of times of the discrimination process increases in accordance with the number of the types, and the time required for the search becomes long. for that reason,
It has been desired to propose an efficient data search method that enables speeding up of search processing.

[0006]

In order to solve the above problems, the invention of claim 1 searches for data from a data group consisting of data in which a data type name for specifying the contents is added to the data body. At this time, a conversion table in which a conversion code composed of a predetermined binary code and a data type name are associated with each other and only one bit of a digit different from each other for each type name of data constituting the search target data group is described. Be prepared. Further, when a type name of a plurality of data is designated as a search target, the conversion table is referred to obtain a logical sum of binary codes corresponding to the respective type names, which is used as a file conversion value. Next, the data is called in order from the search target data group stored in the file, and the conversion table is referenced to convert the type name of the data into a conversion code. Next, when the logical product of the converted conversion code and the file conversion value is obtained and the obtained value is not 0, the data corresponding to the conversion code is taken out as search target data. Thereby, it becomes possible to retrieve a plurality of types of data at the same time.

According to a second aspect of the invention, in the first aspect of the invention, file conversion values for a plurality of data type names that are related to each other are obtained in advance and written in a table,
When the search starts, the file conversion value is read directly from the table and the search is started. This saves the processing time required to create the file conversion value and speeds up the search. It is also possible to describe the file conversion value on the conversion table here.

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a flowchart showing an embodiment according to the invention of claim 1. This flowchart shows a case where the data with the classification numbers of “3”, “9”, and “12” is searched from the 100 data group stored in the data file shown in Table 1 in the description of the conventional example. . The data in the file to be searched is shown in Table 1.
As shown in, the type number is added to each data body. The type number indicates, for example, the type of data such as the generation of a warning for a certain event and the restoration.

Prior to the search, a conversion table for converting this type number into a conversion code is prepared. FIG. 2 shows the conversion table. Table numbers “1” to “16” on the table are defined as type numbers, and the remaining “17” to “32” have a specific meaning other than the type number. Defined as the conversion code you have. Type number "1" to "1"
The conversion code for converting "6" is composed of 32 bits, and a value in which each bit is "ON" in order from the lower bit to the upper bit of 32 bits is represented by a hexadecimal number, which is represented by a type number "1". It is defined as a conversion code from "" to "16". That is, as is apparent from the bit arrangement of the binary code in Table 2, only one bit of different digits for each type number is set to 1 and the others are set to 0.

[0010]

[Table 2]

The type numbers "3", "9", and "12" that are the objects to be searched in this embodiment are conversion codes "0x20000000" and "0x0080000", respectively.
It is converted into "0" and "0x00100000". next,
When these type numbers are designated as search targets, the logical sum of these conversion codes is obtained. The obtained logical sum is
As shown in Table 2, it becomes “0x20900000”. This logical sum is stored as a file conversion value in the table number “17” of the conversion table of FIG. 2, and thereafter managed as a search target.

Next, the search is started, the type number of the data is fetched in order from the beginning of the data file to be searched, and the type number of the data is converted into a conversion code using the conversion table (step 101). Next, a logical product of the obtained conversion code and the file conversion value of the table number "17" is calculated, and it is determined whether or not the result is 0 (step 102). If the logical product is not 0 here, that is, if it is the data to be searched, this data is taken out (step 103). Next, the search target is moved to the next data in the file (step 104), and it is checked whether or not the search target data exists in the file (step 105). If the search target data exists, the process returns to step 101 and the process is repeated until there is no data.

Next, the processing of the above-described embodiment will be described in more detail. First, the file conversion value will be described.
A conversion code is uniquely assigned to the type number (1 to 16). That is, the conversion code is a hexadecimal value when the bits are set to “ON” one by one in order from the lower bit to the upper bit of 32 bits, and the conversion table numbers “1” to “16”. Are used to define the conversion code corresponding to the type number, and the rest are used to define the conversion code in a specific case. If multiple data exists using this conversion table,
Unique value from multiple data (file conversion value) by obtaining the logical sum of conversion codes corresponding to the classification number of each data
Create

Next, the search using the file conversion value will be described. Conventionally, as shown in FIG. 3, for each piece of data in a file to be searched, the type number of the data is the type number “3”, “9” of the search target,
Comparison work (step 2)
01, 202, 203). Therefore, when there are a large number of search targets, the number of comparisons also increases. Therefore, the type number “3” to be searched,
As described above, a unique file conversion value (0x20900000) is created from "9" and "12".

Next, as shown in FIG. 1, with this value as a search target, the 100 types of data in the file shown in Table 1 are sequentially referenced with reference to the conversion table, and the type of each data is classified. Convert number to code (step 10)
1). Further, the logical product of the conversion code and the file conversion value is obtained. If the file conversion value is created by the logical sum including the type number to be searched, the obtained logical product is not 0 (step 102). As a result, if the logical product is other than 0, the data is extracted as a search target (step 103). As a result, in this embodiment, when there are a plurality of types of data to be searched, the plurality of types are converted into unique values, and comparison with the data in the file is performed on the converted unique values. Only by doing so, the effect of shortening the data search time can be obtained.

Next, an embodiment according to the invention of claim 2 will be described. In this embodiment, in the embodiment according to the invention of claim 1 described above, the processing of calculating the logical sum, which is carried out each time the search is started, is omitted, and the search time is shortened accordingly. Consider a case where the data of the type numbers “3”, “9”, and “12” are extracted in the flowchart of FIG. It is assumed that the data corresponding to these three type numbers have a certain meaning, for example, the occurrence of an abnormality for a certain event.

In addition, when the data to be extracted is a combination of these three type numbers, as shown in FIG. 2, the logical sum (0x
20900000) to obtain a file conversion value and define it in table number 17 in the conversion table. In the actual search, when it is designated to search the data of the type numbers “3”, “9”, and “12”, the file conversion value is directly read from the conversion table and the search processing of step 101 is immediately performed. Proceed to. As a result, the processing time required to create the file conversion value is saved and the search time is shortened.

In this embodiment, since the file conversion value obtained in advance is described in the conversion table, the file conversion value can be read in the same manner as the process of reading the conversion code from the conversion table. The storage location of the value is not limited to the conversion table and may be another location.

[0019]

As described above, according to the first aspect of the present invention, the conversion of a predetermined binary code in which only one bit of a digit different from each other for each kind of data constituting the search target data group is set to 1 A conversion table that describes the code and the type name of the data is provided, and the data is sequentially fetched from the search target data group stored in the file and the conversion table is referenced to convert the type name of the data. Then, the logical product of the converted conversion code and the file conversion value is obtained, and when the obtained value is not 0, the data corresponding to the conversion code is taken out as the search target data. Even when searching for a plurality of types of data, the processing time is the same as when searching for one type of data, and the search speed is improved.

According to the invention of claim 2, in the invention of claim 1, file conversion values for a plurality of data type names that are related to each other are obtained in advance and listed in a table, and when the search is started, By directly reading the file conversion value from the table and starting the search, the processing time for obtaining the file conversion value is saved, and the search becomes faster.

[Brief description of drawings]

FIG. 1 is a flowchart showing an embodiment according to the present invention.

FIG. 2 is a diagram showing a conversion table used in the embodiment according to the present invention.

FIG. 3 is a flowchart showing a conventional example.

Claims (3)

[Claims] 1. A data retrieval device for retrieving a data group consisting of data to which a data type name for specifying the contents of a data body is searched, the data type being different for each type name of data constituting the search target data group. A conversion table in which a conversion code consisting of a predetermined binary code and a data type name are described in correspondence with only one bit of a digit as 1, and a conversion table when a plurality of data type names are specified as search targets Refer to to find the logical sum of the binary code corresponding to each type name and use it as the file conversion value, and call the data in order from the search target data group stored in the file and also refer to the conversion table. The means for converting the type name of the data to the conversion code and the logical product of the converted conversion code and the file conversion value can be obtained. Value data search apparatus characterized by comprising a means for retrieving the appropriate data as a search target data into the converted code if is not zero. 2. The data search device according to claim 1, wherein a file conversion value obtained from the type names of a plurality of mutually related data is written in a table in advance. 3. The data search device according to claim 2, wherein the file conversion value obtained in advance is described on a conversion table.