JP2012190379A - Search device, program and method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To perform search for a similar letter string at high speed.SOLUTION: The device includes: first search data on search target letter strings; a data storage part to store second search data on reversed letter strings each of which is each search target letter string with a letter order of its Nth and subsequent letters reversed as to each integer number N, N being equal to and larger than 1 and equal to and smaller than a first predetermined letter number; a first search part to perform forward match search for a search letter string in the first search data, and to detect a search target letter string having a second predetermined letter number or more of forward-matching letters; a second search part to perform forward match search for a search key which is a search letter string with a letter order of its Mth and subsequent letters reversed, M being an integer number, in the second search data corresponding to the integer M, to detect a reversed letter string having the second predetermined letter number or more of forward-matching letters, and to determine whether a reversed letter string having M-2 matching letters, M being an integer number, exists or not; a control part to output a search instruction to the second search part as to a number from the second predetermined letter number to the integer M, except immediately after the second search part has determined that a reversed letter string having M-2 matching letters, M being an integer number, does not exist.

Description

  The present technology relates to a character string search technology.

  Name identification is a process of collecting records representing the same entity among records represented by a plurality of attributes such as names, addresses, and telephone numbers. For each attribute, for example, the similarity of character strings is evaluated to determine whether or not they are the same entity. The attribute values of the records representing the same entity should be the same value originally, but may be similar values for various reasons. For example, when “Watanabe Shoten” should be entered and “Watanabe Shoten” is entered as a variant, or “AA Laboratories” should be omitted, such as “AA Lab.” ”Where there is an input error such as“ Atsu Institute ”.

  In name identification, records are extracted even if they are not the same value but similar values, and are evaluated together with other elements to identify a record group that is presumed to be the same entity.

  When searching a database storing URLs of harmful Web sites using an input URL (Uniform Resource Locator), there is a technique for performing a character string search using the characteristics of the URL. Specifically, the URL host + domain part is detailed from right to left, the host part of the URL host + domain part can be easily changed, and subdomains can also be defined for the domain part. There is a characteristic that it is. Therefore, for the host + domain part, in order to give priority to matching from the right, for example, the host + domain part is www. abc. def. co. jp, pj. oc. fed. cba. It is registered in the database with the order of characters reversed by the host + domain name delimiter such as www, and when searching, the host + domain part of the input URL is reversed by the dot order and the character order is reversed. A forward match search is performed for the column. However, this technique cannot be applied to name identification as it is simply by changing the order of characters at the host + domain name separator based on the characteristics of the URL. That is, generally, different positions between character strings are indeterminate, and there is no delimited position such as a slash.

  When comparing a general search character string and a general search target character string, there are various character positions where a difference occurs between them. In order to extract a search target character string that is similar to the search character string not only from the front but also from the back from a large number of search target character strings, it takes a considerable amount of processing time considering variations of different character positions. .

JP 2006-221294 A

  Accordingly, an object of the present technology is, in one aspect, to provide a technology for searching for a similar character string at high speed.

  The search apparatus determines (A) the order of the characters after the N characters in each search target character string for each of the first search data of the search target character string and an integer N between 1 and the first predetermined number of characters. A first data storage unit for storing second search data for the reversed inverted character string; and (B) a search character for the first search data stored in the first data storage unit. A first search unit that performs a forward match search of the columns, detects a search target character string that matches the second predetermined number of characters or more, and stores an identifier of the detected search target character string in the second data storage unit And (C) a forward matching search of the search key with the order of the characters after the integer M characters in the search character string being changed is performed on the second search data for the integer M stored in the data storage unit. Forward one more than the second predetermined number of characters. Whether or not there is an inverted character string that matches the integer M-2 characters, and stores the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit. And (D) the second search unit from the second predetermined number of characters to 1, and a search instruction for the integer M out of the second predetermined number of characters to 1, And a control unit for outputting except immediately after it is determined by the search unit of 2 that there is no inverted character string that matches the integer M-2 characters.

  It becomes possible to search for a similar character string at high speed.

FIG. 1 is a diagram for explaining comparison between character strings. FIG. 2 is a diagram showing a specific example of processing in the present embodiment. FIG. 3A is a diagram for explaining the outline of the present embodiment. FIG. 3B is a diagram for explaining the outline of the present embodiment. FIG. 3C is a diagram for explaining the outline of the present embodiment. FIG. 3D is a diagram for describing an outline of the present embodiment. FIG. 4 is a functional block diagram of the search device according to the present embodiment. FIG. 5 is a functional block diagram of the search data generation unit. FIG. 6 is a functional block diagram of the search processing unit. FIG. 7 is a diagram illustrating a processing flow of search data generation processing. FIG. 8 is a diagram illustrating an example of a search target character string. FIG. 9 is a diagram illustrating an example of a search target character string after sorting. FIG. 10A is a diagram illustrating an example of the first group. FIG. 10B is a diagram illustrating an example of the second group. FIG. 11 is a diagram illustrating an example of search data generation processing. FIG. 12 is a diagram illustrating an example of processing for a group. FIG. 13 is a diagram illustrating an example of search data for the end character “e”. FIG. 14 is a diagram illustrating an example of search data for the end character “g”. FIG. 15 is a diagram illustrating a processing flow of search processing. FIG. 16 is a diagram illustrating a specific example for explaining the search processing. FIG. 17 is a diagram illustrating a processing flow of search processing. FIG. 18 is a diagram illustrating a specific example for explaining the search processing. FIG. 19 is a diagram illustrating a specific example for explaining the search processing. FIG. 20 is a functional block diagram of a computer.

  When entering data into the database for name identification, it is unlikely that an input error will occur multiple times for the same attribute of the same record, so there is at most one difference in the character string for each attribute, and the length of the difference Even if the assumption that the size is smaller than the whole character string is introduced, it is considered that there is no big problem.

  If there is a single difference, the difference is a section from a position where a different character appears first when compared from the beginning to a position where a different character appears first when compared from the end. Therefore, with a simple search method, a forward match search and a backward match search are combined. For example, as shown in FIG. 1, when comparing a character string S and a character string T, “a” and “b” match from the front to the rear, and “g” from the rear to the front. In the example of FIG. 1, it is determined that a total of 4 characters match each other in the example of FIG.

  In the present embodiment, the following processing is performed in order to quickly extract a character string that satisfies the condition “number of matching characters from the beginning + number of matching characters from the end ≧ minimum number of matching characters”. .

  Specifically, as shown in FIG. 2, a search character string “abcde” as shown in (g) is input to the search target character string as shown in (a), and four or more characters match. Processing for extracting a character string will be described.

  In this embodiment, the result (b) obtained by sorting (a) as it is in the dictionary order and the result obtained by sorting the inverted character string obtained by inverting the order of the fourth and subsequent characters of the search target character string (c) ), The result of sorting the reversed character strings obtained by reversing the order of the third and subsequent characters of the search target character string in dictionary order, and the order of the second and subsequent characters of the search target character string are reversed. A result (e) of sorting the inverted character string in dictionary order and a result (f) of sorting the inverted character string obtained by inverting the order of the first and subsequent characters of the search target character string in dictionary order are prepared.

  Then, (b) is searched with the first four characters “abcd” of the search character string, and a search target character string that matches the front of four characters or more is extracted. In this example, “abcdg” with ID “5” is specified.

  Further, an inverted character string obtained by reversing the order of the fourth and subsequent characters of the search character string (i) Searching for (c) with the first four characters “abce” of “abced”, and performing an inversion that matches four or more characters in front Detect a string. In this example, “abceg” with ID “4” is specified. In the present embodiment, it is determined whether there is an inverted character string that matches the inversion position (also referred to as a cutting point) “4” −2 = 2 characters. It can be seen that (c) does not exist. If it does not exist, the search process for the inversion position “3” is skipped for the reason described below. On the other hand, if it exists, search processing for the inversion position “3” is performed.

  The reason for skipping the search process in the middle will be described with reference to FIGS. 3A to 3D.

  For example, as shown on the left side of FIG. 3A, when the cutting point (reverse position) is the fourth character and the first five characters match, the cutting point (reverse position) is the third character as shown on the right side of FIG. 3A. Then, the first 4 characters are matched. That is, when the number of coincidence ≧ cutting point-1, the number of coincidence is always reduced by 1 if the cut point is shifted by 1 in the head direction.

  Also, as shown on the left side of FIG. 3B, when the cutting point (reverse position) is the fourth character and the first one character matches, the cutting point (reverse position) is 3 characters as shown on the right side of FIG. 3B. When it comes to eyes, the first character match does not change. That is, when the number of matches <cutting point-2, the number of matches does not change even if the cut point is shifted by 1 in the head direction.

  Furthermore, as shown on the left side of FIG. 3C, when the cutting point (reverse position) is the fourth character and the first two characters match, the cutting point (reverse position) is 3 as shown on the right side of FIG. Sometimes the first two characters match does not change. Note that the original character string in the upper row is “abcdefg”, the original character string in the lower row is “abhefk”, and the end characters do not match. That is, when the number of matches = the cut point-2 and the end characters are not matched, the number of matches does not change even if the cut point is shifted by 1 in the head direction.

  On the other hand, in FIG. 3D, the original character string in the upper row is “abcdefg”, the original character string in the lower row is “abhefg”, and the end characters match. In such a case, as shown on the left side of FIG. 3D, when the cutting point (inversion position) is the fourth character and the first two characters match, the cutting point (inversion position) is shown on the right side of FIG. 3D. When is 3, the first five characters match.

  Thus, when the number of matches = cutting point -2, if the end character of the original character string matches, the number of matches increases when the cutting point is shifted to the left, and the end character must match. For example, it can be seen that the number of matches does not change when the cut point is shifted to the left. Therefore, regardless of whether or not the end characters are matched, a forward match search is performed on the search target character strings that match the end characters, and the search target character string whose number of matching characters is the cut-point-2 is obtained. If it exists, the target search target character string may be obtained if a forward matching search is performed when the cut point is shifted to the left.

  Note that if a forward matching search can be performed only on a search target character string that matches the end character, a target search target character string can be obtained more efficiently.

  Returning to the description of FIG. 2, as described above, since there is no inversion character string of the cut point “4” −2 = 2 character match in (c), the cut point “3” (= current The forward matching search for the cut point “4” -1) can be skipped.

  Next, an inverted character string (k) obtained by inverting the order of the second and subsequent characters in the search character string (k) Search for (e) with the first four characters “aedc” of “aedcb”. Detects reverse character string. Here, there is no corresponding reverse character string. Further, it is determined whether there is an inverted character string in which the cut point “2” −2 = 0 matches. Since “bebdc” corresponds to the inverted character string in FIG. 2E, the forward matching search for the cut point “1” is executed.

  Then, the reverse character string obtained by reversing the order of the first and subsequent characters of the search character string (l) Search for (f) with the first four characters “edcb” of “edcba”, and inversion that matches four or more characters in front Detect a string. Here, there is no corresponding reverse character string.

  In this way, the search target character strings with IDs “4” and “5” are obtained as the final search results.

  If such processing is performed, the forward matching search to be performed is thinned out, the processing load is reduced, and the search processing is speeded up.

  Except when the minimum number of matching characters is satisfied by forward matching, as shown in FIG. 1, when the character string mismatch occurs in the middle part of the character string, This is only when the last character of the target character string matches the last character of the search character string. If it is determined from the viewpoints of FIGS. 3A to 3D whether the end characters match, the processing load can be further reduced. Therefore, if the search target character strings are grouped in advance for each type of the end character, the number of search target character strings to be subjected to the forward matching search can be further reduced.

  From the above viewpoint, a search device as shown in FIGS. 4 to 19 is introduced.

  As shown in FIG. 4, the search device 1000 according to the present embodiment includes a search data generation unit 1100 that generates search data from a search target character string stored in a search target character string storage unit 3000, and a search A search data storage unit 1200 for storing the search data generated by the search data generation unit 1100, and a search processing unit 1300 that receives a search condition input and performs a search process described below on the search data storage unit 1200. A search result storage unit 1400 for storing the search results of the search processing unit 1300, and an output unit 1500 for outputting the search results stored in the search result storage unit 1400 based on the search data storage unit 1200.

  As shown in FIG. 5, the search data generation unit 1100 includes a data reading unit 1110, a data division unit 1120, a character string group storage unit 1130, a character reversal unit 1140, a reverse character string storage unit 1150, and a sort And a processing unit 1160. The data reading unit 1110 reads the search target character string from the search target character string storage unit 3000 and outputs it to the data dividing unit 1120 and the sort processing unit 1160. The data dividing unit 1120 performs processing for grouping search target character strings obtained from the data reading unit 1110 and stores the processing results in the character string group storage unit 1130. Based on the data stored in the character string group storage unit 1130, the character string reversing unit 1140 performs character reversal processing described below on the search target character string to which each character string group belongs, and the processing result Is stored in the inverted character string storage unit 1150. The sort processing unit 1160 sorts the inverted character strings stored in the inverted character string storage unit 1150 for each group, generates search index data, and stores the search index data in the search data storage unit 1200.

  As illustrated in FIG. 6, the search processing unit 1300 includes a search condition acquisition unit 1310, a search unit 1320, and a control unit 1340. The search condition acquisition unit 1310 receives the search condition input and outputs it to the search unit 1320 and the control unit 1340. The search unit 1320 includes a first search unit 1321 and a second search unit 1322. The first search unit 1321 performs a forward matching search on the search data stored in the search data storage unit 1200 for the search character string, and stores the search result in the search result storage unit 1400. The second search unit 1322 performs a forward match search on the search data stored in the search data storage unit 1200 according to an instruction from the control unit 1340 and stores the search result in the search result storage unit 1400. . Note that some data in the search result is output to the control unit 1340.

  The control unit 1340 includes a search key generation unit 1341 and a condition determination unit 1342. The search key generation unit 1341 generates a search key by inverting some characters of the search character string. In addition, the condition determination unit 1342 determines whether or not a condition described in detail below is satisfied before outputting the search key. Note that the search flag for determining whether or not the second search unit 1322 performs the forward match search is prepared in a memory area that can be referred to by the control unit 1340 and the second search unit 1322. To do.

  Hereinafter, processing contents of the search apparatus 1000 will be described with reference to FIGS. First, the processing of the search data generation unit 1100 will be described with reference to FIGS. The data reading unit 1110 reads the search target character string from the search target character string storage unit 3000 and outputs it to the data dividing unit 1120 and the sort processing unit 1160 (FIG. 7: step S1). For example, assume that a search target character string as shown in FIG. 8 is read.

  Then, the sort processing unit 1160 acquires the search target character string from the data reading unit 1110, sorts the search target character string in dictionary order, generates index data for forward matching search without cutting, and performs search The data is stored in the data storage unit 1200 (step S3). In the case of search target character strings as shown in FIG. 8, they are sorted in the normal dictionary order as shown in FIG. Index data is generated from such sorted data.

  In addition, the data dividing unit 1120 acquires the search target character string from the data reading unit 1110, and groups the search target character string by the last character (step S5). In the example of FIG. 8, there are a group (FIG. 10A) whose last character is “g” and a group (FIG. 10B) whose name is “e”. Various variations are possible for grouping. For example, a group may be generated for each different character, or a plurality of types of characters may be grouped together. For the grouping result, the search target character string is stored in the character string group storage unit 1130 for each group.

  Next, the character reversing unit 1140 identifies one unprocessed group (step S7). Then, the character reversing unit 1140 sets (longest character string length-1) in the specified group to N (step S9). The processing shifts to the processing in FIG.

  Shifting to the description of the processing in FIG. 11, the character reversing unit 1140 initializes the counter i to 1 (step S11). Then, the character reversing unit 1140 generates an inverted character string obtained by inverting the i-th and subsequent characters for each search target character string in the specified group, and stores the inverted character string in the inverted character string storage unit 1150 (step S13).

  For example, when a group whose end character is “e” is processed, a search character string as shown in FIG. If i = 3, the order of the third and subsequent characters is changed, and an inverted character string as shown in (b) is generated.

  Further, the sort processing unit 1160 sorts the generated inverted character strings stored in the inverted character string storage unit 1150 in the dictionary order, generates index data for forward matching search, and searches the data storage unit 1200. (Step S15). In the example of FIG. 12, the sorting result is as shown in FIG.

  In summary, for example, when processing a group whose end character is “e”, as shown in FIG. 13, if i = 1, data like (a) is generated, and if i = 2, Data such as (b) is generated. If i = 3, data such as (c) is generated, and if i = 4, data such as (d) is generated.

  Further, when processing a group whose end character is “g”, as shown in FIG. 14, if i = 1, data such as (a) is generated, and if i = 2, data in (b) is generated. Data such as (c) is generated if i = 3, and data such as (d) is generated if i = 4.

  Then, the character reversing unit 1140 determines whether i is N or more (step S17). If i is less than N, the character reversing unit 1140 increments i by 1 and returns to step S13 (step S20). On the other hand, if i is greater than or equal to N, the character reversing unit 1140 determines whether there is an unprocessed group in the character string group storage unit 1130 (step S19). If there is an unprocessed group, the process returns to step S7 in FIG. On the other hand, if there is no unprocessed group, the process ends.

  If the processing as described above is performed, the search data storage unit 1200 stores the search data as shown in FIGS. 9, 13, and 14.

  In the case of processing that is not grouped, all the search target character strings may be set as one group and the above-described processing may be performed. In such a case, the data in the upper sections (b) to (f) in FIG. 2 are generated instead of the data in FIGS. 13 and 14.

  Next, processing at the time of search will be described with reference to FIGS. First, the search condition acquisition unit 1310 of the search processing unit 1300 receives an input of a search condition (search character string and minimum matching character number L) from a searcher (FIG. 15: Step S21). In some cases, the search apparatus 1000 is connected to a network and receives from another terminal connected to the network. The search condition acquisition unit 1310 outputs the acquired search condition data to the control unit 1340 and the search unit 1320. For example, it is assumed that the search character string “abcde” is input with the minimum number of matching characters L = 4.

  Then, the first search unit 1321 of the search unit 1320 performs a forward match search for the search character string with respect to the search index without cutting in the search data storage unit 1200, and a character string that matches L characters or more. Are extracted and stored in the search result storage unit 1400 (step S23).

  For example, in FIG. 16, a forward matching search is performed on the search character string (f) “abcde” with respect to search data without cutting as shown in FIG. More specifically, a forward matching search is performed using the first L character “abcd”. In this case, ID “5” is obtained.

  On the other hand, the condition determination unit 1342 of the control unit 1340 sets the minimum matching character count L for the cutting point N (step S25). In addition, the control unit 1340 initially sets a search flag indicating that the next forward match search should be performed (step S27). Then, the processing shifts to the processing in FIG.

  Then, the condition determination unit 1342 of the control unit 1340 determines whether N = 0 (step S29). If N = 0 is not satisfied, the condition determination unit 1342 determines whether a search flag is set (step S31). The first time, the search flag is always set, and the process proceeds to step S33.

  If the search flag is set, the condition determination unit 1342 sets the search flag to off (step S32).

  Thereafter, the condition determination unit 1342 outputs an instruction to the search key generation unit 1341, and in response to this instruction, the search key generation unit 1341 performs a search in which the order of characters after the Nth character in the search character string is reversed. A key is generated, and the search key is output to the second search unit 1322 together with the cutting point N and the end character of the search character string (step S33). When the second search unit 1322 receives the search key from the control unit 1340 together with the cut point and the end character of the search character string, the second search unit 1322 in the search data storage unit 1200 includes a cut point N in the group for the end character of the search character string. A forward match search for the search key is performed on the index, and an identifier of the inverted character string that matches the minimum matching character number L or more (same as the original search target character string in this embodiment) is extracted, The result is stored in the search result storage unit 1400 (step S35). If the grouping according to the last character is not performed, the processing may be performed assuming that only one group exists.

  Since “abcde” is a search character string, in a group whose end is “e”, if N = 4, a forward match search is performed on the search data shown in FIG. At this time, since the fourth and subsequent characters are reversed, the search key is “abced” as shown in FIG. Therefore, as shown in FIG. 18, the number of matches for the inverted character string of ID “2” is “1”, the number of matches for the inverted character string of ID “4” is “4”, and the ID “3” The number of matches for the inverted character string “” is “0”. Accordingly, the ID “4” is extracted and stored in the search result storage unit 1400.

  The second search unit 1322 determines whether there is an inverted character string with the number of matches (N−2), and if there is an inverted character string with the number of matches (N−2), the search is performed. A flag is set (step S37). As described above, the search flag is set when there is a possibility that an inverted character string having the minimum number L of matching characters can be extracted, and otherwise the search flag is left off.

  In the example of FIG. 18, the search flag remains off because there is no inverted character string with a match number of 2 obtained by subtracting 2 from N = 4. Then, the process proceeds to step S41.

  In step S41, the condition determination unit 1342 decrements N by 1. Thereafter, the process returns to step S29.

  In the specific example described above, for N = 3, the search flag is set off so that the second search unit 1322 does not perform the forward match search. Therefore, in step S31, it is determined that the search flag is not set, and the condition determination unit 1342 sets the search flag (step S39). Once the search flag is set off, not all forward matching searches can be skipped. Therefore, for the next N, a search flag is set in order to perform a forward match search. Then, control goes to a step S41.

  In the example of FIG. 16, the search key (h) for N = 3 is not generated, and the forward matching search for the search data (c) is not performed.

  When N = 2, since the search flag is on, a search key in which the order of the second and subsequent characters is reversed as shown in FIG. 16 (i) is generated. Then, a forward matching search for the search key is performed on the search data (d) for N = 2. There is no reverse character string that matches four or more characters. In this case, as shown in FIG. 19, there is an inverted character string in which “0” characters are matched by subtracting 2 from N = 2. Accordingly, the search flag is set.

  Then, N = 1 and the search flag is turned on, so that a search key in which the order of the first and subsequent characters is reversed as shown in FIG. Then, a forward matching search for the search key is performed on the search data (e) for N = 1. There is no reverse character string that matches four or more characters. When N = 1, the process of step S37 may be skipped.

  If the processing as described above is performed, the search result storage unit 1400 stores the identifier {4, 5} of the search target character string.

  When it is determined in step S29 that N = 0, the output unit 1500 searches the search target character string corresponding to the identifier of the search target character string stored in the search result storage unit 1400 from the search data storage unit 1200. A column is extracted and output (step S43).

  If the above processing is performed, a similar character string that satisfies the condition that the sum of the number of matching characters from the front and the number of matching characters from the back is greater than or equal to a certain number on the premise that there is only one mismatch in the character string. Can be searched at high speed. In addition, the processing is simplified without using both forward coincidence and backward coincidence.

  Although one embodiment of the present technology has been described above, the present technology is not limited to this.

  For example, the functional block diagrams of FIGS. 4 to 6 are examples, and may not necessarily match actual program modules. As for the processing flow, as long as a similar processing result is obtained, the order of steps may be changed or parallel processing may be performed. For example, the search processing for the first search unit 1321 and the second search unit 1322 may be performed in parallel.

  Similarly, although the case where the search data generation unit 1100 and the search processing unit 1300 are implemented in one search device 1000 is shown, the search data generation unit 1100 and search processing unit 1300 may be implemented by different devices. Furthermore, the processing of the search data generation unit 1100 may be performed by a plurality of devices, and the processing of the search processing unit 1300 may be performed by a plurality of devices.

    The search device 1000 described above is a computer device, and as shown in FIG. 20, a memory 2501, a CPU (Central Processing Unit) 2503, a hard disk drive (HDD: Hard Disk Drive) 2505, and a display device 2509. A display control unit 2507 connected to the computer, a drive device 2513 for a removable disk 2511, an input device 2515, and a communication control unit 2517 for connecting to a network are connected by a bus 2519. An operating system (OS) and an application program for executing the processing in this embodiment are stored in the HDD 2505, and are read from the HDD 2505 to the memory 2501 when executed by the CPU 2503. The CPU 2503 controls the display control unit 2507, the communication control unit 2517, and the drive device 2513 according to the processing content of the application program, and performs a predetermined operation. Further, data in the middle of processing is mainly stored in the memory 2501, but may be stored in the HDD 2505. In an embodiment of the present technology, an application program for performing the above-described processing is stored in a computer-readable removable disk 2511 and distributed, and installed from the drive device 2513 to the HDD 2505. In some cases, the HDD 2505 may be installed via a network such as the Internet and the communication control unit 2517. Such a computer apparatus realizes various functions as described above by organically cooperating hardware such as the CPU 2503 and the memory 2501 described above and programs such as the OS and application programs. .

  The above-described embodiment can be summarized as follows.

  The search device according to the present embodiment includes (A) the first search data of a search target character string and N or more characters in each search target character string for each of an integer N that is greater than or equal to a first predetermined number of characters. A first data storage unit for storing second search data for an inverted character string in which the order of the characters is changed, and (B) first search data stored in the first data storage unit The search character string (for example, the second predetermined number portion at the beginning of the search character string) is subjected to a forward matching search, and a search target character string that matches the second predetermined number of characters or more is detected. A first search unit that stores the identifier of the search target character string in the second data storage unit, and (C) a search key in which the order of characters after the integer M characters in the search character string is switched (for example, the first of the search keys) The second predetermined number of parts) Is performed on the second search data for the integer M stored in the data storage unit to detect an inverted character string that matches the second predetermined number of characters or more and matches the detected inverted character string. A second search unit that stores an identifier of the search target character string to be stored in the second data storage unit and determines whether or not there is an inverted character string that matches the integer M-2 characters; and (D) a second There is an inverted character string in which a search instruction for the integer M out of the second predetermined number of characters to 1 is matched with the second searching unit from the second predetermined number of characters to 1 by the second searching unit. And a control unit for outputting except immediately after it is determined not to.

  In this way, the number of forward matching searches by the second search unit can be reduced, so that the search process is speeded up.

  In addition, the second search data described above may be grouped for each type of end character of the search target character string. In this case, the second search unit may perform a forward match search for the second search data belonging to the group of the last character type that matches the last character of the search character string. In this way, the search target character string can be further narrowed down, and the search process can be speeded up.

  The control unit described above outputs a search instruction with the second predetermined number of characters as an integer M to the second search unit, and an inverted character string in which the integer M-2 characters are matched by the second search unit. If it is determined that there is an integer M-1 as a new integer M, a search instruction is output to the second search unit, and there is an inverted character string that matches the integer M-2 characters by the second search unit. If it is determined not to do so, the search instruction may be output to the second search unit with the integer M-2 as the new integer M.

  Furthermore, the search device described above generates an inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integers N that are greater than or equal to the first predetermined number of characters, and the inverted characters You may make it further have a search data generation part which sorts a column and produces | generates the 2nd search data. As a result, the second search data is automatically generated.

  Further, the search device groups the search target character strings for each type of the last character of the search target character string, and for each of the groups, each of the integers N that is 1 or more and the first predetermined number of characters or less belongs to the group. It further includes a search data generation unit that generates an inverted character string in which the order of characters after the N characters in the search target character string is changed, and sorts the inverted character string to generate second search data. Also good. Even when grouping by the last character, the second search data is automatically generated.

  A program for causing a computer to perform the above-described processing can be created. The program is, for example, a computer-readable storage medium or storage device such as a flexible disk, a CD-ROM, a magneto-optical disk, a semiconductor memory, or a hard disk. Stored in The intermediate processing result is temporarily stored in a storage device such as a main memory.

  The following supplementary notes are further disclosed with respect to the embodiments including the above examples.

(Appendix 1)
For the first character string for the search target character string and the inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integer N that is greater than or equal to the first predetermined number of characters. A first data storage unit for storing two search data;
Performing a search character string forward match search for the first search data stored in the first data storage unit to detect a search target character string that matches the second predetermined number of characters in advance, A first search unit that stores an identifier of the detected character string to be searched in a second data storage unit;
A forward match search of a search key in which the order of characters after the integer M characters in the search character string is changed is performed on the second search data for the integer M stored in the first data storage unit. And detecting an inverted character string that matches the second predetermined number of characters or more forward, and storing the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit, A second search unit for determining whether there is an inverted character string that matches the integer M-2 characters;
A search instruction for the integer M out of the second predetermined number of characters to 1 is sent from the second predetermined number of characters to 1 to the second search unit by the second search unit. A control unit that outputs except immediately after it is determined that a character-matched inverted character string does not exist;
A search device having:

(Appendix 2)
The second search data is grouped for each type of end character of the search target character string,
The search device according to claim 1, wherein the second search unit performs a forward match search for the second search data belonging to a group of end character types that match the end character of the search character string.

(Appendix 3)
The control unit is
To the second search unit, a search instruction is output with the second predetermined number of characters as the integer M,
If the second search unit determines that there is an inverted character string that matches the integer M-2 characters, the search instruction is output to the second search unit with the integer M-1 as a new integer M. And
If the second search unit determines that there is no inverted character string that matches the integer M-2 characters, the search instruction is sent to the second search unit with the integer M-2 as a new integer M. Output the search device according to appendix 1 or 2.

(Appendix 4)
For each of the integers N that is greater than or equal to 1 and less than or equal to the first predetermined number of characters, an inverted character string in which the order of the characters after the N characters in each search target character string is replaced is generated, and the inverted character string is sorted and the second character string is sorted. The search device according to any one of supplementary notes 1 to 3, further comprising: a search data generation unit that generates search data.

(Appendix 5)
The search target character strings are grouped for each type of the last character of the search target character string, and for each of the groups, each of the search target characters belonging to the group for each of the integers N that is greater than or equal to the first predetermined number of characters. The search according to supplementary note 2, further comprising: a search data generation unit that generates an inverted character string in which the order of characters after the N characters in the sequence is changed, and sorts the inverted character string to generate the second search data. apparatus.

(Appendix 6)
For the first character string for the search target character string and the inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integer N that is greater than or equal to the first predetermined number of characters. The first search data stored in the first data storage unit storing the second search data is subjected to a forward match search of the search character string, and the front matches by a predetermined number of characters or more. Detecting a search target character string and storing the detected identifier of the search target character string in a second data storage unit;
From the second predetermined number of characters to 1, the search processing for the integer M out of the second predetermined number of characters to 1 is determined that there is no inverted character string that matches the integer M-2 characters in the search processing. The steps to perform except immediately after,
Including
The search process
A forward match search of a search key in which the order of characters after the integer M characters in the search character string is changed is performed on the second search data for the integer M stored in the first data storage unit. And detecting an inverted character string that matches the second predetermined number of characters or more forward, and storing the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit, A search processing method executed by a computer for determining whether or not there is an inverted character string that matches the integer M-2 characters.

(Appendix 7)
For the first character string for the search target character string and the inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integer N that is greater than or equal to the first predetermined number of characters. The first search data stored in the first data storage unit storing the second search data is subjected to a forward match search of the search character string, and the front matches by a predetermined number of characters or more. Detecting a search target character string and storing the detected identifier of the search target character string in a second data storage unit;
From the second predetermined number of characters to 1, the search processing for the integer M out of the second predetermined number of characters to 1 is determined that there is no inverted character string that matches the integer M-2 characters in the search processing. The steps to perform except immediately after,
To the computer,
The search process
A forward match search of a search key in which the order of characters after the integer M characters in the search character string is changed is performed on the second search data for the integer M stored in the first data storage unit. And detecting an inverted character string that matches the second predetermined number of characters or more forward, and storing the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit, A search processing program for determining whether or not there is an inverted character string that matches the integer M-2 characters.

1000 Search Device 3000 Search Target Character String Storage Unit 1100 Search Data Generation Unit 1200 Search Data Storage Unit 1300 Search Processing Unit 1400 Search Result Storage Unit 1500 Output Unit

Claims (6)

For the first character string for the search target character string and the inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integer N that is greater than or equal to the first predetermined number of characters. A first data storage unit for storing two search data;
Performing a search character string forward match search for the first search data stored in the first data storage unit to detect a search target character string that matches the second predetermined number of characters in advance, A first search unit that stores an identifier of the detected character string to be searched in a second data storage unit;
A forward match search of a search key in which the order of characters after the integer M characters in the search character string is changed is performed on the second search data for the integer M stored in the first data storage unit. And detecting an inverted character string that matches the second predetermined number of characters or more forward, and storing the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit, A second search unit for determining whether there is an inverted character string that matches the integer M-2 characters;
A search instruction for the integer M out of the second predetermined number of characters to 1 is sent from the second predetermined number of characters to 1 to the second search unit by the second search unit. A control unit that outputs except immediately after it is determined that a character-matched inverted character string does not exist;
A search device having: The second search data is grouped for each type of end character of the search target character string,
2. The search device according to claim 1, wherein the second search unit performs a forward match search on the second search data belonging to a group of the last character type that matches the last character of the search character string. For each of the integers N that is greater than or equal to 1 and less than or equal to the first predetermined number of characters, an inverted character string in which the order of the characters after the N characters in each search target character string is replaced is generated, and the inverted character string is sorted and the second character string is sorted. The search device according to claim 1, further comprising a search data generation unit configured to generate search data. The search target character strings are grouped for each type of the last character of the search target character string, and for each of the groups, each of the search target characters belonging to the group for each of the integers N that is greater than or equal to the first predetermined number of characters. The search data generation unit according to claim 2, further comprising: an inverted character string in which the order of characters after the N characters in the sequence is switched, and generating the second search data by sorting the inverted character string. Search device. For the first character string for the search target character string and the inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integer N that is greater than or equal to the first predetermined number of characters. The first search data stored in the first data storage unit storing the second search data is subjected to a forward match search of the search character string, and the front matches by a predetermined number of characters or more. Detecting a search target character string and storing the detected identifier of the search target character string in a second data storage unit;
From the second predetermined number of characters to 1, the search processing for the integer M out of the second predetermined number of characters to 1 is determined that there is no inverted character string that matches the integer M-2 characters in the search processing. The steps to perform except immediately after,
Including
The search process
A forward match search of a search key in which the order of characters after the integer M characters in the search character string is changed is performed on the second search data for the integer M stored in the first data storage unit. And detecting an inverted character string that matches the second predetermined number of characters or more forward, and storing the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit, A search processing method executed by a computer for determining whether or not there is an inverted character string that matches the integer M-2 characters. For the first character string for the search target character string and the inverted character string in which the order of the characters after the N characters in each search target character string is changed for each of the integer N that is greater than or equal to the first predetermined number of characters. The first search data stored in the first data storage unit storing the second search data is subjected to a forward match search of the search character string, and the front matches by a predetermined number of characters or more. Detecting a search target character string and storing the detected identifier of the search target character string in a second data storage unit;
From the second predetermined number of characters to 1, the search processing for the integer M out of the second predetermined number of characters to 1 is determined that there is no inverted character string that matches the integer M-2 characters in the search processing. The steps to perform except immediately after,
To the computer,
The search process
A forward match search of a search key in which the order of characters after the integer M characters in the search character string is changed is performed on the second search data for the integer M stored in the first data storage unit. And detecting an inverted character string that matches the second predetermined number of characters or more forward, and storing the identifier of the search target character string corresponding to the detected inverted character string in the second data storage unit, A search processing program for determining whether or not there is an inverted character string that matches the integer M-2 characters.

Images