JP6623040B2 - Butt processing device, butt processing method and butt processing program - Google Patents

Description

  The present invention relates to a match processing apparatus, a match processing method, and a match processing program for performing a match process for a plurality of databases each storing a plurality of records.

  Conventionally, when a plurality of records included in each of a plurality of databases (for example, the database A and the database B) are matched, a matching result is obtained by assigning a code for classifying the matching state to each record. Note that a record in this specification is a block of data stored in a database, and indicates a block of data indicating unique information such as address information. In addition, the term “match” in this specification refers to databases (or records in a database) in order to check whether or not all or part of data included in records in a plurality of databases match. Is to match.

  In the conventional reconciliation process, for example, when the record in the database A and the record in the database B match or when some association is obtained, the code “1” indicating that the record matches the record ], And when the records do not match, a code “−1” indicating that the records are mismatched is added, and the record match / mismatch is identified by a simple code.

  Moreover, the technique currently disclosed by the following patent documents 1-3 exists as a prior art. Patent Document 1 discloses a technique for creating a synthetic database having a tree structure by synthesizing a plurality of databases in which character string hierarchy data (such as address names) and code character string data (such as postal codes) are stored. ing. According to the technology disclosed in Patent Document 1, character string hierarchy data is data having a hierarchical structure such as an address name, and matching / non-coincidence is determined by comparing character string hierarchy data in hierarchical units (node units).

  Patent Document 2 discloses a technique for creating a merge database by merging (integrating) an address code database (including address information represented by an array of numbers) and an address database (including place name information). It is disclosed. According to the disclosed technique of Patent Document 2, when merging databases, the address (the part of the town / village name) is deleted and searched one character at a time from the right end, and it is determined that the character string of the hit location is encoded. And remember. At this time, for example, a symbol “/” is inserted in order to identify a coded portion.

  Patent Document 3 discloses a technique for searching for corresponding address data from an address database based on a search address character string input by a user. According to the technology disclosed in Patent Literature 3, when there is no address corresponding to the search address character string input by the user, the search address character string is reduced from the rear by a predetermined amount (for example, until one or more addresses are hit). Delete the address notation unit) and repeat the search.

JP 2010-134828 A (abstract, paragraph [0116], FIG. 1, FIG. 30, FIG. 31, FIG. 34) JP 2003-167912 A (Abstract, paragraph [0028], FIG. 6) JP2003-186880 (abstract)

  In the prior art, the status of matching / non-matching in each record is identified (for example, the above-mentioned codes “1” and “−1” are assigned), and the location to be corrected for each non-matching record is specified and corrected (for example, And the above-described technologies disclosed in Patent Documents 1 and 2). However, even if the location to be corrected is specified for each record, it is not easy to find an appropriate correction value. In addition, even if a record that does not match is identified, it is necessary to understand where the cause of the mismatch is, and how many records are mismatched for the same reason in the entire record in the database. Therefore, it is difficult to efficiently and appropriately correct the mismatched records.

  In consideration of the above problems, the present invention matches a plurality of records included in each of a plurality of databases, and sets the matching result as a quantitative value (for example, the number of records matched between databases). It is an object of the present invention to provide a match processing device, a match processing method, and a match processing program that can clearly indicate the match / mismatch status of each record between databases.

In order to achieve the above object, the matching processing apparatus of the present invention is a matching processing apparatus that performs a matching process of a plurality of databases each storing a plurality of records including character string information having a hierarchical structure,
The character string information included in the record in the first database of the plurality of databases and the character string information included in the record in the second database of the plurality of databases are compared with each other. A record comparison unit for detecting information match or mismatch;
When a record including character string information common in a predetermined range from a predetermined upper layer to a predetermined lower layer of the hierarchical structure exists in both the first and second databases, the character common in the predetermined range Including the number of records in the first database including column information, the number of records in the second database including character string information common to the predetermined range, and character string information common to the predetermined range. A matching result generator for associating information indicating each of the records in the first and second databases including common character string information within the predetermined range;
Have.

Further, in order to achieve the above object, the matching processing method of the present invention is a matching processing method for performing matching processing of a plurality of databases each storing a plurality of records including character string information having a hierarchical structure,
The character string information included in the record in the first database of the plurality of databases and the character string information included in the record in the second database of the plurality of databases are compared with each other. A record comparison step for detecting information match or mismatch;
If a record including character string information common in a predetermined range from a predetermined upper layer to a predetermined lower layer of the hierarchical structure exists in both the first and second databases, the common character in the predetermined range Including the number of records in the first database including column information, the number of records in the second database including character string information common to the predetermined range, and character string information common to the predetermined range. A matching result generation step for associating information indicating each of the records in the first and second databases including common character string information in the predetermined range;
Have.

In order to achieve the above object, the matching processing program of the present invention executes a matching processing method for performing a matching process of a plurality of databases each storing a plurality of records including character string information having a hierarchical structure. A matching process program for
The character string information included in the record in the first database of the plurality of databases and the character string information included in the record in the second database of the plurality of databases are compared with each other. A record comparison step for detecting information match or mismatch;
If a record including character string information common in a predetermined range from a predetermined upper layer to a predetermined lower layer of the hierarchical structure exists in both the first and second databases, the common character in the predetermined range Information based on the number of records in the first database including column information, information based on the number of records in the second database including character string information common to the predetermined range, and characters common to the predetermined range A matching result generating step for associating information indicating that column information is included with each of the records in the first and second databases including common character string information in the predetermined range;
A butt processing program for causing a computer to execute a butt processing method.

  The present invention has the above-described configuration or processing, and a plurality of records included in each of a plurality of databases are collated, and the collation result is a quantitative value (for example, the number of records collated between databases, etc. ), It is possible to clearly indicate the match / mismatch status of each record in the databases. In addition, the present invention has an effect of making it possible to confirm the breakdown of the match / mismatch status by quantitatively indicating the match / mismatch status of each record in the databases. Furthermore, the present invention has an effect of enabling a work for resolving inconsistency between databases to be rapidly advanced with respect to a record that is inconsistent.

  In addition, the present invention has a remarkable effect particularly when applied to a matching process between a ledger database including address information and a map database including address information associated with image information representing a map or the like. In particular, there are problems with inconsistencies in lot numbers in national territories in multiple databases including address information, and it is important to resolve such inconsistencies accurately and quickly. It was. The present invention quickly finds the value of an appropriate key item using a code system that clearly indicates a match / mismatch situation as described in the embodiment of the present invention in the examination of a match between a land ledger and an address. This makes it possible to know the cause of the mismatch.

It is a block diagram which shows an example of a structure of the matching processing apparatus common to the 1st-3rd embodiment of this invention. It is a flowchart which shows the outline | summary of the matching process common to the 1st-3rd embodiment of this invention. It is a flowchart which shows an example of the prior setting process in the matching process common to the 1st-3rd embodiment of this invention. It is a flowchart which shows an example of the matching code setting process in the matching process common to the 1st-3rd embodiment of this invention. It is a figure which shows an example of the databases A and B used in order to demonstrate the matching process in the 1st-3rd embodiment of this invention. It is a figure which shows an example of the state of the databases A and B in the process of the matching process in the 1st and 2nd embodiment of this invention. It is a figure which shows an example of the 1st state of the databases A and B in the process of the matching process in the 1st Embodiment of this invention. It is a figure which shows an example of the 2nd state of the databases A and B in the process of the matching process in the 1st Embodiment of this invention. It is a figure which shows an example of the state of the databases A and B containing the final matching result obtained in the matching process in the 1st Embodiment of this invention. In the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific matching code was set from the final matching result. It is a figure which shows an example of the 1st state of the databases A and B in the process of the matching process in the 2nd Embodiment of this invention. It is a figure which shows an example of the 2nd state of the databases A and B in the process of the matching process in the 2nd Embodiment of this invention. It is a figure which shows an example of the 3rd state of the databases A and B in the process of the matching process in the 2nd Embodiment of this invention. It is a figure which shows an example of the state of the databases A and B containing the final matching result obtained in the matching process in the 2nd Embodiment of this invention. In the 2nd Embodiment of this invention, it is a figure which shows an example of the state of the databases A and B containing the match result obtained in the process of a match process, and the match result finally obtained. It is a figure which shows an example of the state of the databases A and B containing the final matching result obtained in the matching process in the 3rd Embodiment of this invention. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific matching code "10101" was extracted from the final matching result. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific matching code "10201" was extracted from the final matching result. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific collision code "11001" was set from the final matching result. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific matching code "20101" was set from the final matching result. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific matching code "20201" was set from the final matching result. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which specific matching code "20404" was set from the final matching result. In the Example which concerns on the 1st Embodiment of this invention, it is a figure which shows an example of the state which extracted only the record in which the specific matching code "21002" was set from the final matching result. It is a figure which shows an example of the state which extracted the 1st-6th record (1st-6th record) from the table shown by FIG. FIG. 16 is a diagram illustrating an example of a state in which the first to sixth records (first to sixth records) are extracted from the table illustrated in FIG. 15 and an “area” field is displayed. With respect to the records determined to correspond one-to-one in the two databases (the ledger database and the map database) by the matching process according to the present invention, the common items (“ It is a figure which shows an example of the scatter diagram created using the value of the "area" field).

  Hereinafter, first to third embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is a block diagram showing an example of the configuration of a butt processing apparatus common to the first to third embodiments of the present invention. A match processing apparatus 10 illustrated in FIG. 1 includes a database reading unit 11 and a match processing unit 12. In addition, a storage medium 20 in which a plurality of databases are stored, an operation input unit 30, and a display unit 40 are connected to the matching processing device 10.

  The database reading unit 11 has a function of reading a plurality of databases (databases A and B in FIG. 1) stored in the storage medium 20. The database read by the match processing device 10 is temporarily stored in, for example, a main storage device (main memory, not shown in FIG. 1) in the match processing device 10 in order for the match processing unit 12 to perform processing. The

  The reconciliation processing unit 12 has a function of performing reconciliation processing for each record in a plurality of databases (databases A and B in FIG. 1) read by the database reading unit 11, and includes a record comparison unit 13, a reconciliation result generation Unit 14 and a match result output unit 15.

  The record comparison unit 13 compares the character string information included in each record of each of a plurality of databases (databases A and B in FIG. 1), and performs a matching process for detecting matching or mismatching of the character string information. It has a function. The match result generation unit 14 has a function of generating a match result for each record of a plurality of databases (databases A and B in FIG. 1) based on the comparison result by the record comparison unit 13. The match result generation unit 14 can generate a match result of each record of a plurality of databases (databases A and B in FIG. 1) as, for example, a match code (code information obtained by integrating the match results) described later. is there. The match result output unit 15 has a function of outputting the match result generated by the match result generation unit 14 and recording the result as data in the database or displaying the data on the display unit 40.

  The storage medium 20 has a function of storing a database, and can be realized by, for example, a hard disk, an optical recording medium, a magnetic recording medium, a nonvolatile memory, or the like. Note that the storage medium 20 may be arranged at a location accessible by the matching processing apparatus 10 via a network or the like. Although FIG. 1 shows a state where two databases (databases A and B) are stored in the same storage medium 20 as a plurality of databases, the plurality of databases are stored in different storage media 20 respectively. It may be. In the following, the case where the matching process in two databases is performed will be mainly described, but the matching process in three or more databases may be performed.

  The database stored in the storage medium 20 is a collection of data, and has a plurality of data including character string information. Data included in the database is stored in the database in units of records based on, for example, a predetermined storage format (for example, a table format). Each record includes character string information having a hierarchical structure, for example. As an example of the character string information, for example, address information having a hierarchical structure such as a municipality, a large character, a small character, a lot number, a branch number, and the like, other arbitrary types of information can be used. Further, the number of records included in the plurality of databases may be the same or different.

  Further, the operation input unit 30 has a function that enables a user operation in the matching processing device 10 and can be realized by an input interface such as a mouse or a keyboard. By using the operation input unit 30, the user can specify various settings such as specifying a database to be read by the match processing device 10, setting in the match process, start instruction for the match process, and information display instruction on the display unit 40. And an instruction can be input to the match processing apparatus 10.

  Further, the display unit 40 has a function of providing data stored in each of a plurality of databases, a matching result generated by the matching processing unit 12, and the like as information that can be visually recognized by the user. Alternatively, it can be realized by a display or the like. Further, the operation input unit 30 and the display unit 40 may be realized by a touch panel in which an operation input function and a display function are integrated.

  In FIG. 1, each function of the matching processing apparatus 10 is schematically illustrated by a block. However, each function represented by these blocks is, for example, hardware or a CPU (Central Processing Unit). This can be realized by executing software (program) by the device. The match processing device 10 can be realized by, for example, a general-purpose PC (Personal Computer), and each process in the match processing device 10 is performed in each of the first to third embodiments of the present invention (for example, described later). This can be realized by the CPU executing a program in which an execution instruction of each processing) included in the flowcharts shown in FIGS.

  Although not shown in FIG. 1, the matching processing device 10 realized by a general-purpose PC includes a main storage device (main memory) that temporarily stores data, programs, and the like. First to third embodiments of the present invention while temporarily storing data in the database read by the unit 11, data changed or generated during processing, programs to be executed by the CPU, and the like in the main storage device It is possible to perform the processing in the form.

  Next, the matching process in the first to third embodiments of the present invention will be described with reference to FIGS. FIG. 2A is a flowchart showing an outline of the matching process common to the first to third embodiments of the present invention, and FIG. 2B is a pre-setting process in the matching process common to the first to third embodiments of the present invention. FIG. 2C is a flowchart illustrating an example of a matching code setting process in the matching process common to the first to third embodiments of the present invention (step S200 illustrated in FIG. 2A). Is a flowchart showing an example of the matching code setting process). 2A to 2C is executed by the abutting processing device 10 illustrated in FIG.

  The flowcharts shown in FIGS. 2A to 2C include the operations of the butt processing in the first to third embodiments of the present invention to be described later. Specifically, in step S225 in FIG. 2C, processing for changing the processing target level is performed. At this time, a mode of increasing the processing target level (first embodiment described later), a mode of decreasing the processing target level ( A second embodiment described later) or a combination of these aspects (third embodiment described later) can be employed.

  Hereinafter, each of the first to third embodiments will be described in detail. In order to facilitate understanding of the present invention, a case where character string information having the hierarchical structure shown in FIG. 3 is included in each record of the two databases A and B to be subjected to the matching process is taken as an example. Explain by giving.

<First Embodiment>
First, the matching process in the first embodiment of the present invention will be described. As shown in FIG. 2A, the matching process according to the first embodiment of the present invention is roughly divided into a pre-setting process (step S100) and a matching code setting process (step S200). In the pre-setting process in step S100, parameters used in the subsequent matching code setting process are set. In the matching code setting process in step S200, records in a plurality of databases (for example, databases A and B) that are actually targeted for the matching process are compared, and information indicating the matching result for each record (for example, (Matching code) is given.

  In the preset processing, as shown in FIG. 2B, the matching processing device 10 reads two databases A and B stored in the storage medium 20, and matches each record included in these databases A and B. The code field is initialized (for example, “0” is set as an initial value), and a hierarchy (matching level) for performing matching according to the record hierarchy is set (step S101). The set butt level is held by the butt processor 10 for use in subsequent processing. For example, as shown in FIG. 4, the data in the record is composed of three layers (an upper layer having a 4-digit number, a middle layer having a 3-digit number, and a lower layer having a 3-digit number). In the case of the character string information, the matching processing apparatus 10 sets the hierarchical structure including all of the upper layer, the middle layer, and the lower layer as level 1, sets the hierarchical structure including the upper layer and the middle layer as level 2, and sets the hierarchical structure including only the upper layer as level 3. Is possible.

  The match processing device 10 first determines an initial level to be processed, and sets this initial level as a variable LVL (processing target level) (step S103). For example, level 1 (variable LVL = 1) is set as the initial level. At this time, the user may set the final level to be processed last, together with the setting of the initial level. Further, the lowermost layer of the character string information may be automatically set as the initial level, and the uppermost layer of the character string information may be set as the final level. For example, in the example of databases A and B shown in FIG. 4, when level 1 is set as the initial level and level 3 is set as the final level, in the subsequent processing, all levels 1 to 3 are matched. Processing will be performed. The initial level and the final level are set such that the initial level is set to level 1 and the final level is set to level 2, or the initial level is set to level 2 and the final level is set to level 3. Thus, it is possible to set a range of levels for performing the matching process. In the first embodiment, since the processing target level is gradually increased in the subsequent processing (that is, the length of the character string information to be compared is gradually shortened in units of layers), the final level is higher than the initial level. It is necessary to increase the level (the initial level includes lower-level character strings).

  After the setting of parameters and the like is completed in the above-described pre-setting process, in the match code setting process, as shown in FIG. The number of records including information is calculated, and the maximum number of records is extracted (step S201). For example, when level 1 (variable LVL = 1) is set as the processing target level, in the example of database A shown in FIG. 4, records containing the same character string information at the processing target level (level 1) Record No. 1, 2, and 3 records (number of identical records = 3) and record No. 5 and 6 records (number of identical records = 2), that is, the maximum number of records is 3. Similarly, in the example of the database B shown in FIG. 4, a record including the same character string information at the processing target level (level 1) is a record No. 8 and 9 records (number of identical records = 2), and the maximum number of records is 2. The maximum number of records in database A is set to the value vAMAX, and the maximum value of records in database B is set to the value vBMAX. These values vAMAX and vBMAX are used as the number of loops of loop processing described later. In the loop processing described later, the processing is appropriately performed even when the number of loops is the total number of records in the respective databases A and B. However, in advance, a value vAMAX that is the maximum value of the number of records is processed. Also, by setting vBMAX as the number of loops, it is possible to reduce the processing time required for loop processing.

  As described above, when the setting of the maximum value (the loop count values vAMAX and vBMAX) of each of the initial level and the final level, and the databases A and B is completed, the matching processing device 10 It is possible to perform record matching processing. For example, the matching processing apparatus 10 first sets the number of identical records (variable A1) in the database A to 1 (step S203) and sets the number of identical records (variable B1) in the database B to 1 (step S203). S205), records satisfying these conditions are extracted from each of the databases A and B, and a common record (that is, a record constituted by the same character string information) is searched (step S207). If no common record having common character string information is detected in step S207, it is determined that there is no record for which a match code is to be set (step S209), and the processes in steps S211 and S213 are performed. Not executed.

  Referring to the examples of databases A and B shown in FIG. 4, a record with the same number of records 1 included in database A is a record No. 4, 7, and 8, and the record with the same number of records 1 included in the database B is the record No. 1 to 7 records. By comparing these records, the reconciliation processing apparatus 10 records the record No. in the database A. 7 and record No. in database B. It is detected that the record No. 6 is a common record having common character string information “13556789012”.

  Then, the matching processing apparatus 10 sets a matching code represented by using the values of three variables, the variable LVL, the variable A1, and the variable B1, for these records common to the databases A and B (step S211). . The matching code can be expressed by various methods. For example, the matching code can be obtained from a calculation formula such as a matching code = LVL * 10000 + A1 * 100 + B1. In the above example, since the variable LVL = 1, the variable A1 = 1, and the variable B1 = 1, the record No. 7 and record No. in database B. For the record 6, the matching code = 1 * 10000 + 1 * 100 + 1 = 10101 is set. The match code obtained in this way is written in the match code column of the corresponding record (step S213), and as a result, the record No. in the database A is recorded. 7 match code field and record No. in database B. Record No. 6 “10101” is set in the matching code column 6.

  When the match processing device 10 finishes searching for the variables A1 = 1 and B1 = 1, it subsequently determines whether or not the variable B1 is equal to the value vBMAX (step S215), and the variable B1 does not reach the value vBMAX. In this case, the variable B1 is increased (incremented) by 1 (step S217), and the processes after step S207 are performed again. If it is determined in step S215 that the variable B1 has reached the value vBMAX, it is determined whether the variable A1 is equal to the value vAMAX (step S219). If the variable A1 has not reached the value vAMAX, Then, the variable A1 is incremented (step S221), and the processing after step S205 is performed again. As described above, the database in each combination of the variable A1 in the range from 1 to vAMAX and the variable B1 in the range from 1 to vBMAX at a specific processing target level by the processing in steps S203 to S221. It is searched whether or not there is a common record between A and database B. For the common record, a coincidence code is set in the coincidence code column of the record.

  By this series of processing, in the example of the databases A and B in FIG. Records 5 and 6 and record No. 4 is set to the record No. 4 (obtained under the condition of variable A1 = 2 and variable B1 = 1). 1, 2, and 3 and the record No. in database B. The matching code “10301” is set for one record (obtained under the condition of variable A1 = 3 and variable B1 = 1). As a result, for example, the databases A and B are in the state shown in FIG.

  When the variable A1 reaches vAMAX, the variable B1 reaches vBMAX, and processing for all the same number of records ends, the matching processing device 10 determines whether or not the processing target level (variable LVL) is equal to the final level. (Step S223) If the variable LVL has not reached the final level, the variable LVL is changed (Step S225), and the processes after Step S201 are performed again. Note that in the first embodiment, a process for increasing the matching level is performed in step S225, that is, the matching processing apparatus 10 increments the variable LVL in step S225.

  In the processing after step S201 executed when the variable LVL is incremented to level 2 (variable LVL = 2), and in the processing after step S201 executed with the level of the collision increased, the matching code column has already been entered. Records for which a match code is set are excluded from search targets in the search process in step S207. That is, in the first embodiment, when a match code is once set in a record in the course of processing, control is performed so that the match code of the record is not changed.

  In the example of the databases A and B in FIG. 4 and the record No. in database B. The matching code “20102” is set for the records 2 and 3 (obtained under the conditions of variable LVL = 2, variable A1 = 1, variable B1 = 2). 8 record and record No. in database B. The matching code “30102” is set for the records of 8 and 9 (obtained under the condition of variable LVL = 3, variable A1 = 1, variable B1 = 2). As a result, for example, the databases A and B are in the state shown in FIG.

  When the matching process from the initial level (for example, set to level 1) to the final level (for example, set to level 3) is completed, the matching processing device 10 records that the matching code column remains with the initial value “0”. Is set to a match code (referred to as a completely mismatch code) indicating that no matching character string information has been searched at any level (step S227). The complete mismatch code may be, for example, complete mismatch code = 9 * 10000 + 99 * 100 + 99 = “99999”, but may be any other character string or symbol, or the initial value “0” may be set. It may be left as it is (in this case, the complete mismatch code is “0”). As a result, for example, the databases A and B are in the state shown in FIG. 7, thereby completing the matching process.

  Note that the matching code for each record in the databases A and B may be set in the original databases A and B that are read first, or in a new database that duplicates the original databases A and B. May be set. In addition, when creating a new database by duplicating the original databases A and B, a single integrated database is created by integrating the contents of these databases A and B, and a match code is set for each record therein. May be.

  As shown in FIG. 7, at which level the matching codes set in the records of the databases A and B have common character string information regarding the character string information included in the databases A and B, respectively. (LVL value), how many records have common character string information in database A (value of A1), how many records have common character string information in database B (A value of B1), and the situation of coincidence / non-coincidence can be easily read. In addition, by processing the match code as one piece of information obtained from the calculation formula “LVL * 10000 + A1 * 100 + B1” as described above, information that can more intuitively understand the match / mismatch situation is provided. Is possible. For example, it is easy to understand that the record with the match code “10101” has a one-to-one correspondence (complete match) between the database A and the database B. For example, the record with the match code “20102” That is, in database A and database B, there is no record that matches at level 1, but it can be easily understood that there is one record in database A and two records in database B that match at level 2. According to the above calculation formula, the tens of the match code represents the value of LVL, the thousands and hundreds represent the value of A1, and the tens and ones represent the value of B1. The number of digits representing these values can be arbitrarily changed.

  Further, as described above, the matching code obtained from the calculation formula “LVL * 10000 + A1 * 100 + B1” represents the number of records having a plurality of common character string information in the database. However, if there are a plurality of records (two or more records) having common character string information in the database, it may be indicated that only a plurality of records exist. In this case, specifically, for example, when the above calculation formula is used, a record in which the matching code is represented as “20104” (although there is no record matching at level 1, a record matching at level 2 is 1 in database A). And 4 records in the database B), the matching code “212” (the leftmost “2” indicates the value of LVL, the middle “1” indicates that one exists in the database A) "2" on the right end indicates that a plurality (two or more) exist in the database B). Note that, according to the method of representing the match code, for example, a record in which the match code is represented as “20103” (although there is no record that matches at level 1, one record that matches at level 2 exists in database A, The same match code “212” is set for the three records in B), etc., but is there only a single record (one record) in the database? Alternatively, it is useful in that it can be easily understood whether a plurality of records (two or more records) exist.

  In addition, the matching processing apparatus 10 extracts only the records for which a specific matching code is set from the databases A and B in which the matching data is set for each record, and displays only the records on the display screen. Or a new database including only the record may be created and stored. For example, in the example of databases A and B in which a match code is set as shown in FIG. 7, when the match processing device 10 receives a user input or an output instruction of a specific match code “20102” from another device or program , As shown in FIG. 4 and the record No. in database B. A few records may be extracted and displayed with a database identifier in which each record exists. Records with the same matching code in different databases A and B are highly likely to be related to each other. Thus, by displaying them together on one display screen, the user can match / mismatch records. The situation can be easily grasped, and it is possible to improve the work efficiency when correcting the mismatched record.

  In addition, it is clear that it is possible to deal with the case where the matching process is performed in three or more databases by extending the flowcharts shown in FIGS. For example, when performing the matching process in three databases including the database C in addition to the databases A and B, the maximum value vCMAX of the records in the database C is extracted in step S201, and the variable C1 of the number of records in the database C is extracted. In step S207, a combination of records in each database can be compared without omission by executing a loop process in which records common to the databases A, B, and C can be searched in step S207 while incrementing 1 to vCMAX. It is desirable to do. The coincidence code may be shifted in accordance with the number of databases, and the coincidence code calculation formulas in the three databases can be, for example, coincidence code = LVL * 1000000 + A1 * 10000 + B1 * 100 + C1.

<Second Embodiment>
Next, a second embodiment of the matching process in the embodiment of the present invention will be described. In the first embodiment described above, a mode (first embodiment) is adopted in which the processing target level is raised when the processing target level is changed in step S225 of FIG. 2C. In the embodiment, a mode (second embodiment) for lowering the processing target level is adopted. Hereinafter, as in the first embodiment, the second embodiment will be described with reference to the flowcharts of FIGS. Note that in the second embodiment, description of the point where the same processing as in the first embodiment is performed may be omitted. Similarly to the description in the first embodiment, each record of the two databases A and B includes character string information having the hierarchical structure shown in FIG. 3 so that the present invention can be easily understood. An example will be described.

  In the first embodiment, as in the first embodiment described above, in the pre-setting process shown in FIG. 2B, the match processing device 10 stores two databases A and B stored in the storage medium 20. Read, initialize the match code field of each record contained in these databases A and B (for example, set “0” as the initial value), and set the level of the hierarchy according to the record hierarchy (steps) S101). The result of the process in step S101 is shown in FIG.

  The match processing apparatus 10 first determines an initial level to be processed, and sets this initial level as a variable LVL (representing the target level of processing) (step S103). For example, level 3 (variable LVL = 3) is set as the initial level. At this time, the user may set the final level to be processed last, together with the setting of the initial level. Further, the lowermost layer of the character string information may be automatically set as the initial level, and the uppermost layer of the character string information may be set as the final level. For example, in the example of databases A and B shown in FIG. 4, when level 3 is set as the initial level and level 1 is set as the final level, in the subsequent processing, all levels 1 to 3 are matched. Processing will be performed. Set the initial level and the final level, such as setting the initial level to level 3 and the final level to level 2, or setting the initial level to level 2 and the final level to level 1. By doing so, it is possible to set a level range for performing the matching process. In the second embodiment, since the processing target level is gradually lowered in the subsequent processing (that is, the length of the character string information to be compared is gradually increased in units of layers), the final level is higher than the initial level. It is necessary to make the level small (the final level includes lower-level character strings).

  Next, in the match code setting process shown in FIG. 2C, the match processing device 10 calculates the number of records including the same character string information from the final level to the target level in each of the databases A and B, and the number of records The maximum value is extracted (step S201). For example, when level 3 (variable LVL = 3) is set as the processing target level, in the example of database A shown in FIG. 4, records containing the same character string information at the processing target level (level 3) Record No. 1 to 6 records (number of identical records = 6), that is, the maximum number of records is 6. Similarly, in the example of the database B shown in FIG. 4, records including the same character string information at the processing target level (level 3) are record Nos. 1 to 4 records (number of identical records = 4), record No. 6 and 7 records (number of identical records = 2), record No. There are 8 and 9 records (the same number of records = 2), and the maximum number of records is 4. The maximum number of records in database A is set to the value vAMAX, and the maximum value of records in database B is set to the value vBMAX. These values vAMAX and vBMAX are used as the number of loops of loop processing described later. In the loop processing described later, the processing is appropriately performed even when the number of loops is the total number of records in the respective databases A and B. However, the maximum value of the number of records is previously set to the value vAMAX and By setting as vBMAX, it is possible to reduce the number of loop processes and the processing time.

  As described above, when the setting of the maximum value (the loop count values vAMAX and vBMAX) of each of the initial level and the final level, and the databases A and B is completed, the matching processing device 10 It is possible to perform record matching processing. For example, the matching processing apparatus 10 first sets the number of identical records (variable A1) in the database A to 1 (step S203) and sets the number of identical records (variable B1) in the database B to 1 (step S203). S205), records satisfying these conditions are extracted from each of the databases A and B, and a common record (that is, a record constituted by the same character string information) is searched (step S207). If no common record having common character string information is detected in step S207, it is determined that there is no record for which a match code is to be set (step S209), and the processes in steps S211 and S213 are performed. Not executed.

  Referring to the examples of databases A and B shown in FIG. 4, a record with the same number of records 1 included in database A is a record No. 7 and 8 records in which the number of identical records included in the database B is 1, the record No. 5 records, but these records do not have common character string information. Accordingly, there is no record for which a match code is to be set, and the processes in steps S211 and S213 are not executed.

  When the match processing device 10 finishes searching for the variables A1 = 1 and B1 = 1, it subsequently determines whether or not the variable B1 is equal to the value vBMAX (step S215), and the variable B1 does not reach the value vBMAX. In this case, the variable B1 is incremented (step S217), and the processes after step S207 are performed again. That is, the match processing device 10 executes the process of step S207 again under the conditions of step variable A1 = 1 and variable B1 = 2.

  Referring to the examples of databases A and B shown in FIG. 4, a record with the same number of records 1 included in database A is a record No. 7 and 8 records in which the number of the same records included in the database B is 2, the record No. 6 and 7 and record No. 8 and 9 records. By comparing these records, the reconciliation processing apparatus 10 records the record No. in the database A. 7 and record No. in database B. It is detected that the records 6 and 7 are common records having the common character string information “1356”. 8 record and record No. in database B. It is detected that the 8th and 9th records are common records having common character string information “1357”.

  Then, the matching processing apparatus 10 sets a matching code represented by using the values of three variables, the variable LVL, the variable A1, and the variable B1, for these records common to the databases A and B (step S211). . At this time, as in the first embodiment described above, a match code can be obtained from a calculation formula such as a match code = LVL * 10000 + A1 * 100 + B1. In the above example, since the variable LVL = 3, the variable A1 = 1, and the variable B1 = 2, the record No. 7 and 8 and record No. in database B. For records 6-9, a match code = 3 * 10000 + 1 * 100 + 2 = 30102 is set. The match code obtained in this way is written in the match code column of the corresponding record (step S213), and as a result, the record No. in the database A is recorded. 7 and 8 match code fields and record numbers in database B. “30102” is set in the matching code columns 6 to 9 (FIG. 9).

  In this way, the match processing device 10 increments the variable B1 and repeats the process of step S207 again. If it is determined in step S215 that the variable B1 has reached the value vBMAX, it is determined whether the variable A1 is equal to the value vAMAX (step S219). If the variable A1 has not reached the value vAMAX, Then, the variable A1 is incremented (step S221), and the processing after step S205 is performed again. As described above, the database in each combination of the variable A1 in the range from 1 to vAMAX and the variable B1 in the range from 1 to vBMAX at a specific processing target level by the processing in steps S203 to S221. It is searched whether or not there is a common record between A and database B. For the common record, a coincidence code is set in the coincidence code column of the record.

  By this series of processing, in the example of the databases A and B in FIG. Records 1 to 6 and record No. The matching code “30604” is set for records 1 to 4 (obtained under the condition of variable A1 = 6 and variable B1 = 4). As a result, for example, the databases A and B are in the state shown in FIG.

  When the variable A1 reaches vAMAX, the variable B1 reaches vBMAX, and processing for all the same number of records ends, the matching processing device 10 determines whether or not the processing target level (variable LVL) is equal to the final level. (Step S223) If the variable LVL has not reached the final level, the variable LVL is changed (Step S225), and the processes after Step S201 are performed again. In the second embodiment, a process for lowering the collision level is performed in step S225, that is, the collision processing apparatus 10 decreases the variable LVL by 1 in step S225 (decrement).

  In the second embodiment, unlike the first embodiment described above, the processing after step S201 executed when the variable LVL is decremented to level 2 (variable LVL = 2), Further, in the processing after step S201 executed in the state where the collision level is lowered, the collision code is set without excluding the record in which the collision code is already set in the collision code column, and the newly set collision code Then, the match code in the match code column of the corresponding record is replaced (overwriting process). As will be described later, it is also possible to leave a history of matching codes obtained at each processing target level without performing a matching code overwriting process (see FIG. 13).

  In the example of the databases A and B in FIG. 7 and record No. in database B. The matching code “20101” is set for the record No. 6 (obtained under the conditions of variable LVL = 2, variable A1 = 1, variable B1 = 1). 1 to 3 records and record Nos. 1 is set for the record 1 (obtained under the conditions of variable LVL = 2, variable A1 = 3, variable B1 = 1). 4 to 6 and record Nos. The matching code “20303” is set for 2 to 4 records (obtained under the conditions of variable LVL = 2, variable A1 = 3, variable B1 = 3). Note that the match code set by the previous process remains in the match code column of the record that has not been overwritten with the match code. As a result, for example, the databases A and B are in the state shown in FIG.

  Further, at level 1, the record No. 7 and record No. in database B. The matching code “10101” is set for the record No. 6 (obtained under the conditions of variable LVL = 1, variable A1 = 1, variable B1 = 1). Records 5 and 6 and record No. 4 is set to the record No. 4 (obtained under the conditions of variable LVL = 1, variable A1 = 2, variable B1 = 1). 1 to 3 records and record Nos. The matching code “10301” is set for one record (obtained under the conditions of variable LVL = 1, variable A1 = 3, variable B1 = 1). As a result, for example, the databases A and B are in the state shown in FIG.

  When the matching process from the initial level (for example, set to level 3) to the final level (for example, set to level 1) is completed, the matching processing device 10 records that the matching code column remains with the initial value “0”. Is set to a completely inconsistent code indicating that no matching character string information has been retrieved at any level (step S227). As the complete mismatch code, as in the first embodiment described above, the complete mismatch code = 9 * 10000 + 99 * 100 + 99 = 999999 can be set. As a result, for example, the databases A and B are in the state shown in FIG. 12, thereby completing the matching process.

  Note that the matching code for each record in the databases A and B may be set in the original databases A and B that are read first, or in a new database that duplicates the original databases A and B. May be set. In addition, when creating a new database by duplicating the original databases A and B, a single integrated database is created by integrating the contents of these databases A and B, and a match code is set for each record therein. May be.

  Also, as in the first embodiment described above, in the second embodiment, the reconciliation processing device 10 also selects a specific reconciliation from the databases A and B in which reconciliation data is set for each record. It is possible to extract only a record for which a code is set and display only that record on the display screen, or newly create and save a database including only the record.

  As shown in FIG. 12, the matching code obtained in the second embodiment differs from the matching code obtained in the first embodiment described above, and there is a common character string in any hierarchical level. The number of records having common character string information in the database A, and the number of records having common character string information in the database B are accurately expressed. It is not information. However, in the above-described first embodiment, for example, the record No. On the other hand, the record “99999” is set in the record 7, while in the second embodiment, for example, the record No. It is not possible to obtain from the matching result of the first embodiment described above, for example, a matching code “30102” (that is, a record having common character string information exists at level 3) is set in the record No. 7 It is possible to grasp the status of match / mismatch. In this way, when referring to the match code obtained in the second embodiment, the user matches from a different viewpoint than when referring to the match code obtained in the first embodiment described above. / Be able to grasp the situation of disagreement.

  As can be seen by comparing FIG. 7 and FIG. 12, a record in which character string information common at the lowest level exists (that is, a record in which character string information common in level 1 exists, For the matching code (record having a value of LVL = 1), the same matching code is output in both the matching processes of the first and second embodiments described above.

  In the second embodiment, the match code obtained in the process of the match process can also be useful information for grasping the match / mismatch status. In the above description of the operation, the matching code is overwritten during the matching process. However, the history of the matching code obtained at each processing target level is left, for example, as shown in FIG. It may be displayed.

<Third Embodiment>
In the first embodiment described above, processing for increasing the processing target level (that is, processing for comparing the match / mismatch of each record while gradually shortening the length of the character string information to be compared in units of layers) is performed. On the other hand, in the second embodiment of the present invention described above, the processing for lowering the processing target level (that is, comparing the match / mismatch of each record while gradually increasing the length of the character string information to be compared in units of layers) Process).

  As described above, the operations in the first and second embodiments are different, and the matching results obtained by these operations are also different. The different match results obtained by the respective processes in the first and second embodiments described above may be either one of the match results depending on, for example, the type of information included in the database or the status of match / mismatch. In some cases, it may be more useful, and in some cases, by comparing the results of both matches, it becomes possible to more clearly grasp the cause of the mismatch.

  In the third embodiment, the matching processing apparatus 10 is configured to perform the processes in both the first and second embodiments described above. For example, both of these processes are performed in parallel. It is possible to output the matching result. As a result, for example, as shown in FIG. 14, the match processing device 10 in the third embodiment includes, for example, a match code (match code shown in FIG. 7) obtained by the above-described first embodiment, The match code (match code shown in FIG. 12) obtained by the second embodiment described above can be output in association with each record. In addition, together with the matching code obtained by both the first and second embodiments described above, the history of the matching code obtained by the second embodiment described above (see FIG. 13) may be displayed. .

  Moreover, in the matching processing apparatus 10 in the third embodiment of the present invention, for example, based on an instruction from the operation input unit 30 by a user, the processing in the first and second embodiments described above can be switched. Also good.

<Example>
The match processing apparatus 10 according to the present invention can find a difference between two databases. Such differences include, for example, typographical errors contained in one of the two databases that should have the same information, reading errors due to OCR (Optical Character Recognition), database administrators, and data update timing. This is caused by the difference.

  In addition, the character string information having a hierarchical structure included in each record of the database to be processed by the matching processing apparatus 10 according to the present invention may be configured by only numbers, or kanji, kana, for example. , Alphabets, symbols, and the like. Furthermore, in the present invention, it is assumed that the character string information has a hierarchical structure, but this hierarchical structure may be a structure that is hierarchically set from the beginning, such as address information, or A hierarchical structure uniquely set for the character string information by the user of the matching processing apparatus 10 may be used.

  In addition, the type of database to be processed by the matching processing apparatus 10 according to the present invention is not particularly limited. For example, a database containing address information, a database containing network address information and domain information, a database containing personal information such as My Number, a database containing customer management information, a database containing financial accounting information, a database containing product inventory information, etc. It is possible to process various types of databases such as

  In the following, a ledger database including address information and a map database including address information associated with image information representing a map or the like are prepared, and are actually matched by the matching processing device 10 according to the first embodiment of the present invention. An example in which processing is performed will be described.

  In the ledger database and map database prepared in this embodiment, address information in the same region is stored in the same storage format. However, the managers and update times of the respective databases are different, and the records in the mutual databases do not completely match. In addition, the number of records may be different as a result of adding or deleting records in each database.

  Each record stores address information having a hierarchical structure as character string information. The character string information is an array of 20-digit numbers. The first 3 digits are municipalities, the next 5 digits are large, the next 4 digits are small, the next 5 digits are lot numbers, and the last 3 digits are branch numbers. It corresponds to each. For example, in the character string information “20600405007700035002”, the first “206” is a municipality, the next “00405” is a large character, the next “0077” is a small character, the next “00035” is a lot number, and the last “002” is a branch number. Represents. In the matching process in this embodiment, based on the hierarchical structure of the address information, level 1 “municipalities, large letters, small letters, lot numbers, branch numbers”, level 2 “municipalities, large letters, small letters, lot numbers”, level 3 “municipalities” , Large letters, small letters ”, level 4“ municipalities, large letters ”and level 5“ municipalities ”.

  The result of actually performing the butt treatment under the above conditions by the butt treatment apparatus 10 in the first embodiment of the present invention is shown in FIGS. FIGS. 15 to 21 show a state in which only records in which a matching code designated by the user is set are extracted from the ledger database and the map database and displayed on the display screen in a table format. These display states correspond to the display state of FIG. 8 described above.

  The value “1” of the field “FLG” in FIGS. 15 to 21 represents a record in the ledger database, and the value “2” represents a record in the map database. The field “KEY1” in FIGS. 15 to 21 includes character string information (address information) of each record, and the field “CODE” includes a match code.

  FIG. 15 illustrates a state in which a record in which the matching code “10101” is set is extracted and displayed on the display screen. For example, the first and second records in the table of FIG. 15 are records including character string information “206000210000003560001” in the ledger database and the map database. As indicated by the matching code “10101”, one record including this character string information exists in each of the ledger database and the map database.

  FIG. 16 shows a state in which a record in which the matching code “10201” is set is extracted and displayed on the display screen. For example, the first to third records in the table of FIG. 16 are records including character string information “20600023000005402000” in the ledger database and the map database. As indicated by the matching code “10201”, there are two records including the character string information in the ledger database and one record in the map database.

  FIG. 17 illustrates a state in which a record in which the matching code “11001” is set is extracted and displayed on the display screen. For example, the 1st to 11th records in the table of FIG. 17 are records including character string information “2060040405007700035002” in the ledger database and the map database. As indicated by the match code “11001”, there are ten records including this character string information in the ledger database and one record in the map database.

  FIG. 18 illustrates a state in which a record in which the matching code “20101” is set is extracted and displayed on the display screen. For example, the first record in the table of FIG. 18 is a record including character string information “20600021000000232000” in the ledger database, and the second record is a record including character string information “20600021000000232001” in the map database. As shown in the matching code “20101”, there is no record containing each character string information in the other database, but a record containing common character string information “20600021000000232” in the level 2 is stored in the ledger database and the map database. There is one each.

  FIG. 19 shows a state in which a record in which the matching code “20201” is set is extracted and displayed on the display screen. For example, the first and second records in the table of FIG. 19 are records including character string information “20600103000200066000” in the ledger database, and the third record is a record including character string information “20600103000200066001” in the map database. As shown in the matching code “20201”, there is no record including the respective character string information in the other database, but two records including the common character string information “20600103000200066” in the level 2 are stored in the ledger database. One exists in the map database.

  FIG. 20 illustrates a state in which a record in which the matching code “20404” is set is extracted and displayed on the display screen. For example, the first to fourth records in the table of FIG. 20 are records including character string information “20600318000100018000” in the ledger database, the fifth record is a record including character string information “20600318000100080008” in the map database, and the sixth record. The record is a record including character string information “20600318000100018014” in the map database, the seventh record is a record including character string information “20600318000100018015” in the map database, and the eighth record is character string information “20600318000100018016” in the map database. Is a record that contains As shown in the matching code “20404”, there is no record including the respective character string information in the other database, but a record including the common character string information “20600318000100018” in the level 2 is stored in the ledger database and the map database. There are four each.

  FIG. 21 shows a state in which a record in which the matching code “21002” is set is extracted and displayed on the display screen. For example, the 1st to 10th records in the table of FIG. 21 are records including character string information “20600701018100051000” in the ledger database, the 11th record is a record including character string information “20600701018100051001” in the map database, and the 12th record. The record is a record including character string information “20600701018100051002” in the map database. As shown in the matching code “21002”, there are no records including the respective character string information on the other database, but 10 records including the common character string information “20600701018100051” in the level 2 are stored in the ledger database. There are two in the map database.

  Note that the matching code obtained by the operation according to the present invention may be displayed not only in a table as shown in FIGS. 15 to 21 but also in various other modes. For example, in the embodiment described above, the address information in the map database is associated with image information representing a map and the like, and the map is displayed on the display screen of the display unit 40 and the matching code is overlaid on the corresponding position on the map. It is also possible to display them together, or to display the points corresponding to the records that do not match, the levels that do not match, etc., in different colors on the map.

  In addition, the tables shown in FIGS. 15 to 21 include a feature that facilitates the comparison of records by the user when displaying the matching result obtained by the matching process. Hereinafter, characteristics for improving the visibility and convenience of the user in the table displaying the result of the matching process will be described. FIG. 22 illustrates characteristics included in an example of a table for displaying a matching result obtained by the matching process and records in the database in the first to third embodiments of the present invention. FIG. In FIG. 22, a part of the table (table shown in FIG. 18) extracted from the record in which the matching code “20201” is set and displayed on the display screen (the sixth record from the top) is extracted, In the table, features for improving the visibility and convenience of the user are highlighted.

  In FIG. 22, the first to sixth records (hereinafter referred to as the first to sixth records in order from the top) of the table (table of FIG. 19) from which the matching code “20201” is extracted are extracted. In the table of FIG. 22, a record is arranged in each row, and a field describing information included in the record is arranged in each column. The fields are “FLG”, “KEY1”, “DCHIBAN1”, “DCHIBAN2”, “CODE”, “MCHIBAN1”, and “MCHIBAN2” in order from the left.

  In the “FLG” field, information indicating whether the record is included in the ledger database or the map database is displayed. The value “1” represents the ledger database, and the value “2” represents the map database. In the “KEY1” field, the character string information of the record is displayed. In the “DCHIBAN1” and “DCHIBAN2” fields, if the record is included in the ledger database, the location number (number from the last 8 digits to the last 4 digits) and branch number (from the last 3 digits to the bottom) of the character string information, respectively. (Up to one digit). Similarly, in the “MCHIBAN1” and “MCHIBAN2” fields, when the record is included in the map database, the lot number (5-digit number from the last 8 digits to the last 4 digits) and the branch number of the character string information, respectively. (3 digits from the last 3 digits to the last 1 digit) is displayed. In the “CODE” field, a match code obtained by the match process according to the present invention is displayed.

  Among the first to sixth records shown in FIG. 22, the first to third records include character string information “20600103000200066” common at level 2, and the first and second records are the lowest layers of the character string information. (Lot number) is “000”, and “001” in the third record. Further, the fourth to sixth records include character string information “20600103000200081” common in level 2, the lowermost layer (number) of the character string information is “000” in the fourth record, and “001” in the fifth record. In the sixth record, it is “002”. The first, second, fifth and sixth records are records in the ledger database, and the third and fourth records are records in the map database.

  As described above, the lot number of the character string information is a five-digit number, but the number “0” is omitted in the display of the table of FIG. 22 (and the table of FIG. 19 based on FIG. 22). For example, the character string information “00066” indicating the lot number of the first record is displayed as “66” in the “DCHIBAN1” field of the first record. Further, when the character string information representing the branch number is “000”, the display itself is omitted in the table of FIG. 19, but in the table of FIG. 22, “(0)” is displayed at the corresponding position for the sake of explanation. Has been inserted.

  The table of FIG. 22 has a feature that sort display is performed based on the “KEY1” field. Due to this feature, records having common character string information are displayed in adjacent rows, and the visibility of the user when comparing records having common character string information can be improved. For example, in the case of the matching code “20201”, two records in the ledger database and one record in the map database are combined into one, but as a result, the records in the ledger database (“FLG” ”=“ 1 ”) and records in the map database (“ FLG ”=“ 2 ”) are nested and displayed.

  Further, the table of FIG. 22 has a feature that character string information in each record of two compared databases (the ledger database and the map database) is displayed in different fields. Specifically, the lot number and branch number of each record are displayed in “DCHIBAN1” and “DCHIBAN2” if the record is a record in the ledger database, and “MCHIBAN1” if it is a record in the map database. "And" MCHIBAN2 ". In this way, by separating the field for displaying the character string information included in the record of the ledger database and the field for displaying the character string information included in the record of the map database, the user can make each record be in the ledger database and It is possible to immediately determine which map database contains it.

  In addition, as a result of the matching process according to the present invention, a record corresponding to the database A and the database B on a one-to-one basis (that is, a record in which the matching code “10101” is set in the above example) is obtained. Even in some cases, the result of the match may not always be correct. Therefore, regarding the record determined to correspond one-to-one in this way, it may be possible to quantitatively verify whether or not the matching result is correct.

  When checking reconciliation results for records that are determined to correspond one-to-one, for example, use common items included in each record of the two compared databases (the ledger database and the map database) Is possible. Hereinafter, a description will be given with reference to FIGS.

  In FIG. 23, the first to sixth records (hereinafter referred to as the first to sixth records in order from the top) of the table (table of FIG. 15) from which the matching code “10101” is extracted are extracted. However, the “area” field included in each record is set in the table of FIG. This “Area” field is set in each record in the ledger database and the map database, and the “Area” field stores the area of the land (map area) related to the address information stored in each record. Has been. If the records correspond to each other in the ledger database and the map database, the numerical value (land area) in the “area” field, which is a common item, should be equal. Using this relationship, the records in the ledger database and map database that are determined to correspond one-to-one are further compared with the numerical values in the “area” field. It is possible to verify the match result by judging that the match result of pair 1 is correct.

  When determining whether the information included in the common item is equal, for example, if the difference in numerical values falls within a predetermined range (for example, several percent), the information included in the common item is substantially (That is, the one-to-one matching result is correct). This predetermined range can be freely set by the user.

  Of the first to sixth records shown in FIG. 23, the first and second records include character string information “206000210000003560001” common at level 1, and the third and fourth records are characters common to level 1. Column information “20600021000000356002” is included, and the fifth and sixth records include character string information “20600021000000356003” common to level 1. The first, third and sixth records are records in the ledger database, and the second, fourth and fifth records are records in the map database. In the table of FIG. 23, records having common character string information at level 1 are displayed in adjacent rows. Note that the table of FIG. 23 is a result of sorting display based on the “KEY1” field.

  As described above, the “area” field of each record is displayed in the table of FIG. For example, the first and second records are records that are determined to correspond one-to-one in the reconciliation process, but both the “area” field of the first record and the “area” field of the second record are both Since “946” is equal, it can be determined that the matching result that the first and second records correspond one-to-one is correct. The numerical value of the “area” field of the third record is “1470”, the numerical value of the “area” field of the fourth record is “1452”, and both numerical values are substantially equal. It can be determined that the match result that one-to-one correspondence is correct is correct. In addition, the numerical value of the “area” field of the fifth record is “1603”, the numerical value of the “area” field of the sixth record is “810”, and both numerical values are greatly different. It can be determined that the matching result corresponding to the one-to-one correspondence is an error.

  In the above description, for example, it is determined that the numeric value “1470” in the “area” field of the third record is substantially equal to the numeric value “1452” in the “area” field of the fourth record. Depends on freely set criteria. For example, if the difference between both numbers (here, “18”) is within 5 percent of either number or the average of both numbers, The matching result that the third and fourth records correspond one-to-one is determined to be correct. On the other hand, for example, if the difference between both values (here, “18”) is within one percent of the average value of either value or both values, it is determined that both values are substantially equal. Is determined to be erroneous if the matching result that the third and fourth records correspond one-to-one.

  Note that the above-described verification may be performed on the record determined to correspond one-to-one, and the verification result may be set in each record. For example, it is possible to set a flag for a record that is determined to have an incorrect match result that corresponds to a one-to-one correspondence, or to highlight the record by changing the color of the record when displayed in a table. is there.

  Further, as shown in FIG. 24, a scatter diagram in which the numerical values of the “area” field are plotted may be created so that the user can visually determine whether or not the matching result is correct. In FIG. 24, a large number of points are plotted in which the numerical values in the “area” field of two records determined to correspond one-to-one are the X coordinate and the Y coordinate. Specifically, one plotted point represents a set of records (two records) determined to correspond one-to-one, and the “area” of the records in the ledger database. Points are plotted in the scatter plot with the field value as the X coordinate and the "area" field value of the record in the map database as the Y coordinate.

  If the numbers in the “Area” fields of two records determined to correspond one-to-one are approximately equal, the plotted point is placed on or near the line Y = X. The Therefore, a point plotted at a position far away from the Y = X straight line can be regarded as representing an incorrect match result.

  In the scatter diagram as shown in FIG. 24, for example, a straight line indicating the determination criterion set by the user may be displayed, and the color of the point at which the determination result is determined to be incorrect beyond the determination criterion. It may be changed and highlighted.

  In the above example, the case where the “area” field is used as an item common to the record in the ledger database and the record in the map database has been described. However, the common setting is set in the records in a plurality of databases to be compared. Other items may be used as long as they are items. In the example of the ledger database and map database, in addition to the area of the land, various items such as the crops cultivated on the land, the land indicating the use of the land, the perimeter of the land, etc. It is possible to use. In addition, although an example of the ledger database and the map database is described here, the common items set in the records in the database to be compared are appropriately selected similarly in any other type of data database. Is possible.

  The present invention is applicable to a technique for performing a matching process for a plurality of databases each storing a plurality of records. Further, the present invention can target a database in which any type of data is stored, and can be applied to all database management techniques.

DESCRIPTION OF SYMBOLS 10 Matching processing apparatus 11 Database reading part 12 Matching processing part 13 Record comparison part 14 Matching result production | generation part 15 Matching result output part 20 Storage medium 30 Operation input part 40 Display part

Claims (11)

A match processing device that performs a match process of a plurality of databases each storing a plurality of records including character string information having a hierarchical structure,
The character string information included in the record in the first database of the plurality of databases and the character string information included in the record in the second database of the plurality of databases are compared with each other. A record comparison unit for detecting information match or mismatch;
If a record including character string information common in a predetermined range from a predetermined upper layer to a predetermined lower layer of the hierarchical structure exists in both the first and second databases, the common character in the predetermined range Information based on the number of records in the first database including column information, information based on the number of records in the second database including character string information common to the predetermined range, and characters common to the predetermined range A match result generating unit that associates information indicating that column information is included with each of the records in the first and second databases including common character string information in the predetermined range;
A butt processing device.   The record comparison unit first compares the character string information included in the records in the first and second databases within the predetermined range, and then compares the character string information with the hierarchical structure. The matching processing apparatus according to claim 1, wherein the character string information is compared while being gradually reduced from the predetermined range in units of layers.   When the record including common character string information in a range narrower than the predetermined range exists in both the first and second databases, the matching result generation unit is common in the range narrower than the predetermined range. Information based on the number of records in the first database including character string information, information based on the number of records in the second database including common character string information in a range narrower than the predetermined range, and the predetermined range Information indicating that common character string information is included in a narrower range is associated with each of the records in the first and second databases including common character string information in a narrower range than the predetermined range. The butt processing apparatus according to claim 2.   4. The record comparison unit is configured to exclude a record in which a match between the character string information has already been detected among the records in the first and second databases from a comparison target. 2. The butt-treatment device described in 1.   The record comparison unit first compares character string information included in the records in the first and second databases in a range narrower than the predetermined range, and then compares the character string information with a range. The match processing apparatus according to claim 1, wherein the character string information is compared while expanding stepwise up to the predetermined range in units of the hierarchical structure.   When the record including common character string information in a range narrower than the predetermined range exists in both the first and second databases, the matching result generation unit is common in the range narrower than the predetermined range. Information based on the number of records in the first database including character string information, information based on the number of records in the second database including common character string information in a range narrower than the predetermined range, and the predetermined range Information indicating that common character string information is included in a narrower range is associated with each of the records in the first and second databases including common character string information in a narrower range than the predetermined range. The butt processing apparatus according to claim 5.   The match result generation unit includes information based on the number of records in the first database including character string information common to the predetermined range, and records in the second database including character string information common to the predetermined range. 7. The match according to claim 1, wherein the code information is generated by integrating information based on a number and information indicating that common character string information is included in the predetermined range. Processing equipment.   As information based on the number of records in the first and second databases, information indicating whether the number of records in the first and second databases themselves or the number of records in the first and second databases is singular or plural. The butt processing apparatus according to claim 1, wherein:   The matching processing apparatus according to claim 1, wherein the character string information having the hierarchical structure is address information. A matching process method for performing a matching process of a plurality of databases each storing a plurality of records including character string information having a hierarchical structure,
The character string information included in the record in the first database of the plurality of databases and the character string information included in the record in the second database of the plurality of databases are compared with each other. A record comparison step for detecting information match or mismatch;
If a record including character string information common in a predetermined range from a predetermined upper layer to a predetermined lower layer of the hierarchical structure exists in both the first and second databases, the common character in the predetermined range Information based on the number of records in the first database including column information, information based on the number of records in the second database including character string information common to the predetermined range, and characters common to the predetermined range A matching result generating step for associating information indicating that column information is included with each of the records in the first and second databases including common character string information in the predetermined range;
A matching process method. A match processing program for causing a computer to execute a match processing method for performing a match processing of a plurality of databases each storing a plurality of records including character string information having a hierarchical structure,
The character string information included in the record in the first database of the plurality of databases and the character string information included in the record in the second database of the plurality of databases are compared with each other. A record comparison step for detecting information match or mismatch;
If a record including character string information common in a predetermined range from a predetermined upper layer to a predetermined lower layer of the hierarchical structure exists in both the first and second databases, the common character in the predetermined range Information based on the number of records in the first database including column information, information based on the number of records in the second database including character string information common to the predetermined range, and characters common to the predetermined range A matching result generating step for associating information indicating that column information is included with each of the records in the first and second databases including common character string information in the predetermined range;
A matching processing program for causing a computer to execute a matching processing method.