JPH06176071A - Information retrieving system - Google Patents

Abstract

PURPOSE:To prevent the double retrieval of the data having the equivalent significance when the information is retrieved by the right truncation logic with which the information starting with a designated retrieving key word is retrieved. CONSTITUTION:A code coincident length calculator means 3 sets the priority to the collation code trains of the data to be retrieved. The code coincident length L1 of a collation code train M1 of the highest priority is set at 0. Then the maximum value is defined as the code coincident length Li of a collation code train Mi among the number of codes coincident with each other when the collation code trains Mi (I>=2) are compared in sequence with each other and in the order of higher priority from the train M1 through the train Mi-1 and the head train. The value Li is stored in a collation code train/code coincident length storage means 2. A retrieving subject data extracting means 4 compares a key code train K0 consisting of L0 pieces of codes with the train Mi (i=1,2...) to obtain a collation code train which includes L0 pieces of codes coincident with each other from the head and has the code coincident length smaller than L0. Then the retrieving subject data corresponding to the obtained collation code train is taken out of a retrieving subject data storage means 1.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information retrieval system for conducting retrieval by a keyword prefix matching logic (a logic for comparing the length of a keyword designated as a condition and conducting retrieval from the beginning).

[0002]

2. Description of the Related Art In a search of a dictionary or the like, a method is adopted in which a plurality of keywords such as aliases are added to one search target data so that search can be performed even under ambiguous conditions.

[0003]

However, when the search target data is searched by the prefix matching logic with the character string used as the search condition, there are the following problems.

As shown in FIG. 6, search target data 451.
Search keyword (verification code string) 251 for "Tengu"
"Amamiya" is set, and the search keywords 252 "Amamiya" and 25 for the search target data 452 "Amemiya"
3 Assume that "Amemiya" is set. Search keywords 251 and 252 when searching for names beginning with "A"
And 253 are applicable. Search keywords 252 and 2
Since 53 is a keyword added to the search target data 452 “Amemiya”, it is necessary to perform a process of setting only the search target data 452 “Amemiya” as the search result.

On the other hand, conventionally, as shown in FIG.
In order to guarantee that the search keywords 252 and 253 point to the same search target data 452, the search target data 45
A method is used in which unique codes 521 and 522 are assigned to 1,452, search results are sorted by the codes, and duplication of the same search target data is deleted by merge processing. Therefore, every time a search is performed, sort processing, merge processing, etc. are required for the entire search result, which is a heavy load in the online processing in which the search is frequently performed.

An object of the present invention is to avoid duplicate search of data having an equivalent meaning and to search only necessary data when searching information by prefix matching logic for searching information starting with a specified search keyword. It is to provide an information retrieval method that retrieves the data by a simple process and at a high speed.

[0007]

In order to achieve the above-mentioned object, the information retrieval system of the present invention comprises a retrieval target data storage means for storing retrieval target data, a collation code string assigned to the retrieval target data, and A matching code string / code matching length storage unit that stores the matching code length of the matching code string, and a matching code string for each search target data are prioritized, and the matching code string of the matching code string M ₁ having the highest priority is matched. The length L _{1 is set} to 0, the collation code sequences Mi (i ≧ 2) are sequentially compared with the collation code sequences M ₁ to M _i−1 from the _first code in order of the highest priority i, and the number of consecutively coincident codes is determined. The maximum value of these is set as the code matching length Li of the collation code string Mi, and these code lengths Li (i
, 1, 2, ...) to the matching code string / code matching length storage means, and the specified key code string K ₀ consisting of L ₀ codes The matching code string Mi (i = 1, 1 stored in the code matching length storage means
2, compared with · · ·), L ₀ number of symbols matches the beginning, and the code matching length is found smaller matching code sequence than L _0, the search target data storage means searched data corresponding thereto And a retrieval target data retrieval means for retrieval.

[0008]

According to the present invention, first, a simple priority order is given to a plurality of search target data (and therefore the collation code string) based on their identity, inclusion relation, and hierarchical relation. Next, the collation code string is compared with the collation code string having a higher priority order than the collation code string from the beginning, and the maximum value of the number of consecutively matched codes is determined as the code of the collation code string. Match length. However, the collation code sequence having the highest priority does not have a collation code sequence to be compared with, so the code coincidence length is set to 0. Finally, when the designated key code string is given, the search target data for the collation code string in which the L ₀ codes match from the beginning and the code matching length is smaller than the number of codes in the key code string are extracted. . Therefore, when there are a plurality of code strings including the same code for the designated key code string, the search target data for the matching code string having the highest priority is extracted.

[0009]

Embodiments of the present invention will now be described with reference to the drawings.

FIG. 1 is a block diagram of an information retrieval system according to an embodiment of the present invention.

In the information retrieval system of this embodiment, the retrieval target data storage means 1 in which the retrieval target data is stored, the collation code string given to the retrieval target data, and the code matching length of the collation code string are stored. The matching code string / code matching length storage means 2 and the matching code string M for the search target data are prioritized, and the matching code length L ₁ of the matching code string M ₁ having the highest priority is set to 0, and the priority i is set. Collation code string M in descending order
i (i ≧ 2) is sequentially compared with the collating code strings M ₁ to M _i−1 from the leading code, and the maximum value of the number of consecutively matching codes is set as the code matching length Li of the collating code string Mi. , Code matching length calculation means 3 for storing these code matching lengths Li (i = 1, 2, ...) In the matching code string / code matching length storage means 2.
And a specified key code string K ₀ consisting of L ₀ codes
Is compared with the collation code string Mi (i = 1, 2, ...) Stored in the collation code string / code matching length storage means 2, and L ₀ codes match from the beginning, and the code matching length is Is smaller than L ₀ , and a search target data extracting unit 4 that extracts the search target data corresponding thereto from the search target data storage unit 1 is found.

FIG. 2 is a flow chart showing the processing of the code matching length calculation means 3. First, one retrieval target data is retrieved from the retrieval target data storage means 1 (step 11). When the processing is completed for all the search target data, the processing is completed (step 12). Priority i = 1, 2, ..., M (1 is the highest and m is the lowest) is assigned to the m collation code strings for the search target data (step 13).
A code matching length L ₁ of the matching code sequence M ₁ and 0, and i = 1 (step 14). i is incremented by 1 (step 15).
i is compared with m (step 16), and if i is larger than m, the next search target data is retrieved from the search target data storage means 1 and the above processing is repeated (steps 11 to 1).
6). If i is less than or equal to m, the collation code sequence M _i is sequentially compared with the collation code sequence Mj (1 ≦ j ≦ i−1) from the beginning, and the maximum value of the number of consecutively matching codes is determined as the collation code. Row Mi
The code matching length Li is stored in the matching code string / code matching length storage means 2 (step 17) and the process returns to step 15.

FIG. 3 is a diagram showing a first specific example of information retrieval according to this embodiment. In this specific example, the search target data 45
2 As a reading for “Amemiya”, there are collation code strings 252 “Amamiya” and 253 “Amemiya”, and the priority is “Amemiya” → “Amamiya”.

The code matching length calculation process in this example will be described with reference to FIG. The retrieval target data 452 "Amemiya" is retrieved (step 11), and the priority order is M ₁
= Amemiya, M ₂ = Amamiya, m = 2 (step 13). L ₁ = 0 and i = 1 are set (step 14), and i = 2 is stepped (step 15). When the collation code string M ₂ is compared with the collation code string M ₁ , the first character “A” matches the two and the second character “Me” and “Ma” do not match, so the collation code string M ₂ Code matching length L
₂ = 1 is obtained (step 17). Next, since i = 3 (step 13) and i> m = 2, step 11
Return to (step 16). After that, other search target data 4
The above processing is repeated for 51 "Amangu" and 453 "Iida", and the code matching lengths 351 to 354 for the collation code strings 251 to 254 are obtained as shown in FIG.

Here, when the key code string "A" is specified as the search condition 151, the leading "A" of the collation code strings 251 to 253 match, but from L ₀ = 1 to the code matching length Li.
The code matching length satisfying the condition of <L ₀ becomes the matching code strings 351 and 353, and the target search target data “Tengu” and “Amemiya” can be obtained.

FIG. 4 is a diagram showing a second specific example of information retrieval according to this embodiment. This specific example is an example of application to a system for searching occupational classifications by kana reading. When trying to obtain the corresponding occupation classification from a conceivable headword, the headword has the following inclusive relation.

When “health food”, “natural food” and the like are collectively treated as “health / natural food”, “health food” and “natural food” have an inclusive relationship with “health / natural food”. At this time, it is an example applied when the search key of "health" is used and only "healthy / natural food" is to be the search result.

In this example, the search target data 461 “health / natural food” is the search target data 462 “health food”,
Since the search target data 463 “natural food” is included, the priority order of the collation code strings 261 to 263 is 261 “kenkoushokushinhin” → 262 “kenkoushokuhin” →
263 is set, and the code matching lengths 361 to 363 are calculated from FIG.

First, in step 13, M₁ = "Health
"", M₂ = "Healthcare,"
M₃ = "Shizenshokuhin", m = 3. First round
In step 17, M₁ And M₂ To L₂ = 4 is obtained,
In step 17 of the second round, M ₁ And M₃ Match length and M₂ When
M₃ From the maximum match length of L₃ = 0 is obtained.

When "health" is specified as the key code string 161 of the search condition, the collation code strings 261 and 262 are searched for by the prefix match, but the key code string 16
Since the length L _{0 of} 1 is L ₀ = 4, the search target data 46 corresponding to the “kenkoushishokuhin” 261 including the “kenkoushokuhin” 262 whose code matching length is Li = 4.
1. Only "health and natural foods" are searched.

FIG. 5 is a diagram showing a third specific example of information retrieval according to this embodiment. In this example, the code string is not only a character string but also one code in units such as "prefecture", "city / district", "town / village" (for example, prefecture code, city code, etc.)
It is an example applied to a system for searching a company etc. using an address as a key.

In this example, the search target data is 471 "A
Headquarters ", 472" Headquarters ", 473" AA Department ", 474
"BB department", 475 "B branch", 476 "BB department", 4
77 "CC section", 478 "DD section", and each search target data 471, 472, 473, 474, 475, 47
271, “Uchisaiwaicho, Chiyoda-ku, Tokyo”, 272 “Uchisaiwaicho, Chiyoda-ku, Tokyo”, 273
"Uchisaiwaicho, Chiyoda-ku, Tokyo", 274 "Otemachi, Chiyoda-ku, Tokyo", 275 "Ginza, Chuo-ku, Tokyo", 276 "Ginza, Chuo-ku, Tokyo", 277 "Nihonbashi, Chuo-ku, Tokyo", 278
Search target data 471 with "Ueno Park, Taito-ku, Tokyo"
Priority of 478 to 471 → 472 → 475 → 47
In this example, 3 → 474 → 476 → 477 → 478.
Code matching lengths 371 to 37 of the matching code strings 271 to 278
8 is calculated according to the flow chart of FIG. 2 as in the above embodiment.

Key code strings 171 "Ueno Park, Taito-ku, Tokyo" (L ₀ = 3), 172 "Chuo-ku, Tokyo" (L ₀ =)
2), 173 “Otemachi, Chiyoda-ku, Tokyo” (L ₀ = 3),
174 "Chiyoda-ku, Tokyo" (L ₀ = 2), 175 "Tokyo" (L ₀ = 1) for search target data 478,47
5,474,471,471 are searched respectively.

[0024]

As described above, according to the present invention, a plurality of search target data are replaced with simple priorities according to their identity, inclusion relation, hierarchical relation, etc., and their collation code strings are arranged in descending order of priority. Is compared with a collation code string having a higher priority than itself, the code matching length that is the maximum value of the number of consecutively matched codes from the leading code is calculated, and the code matching length is composed of L ₀ codes. L ₀ from the beginning of the key code string
By selecting the search target data corresponding to the collation code string whose codes match and the code matching length is smaller than L _0, it is possible to avoid searching for data having the same meaning in duplicate. Data can be retrieved at high speed with simple processing, and a general database management system (D
(BMS) can be easily realized by using a predicate for comparing the size of the query language, which has the effect of simplifying the search program and improving the search performance.

[Brief description of drawings]

FIG. 1 is a configuration diagram of an information search system according to an embodiment of the present invention.

FIG. 2 is a flowchart of the processing of a code matching length calculation means 3.

FIG. 3 is a diagram showing a first specific example of information retrieval according to the embodiment of FIG.

FIG. 4 is a diagram showing a second specific example of information search according to the embodiment of FIG.

FIG. 5 is a diagram showing a third specific example of information search according to the embodiment of FIG. 1;

FIG. 6 is a diagram showing an example of search target data and search keywords.

7 is a diagram showing a conventional method for the search target data of FIG.

[Explanation of symbols]

1 Search Target Data Storage Means 2 Collation Code Sequence / Code Match Length Storage Means 3 Code Match Length Calculation Means 4 Search Target Data Extraction Means 11-17 Steps 151, 161, 171-175 Key Code Sequences 251-254, 261-263 271-278
Collation code string 351 to 354, 361 to 363, 371 to 378
Sign matching length 451-453, 461-463, 471-478
Search target data

Claims (1)

[Claims] 1. A search target data storage unit for storing search target data, a collation code string assigned to each search target data, and a collation code string / code match length for storing the code matching length of the collation code string. The storage means and the collation code string for each search target data are prioritized, and the code matching length L of the collation code string M ₁ having the highest priority is set.
_{1 is set} to 0, and the collation code string Mi (i
≧ 2) is sequentially compared with the collating code strings M ₁ to M _i−1 from the leading code, and the maximum value of the number of consecutively matching codes is set as the code matching length Li of the collating code string Mi. Long L
Code matching length calculation means for storing i (i = 1, 2, ...) In the matching code string / code matching length storage means, and a designated key code string K ₀ consisting of L ₀ codes Compared with the collation code string Mi (i = 1, 2, ...) Stored in the collation code string / code matching length storage means, L ₀ codes from the beginning match, and the code matching length is An information retrieval system having a retrieval target data retrieval means for retrieving a collation code string smaller than L _{0 and} retrieving corresponding retrieval target data from the retrieval target data storage means.