JP2012128760A - Information processing apparatus, information processing method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To accurately reflect data of one DB on the other DB when data coordination is carried out between the two DBs and a coordination key of one DB is changed.SOLUTION: In a correspondence table 108, a set of similar coefficients of each column is defined for each element of a character string of a coordination key. When a character string partially matching a character string in a coordination key of a coordination destination DB 20 is extracted from a coordination key of a coordination source DB 10 as a result of retrieval by a retrieval part 102, a comparison part 103 extracts a set of similar coefficients corresponding to matching elements in both the character strings from the correspondence table 108, determines matching between records of the coordination source DB 10 and records of the coordination destination DB 20, column by column, determines similarities between records of the coordination source DB 10 and records of the coordination destination DB 20 by applying similar coefficients to matching columns, and accurately reflects the contents of the coordination source DB 10 on the coordination destination DB 20 based upon the similarities.

Description

  The present invention relates to a database cooperation technique for reflecting the contents of a cooperation source database in a cooperation destination database.

  For example, in the conventional data linkage method disclosed in Patent Document 1, in two databases, the linkage items of the tables of the two databases are determined based on the respective primary keys, and linkage between records is performed.

Japanese Patent Laid-Open No. 2004-86782

Conventionally, when database linkage is performed between different databases, a linkage key is determined in order to identify linkage source data. However, the main key of the linkage source table is generally used as the linkage key.
This primary key is unique and is rarely changed.
However, if the number assigned in the business was used as the primary key when designing the database, the value of the primary key of the database will be changed by changing the number by changing or expanding the business itself. There is a case.
In the conventional data linkage method, data linkage is performed using the primary key information of the linkage source database as a linkage key. If the primary key of one database is changed, the linkage relationship between records in the database is unknown. There is a problem that it becomes impossible to cooperate.

  One of the main objects of the present invention is to solve the above-mentioned problems. When data linkage is performed between two databases, the linkage key is changed in one database. However, the main purpose is to accurately reflect the data of one database in the other database.

An information processing apparatus according to the present invention includes:
A column that communicates with a first database that uses a column whose field value is a character string divided into a plurality of element blocks as a linkage key, and that is in a correspondence relationship with the column of the linkage key of the first database, A communication unit that communicates with a second database that uses a column having a field value as a character string divided into a plurality of element blocks, and a linkage key;
A column pair information storage unit for storing column pair information indicating, as a column pair, a set of columns having a correspondence relationship between a plurality of columns included in the first database and a plurality of columns included in the second database; ,
Information for associating a coefficient value set, which is a set of coefficient values defined for each column pair, with an element block of a character string, and coefficient value information for which the coefficient value pattern of the coefficient value set is different for each element block A coefficient value information storage unit for storing;
The predetermined character string included in the cooperation key of the second database is acquired as the second cooperation candidate character string through the communication unit, and the acquired second cooperation candidate character string and the content in at least one of the element blocks A search unit that extracts a character string with a matching from the cooperation key of the first database via the communication unit;
The search unit extracts the character string whose contents match in the second cooperative candidate character string and some of the element blocks without extracting the character string whose contents match in the second cooperative candidate character string in all the element blocks. If it is determined, an element block whose contents match in the extracted first cooperation candidate character string and the second cooperation candidate character string is identified as a matching element block, and is associated with the identified matching element block A matching element block specifying unit for acquiring a set of coefficient values from the coefficient value information;
Based on the column pair information, for each column pair, the field value in the first cooperation candidate record that includes the first cooperation candidate character string and the second cooperation candidate record that includes the second cooperation candidate character string. Field values are extracted, and whether or not the extracted field values match is determined. The determination result of the match determination for each column pair and the coefficient value set acquired by the matching element block specifying unit for each column pair. A record determination unit that determines the similarity between the first cooperation candidate record and the second cooperation candidate record based on the numerical value, and determines whether or not to reflect the field value of the first cooperation candidate record in the second cooperation candidate record It is characterized by having.

According to the present invention, when a character string partially matching the character string in the cooperation key of the second database is extracted from the cooperation key of the first database, the two character strings match. Corresponding to the element block, the similarity between the record in the first database and the record in the second database is determined.
Thereby, even when there is a partial change in the linkage key of the first database, the relationship between the record of the first database and the record of the second database can be recovered corresponding to the changed part. And the contents of the first database can be accurately reflected in the second database.

FIG. 3 is a diagram illustrating a configuration example of a data linkage apparatus according to the first embodiment. FIG. 4 is a diagram showing an example of a correspondence table according to the first embodiment. The figure which shows the example of the cooperation origin database which concerns on Embodiment 1. FIG. The figure which shows the example of the cooperation destination database which concerns on Embodiment 1. FIG. FIG. 3 is a diagram showing an example of a management number system according to the first embodiment. FIG. 3 is a flowchart showing an operation example of the data linkage apparatus according to the first embodiment. FIG. 4 is a diagram illustrating a hardware configuration example of a data linkage apparatus according to a second embodiment.

Embodiment 1 FIG.
In this embodiment, in the system that manages the equipment installed in the property, when data is linked between two different databases, and the item that becomes the linkage key is changed in the database of the linkage source, A data linkage apparatus for recovering the association with an item that is a key for linkage in the other database will be described.

FIG. 1 is a configuration diagram of a data linkage apparatus 100 according to the present embodiment.
The data linkage apparatus 100 is connected to the linkage source database 10 and the linkage destination database 20.
The data linkage apparatus 100 is an example of an information processing apparatus.
The collaboration source database 10 is a database that provides data when performing data collaboration.
The cooperation destination database 20 is a database in which data is reflected when data cooperation is performed.
The cooperation source database 10 is an example of a first database.
The cooperation destination database 20 is an example of a second database.
In the following, the cooperation source database 10 is also referred to as the cooperation source DB 10, and the cooperation destination database 20 is also referred to as the cooperation destination DB 20.

In FIG. 1, the data linkage apparatus 100 includes a communication unit 101, a search unit 102, a comparison unit 103, an update unit 104, a storage unit 105, an input / output unit 106, and a correspondence table 108 stored in the storage unit 105. .
The communication unit 101 communicates with the cooperation source database 10 and the cooperation destination database 20.
The search unit 102 searches for data from the cooperation source database 10 and the cooperation destination database 20 via the communication unit 101 and sends the data to the comparison unit 103.
The comparison unit 103 collates the data sent from the search unit 102.
The update unit 104 updates data in the cooperation destination database 20.
The storage unit 105 stores a correspondence table 108.
The input / output unit 106 displays an operation screen for the database administrator (user of the data linkage apparatus 100), and inputs a value selected by the database administrator.
Although details of each element of the data linkage apparatus 100 will be described later, the comparison unit 103 is an example of a matching element block specifying unit and a record determination unit, and the input / output unit 106 is an example of a user interface unit.
The correspondence table 108 is an example of column pair information and coefficient value information, and the storage unit 105 is an example of a column pair information storage unit and coefficient value information storage unit.

FIG. 2 shows the contents of the correspondence table 108, which describes the correspondence of columns that perform data linkage between the linkage source DB 10 and the linkage destination DB 20.
FIG. 3 shows the contents of the cooperation source DB 10.
FIG. 4 shows the contents of the cooperation destination DB 20.
FIG. 5 shows the system of the management number 200.
The management number 200 is assigned to each property to be managed and consists of 10 digits.
The management number 200 is divided into a plurality of element blocks.
That is, in the management number 200, the top three digits (XXX) are the management branch number 201 representing the management branch, the following four digits (YYYY) are the customer number 202 representing the customer, and the last three digits (zzz) are within the customer. It is comprised from the serial number 203 in a customer which shows the serial number.
The linkage source DB 10 and the linkage destination DB 20 are linked by a linkage key 500 (that is, the management number 200). However, the management branch number 201, the customer number 202, and the customer serial number 203 are numbers assigned for business reasons, respectively. If the management branch that manages the property in the business is divided and integrated, or the owner of the property is changed, the property is added, or demolished, the management branch number 201, the customer number 202, The customer serial number 203 is changed / deleted, and the management number 200 is also changed / deleted at the same time.
As described above, the cooperation source DB 10 and the cooperation destination DB 20 use a column (management number 200) whose field value is a character string divided into a plurality of element blocks as a cooperation key, and each character string included in the cooperation key. The contents of the element block have the property of being converted by changing, expanding, reducing, etc. the work.

In the correspondence table 108, as shown in the record on the first row and the record on the second row, the correspondence relationship between the plurality of columns included in the cooperation source DB 10 and the plurality of columns included in the cooperation destination DB 20 is shown. Contains information indicating the set of columns in
A pair of columns in correspondence is also referred to as a column pair.
The information on the first and second records in the correspondence table 108 is an example of column pair information.
In addition, the correspondence table 108 includes information indicating similarity coefficients, as shown in the third and fourth row records.
The record in the third row is information indicating a set of coefficient values when the upper three digits (xxx) match between the management number 200 of the cooperation source DB 10 and the management number 200 of the cooperation destination DB 20.
The record on the fourth line is information indicating a set of coefficient values when the middle 4 digits (YYYY) match between the management number 200 of the cooperation source DB 10 and the management number 200 of the cooperation destination DB 20.
A set of similar coefficients for each column is also referred to as a coefficient value set.
In the coefficient value set of the third row record and the coefficient value set of the fourth row record, the pattern of the similar coefficient for each column is different.
The information of the record in the third row and the record in the fourth row of the correspondence table 108 is an example of coefficient value information.

Next, the operation will be described.
FIG. 6 shows an operation example when the data linkage apparatus 100 according to the first embodiment processes one record of the linkage destination DB 20.

  First, the operation of the data cooperation apparatus 100 when the management number 200 that is the cooperation key 500 is the same in the cooperation source DB 10 and the cooperation destination DB 20 is shown.

First, the search unit 102 of the data linkage apparatus 100 searches for a predetermined character string in the management number 200 column in the linkage destination DB 20 via the communication unit 101, and acquires a record of the searched character string (S601). .
Next, the search unit 102 searches the management number 200 column of the cooperation source DB 10 for a character string that matches the character string searched in S601 via the communication unit 101 (S602).
As a result of the search, when a character string that completely matches (matches in all the digits of XXXXYYYYZZZ) is extracted in the management number 200 column of the linkage source DB 10 (YES in S603), the field value of each column in the record is updated. The unit 104 copies from the cooperation source DB 10 to the cooperation destination DB 20 (S604).
That is, the update unit 104 reflects the field values of the cooperation source DB 10 in the corresponding fields of the cooperation destination DB 20 for the cooperation items 501 to 506 described in the correspondence table 108.

  Next, the operation of the data linkage apparatus 100 when the management number 200 has been changed and the management number 200 that is the linkage key 500 does not match between the linkage source DB 10 and the linkage destination DB 20 will be described.

First, the search unit 102 of the data cooperation device 100 communicates with the cooperation destination DB 20 via the communication unit 101 (communication step), and a predetermined character string (second cooperation candidate character string) in the management number 200 column in the cooperation destination DB 20. Example) is acquired, and a record of the searched character string is acquired (S601) (search step).
Next, the search unit 102 communicates with the cooperation source DB 10 via the communication unit 101 (communication step), and searches for a character string that matches the character string searched in S601 in the management number 200 column of the cooperation source DB 10 ( S602) (search step).
As a result of the search, when a character string that completely matches (matches in all the digits of XXXXYYYYZZZ) is not found in the management number 200 column of the cooperation source DB 10 (NO in S603), the search unit 102 selects all records in the cooperation source DB 10. A search is performed on (search step).
That is, the search unit 102 acquires the records of the cooperation source DB 10 in order (S605).
As a result of the search, a character string (an example of the first cooperation candidate character string) that matches the character string in the cooperation destination DB 20 searched in S601 within the management number 200 column of the cooperation source DB 10 in some element blocks. When extracted, a matching element block (matching element block) is specified, and a similarity coefficient corresponding to the matching element block is acquired (matching element block specifying step).

When the matching element block is the management branch number 201 portion of the management number 200 (YES in S606), the comparison unit 103 reads the similarity coefficient 301 (record on the third row) from the correspondence table 108 (S607) ( Coefficient value information reading step).
If the management branch number 201 matches, it is highly likely that the property owner has changed in the same management branch.
When the owner of the property is changed, the information regarding the address and the postal code is unlikely to be changed, but the information related to the name and the contact telephone number is likely to be changed at the same time.
For this reason, since the similarity coefficient 301 of the correspondence table 108 is set to a low coefficient related to the name and telephone number, even if these are changed, the effect is low.
The comparison unit 103 reads the first row and the second row of the correspondence table 108 (column pair information reading step), and records in the cooperation source DB 10 in which the management branch number 201 part matches (the first cooperation candidate record). For example, for each column pair of the linkage items 501 to 506 described in the first and second rows of the correspondence table 108 between the records acquired from the linkage destination DB 20 in S601 (example of second linkage candidate records). It is compared whether the field values match, and the similarity is calculated by adding the similarity coefficient (similarity coefficient 301) of the column pair that matches the field value (S609) (record determination step).

On the other hand, if the management branch number 201 portion of the management number 200 does not match and the matching element block is the customer number 202 portion (NO in S606), the comparison unit 103 uses the similarity coefficient 302 ( The record on the fourth line) is read (S608) (coefficient value information reading step).
In this case, the owner of the property is unchanged, and the management branch is likely to be changed. For this reason, there is a high possibility that the cooperation items 501 to 506 are not changed.
Therefore, the similarity coefficient 302 has all the coefficient values of the linkage items 501 to 506 being 1.0.
The comparison unit 103 reads the first row and the second row of the correspondence table 108 (column pair information reading step) and records in the cooperation source DB 10 in which the customer number 202 part matches (example of first cooperation candidate record) ) And the record acquired from the cooperation destination DB 20 in S601 (example of second cooperation candidate record) for each column pair of the cooperation items 501 to 506 described in the first and second lines of the correspondence table 108. A comparison is made as to whether or not the values match, and the similarity coefficient (similarity coefficient 302) of the column pair with the matching field value is added to calculate the similarity (S609) (record determination step).

Next, the comparison unit 103 determines whether or not the similarity calculated in S609 is greater than the maximum similarity (to be referred to as the maximum similarity hereinafter) stored in a predetermined storage area (hereinafter, referred to as “maximum similarity”). S610) (record determination step).
When the similarity calculated in S609 is larger than the maximum similarity, the maximum similarity is rewritten with the similarity calculated in S609, the maximum similarity is updated, and further, the new maximum similarity calculated A record of the original DB 10 is stored in a predetermined storage area (S611) (record determination step).

When the processing of S605 to S611 is performed on all records of the collaboration source DB 10, and the processing for all records of the collaboration source DB 10 is completed (YES in S612), the comparison unit 103 determines that the maximum similarity is It is determined whether or not the threshold value of the minimum similarity is exceeded (S613) (record determination step).
When the maximum similarity is equal to or less than the threshold (NO in S613), the update unit 104 assumes that the record of the cooperation source DB 10 corresponding to the record of the cooperation destination DB 20 has been deleted, and the update unit 104 records the corresponding cooperation destination DB 20 (see FIG. 6 (record acquired in step S601) is deleted (record determination step).
On the other hand, when the maximum similarity exceeds the threshold value (YES in S613), the update unit 104 uses the linkage key value (management number 200) of the record of the linkage source DB 10 stored in the storage area in S611. The link key value (management number 200) of the record in the destination DB 20 (record acquired in S601 in FIG. 6) is updated (S614) (record determination step).
Further, the update unit 104 stores the field values of the columns of the records in the cooperation source DB 10 stored in the storage area in S611 (field values of the cooperation items 501 to 506 described in the correspondence table 108) in the records of the cooperation destination DB 20 ( The data is copied to the record acquired in S601 in FIG. 6 (S604) (record determination step).

  As described above, according to the present embodiment, since the similarity is calculated based on the relationship between the configuration of the cooperation key and the business content, the accuracy of recovering the cooperation can be improved even when the cooperation key is changed. There is an effect.

As described above, in the present embodiment, the data linkage apparatus including the following has been described.
The correspondence table which memorize | stores the correspondence of one cooperation key between cooperation origin DB and cooperation destination DB, other cooperation items, and a some similar score.
The records from the linkage source DB and the linkage destination DB are compared, collated with the linkage key of the correspondence table, and the item described in the linkage item of the linkage source DB of the correspondence table corresponding to the match key is matched. Comparison part to convert to the linkage item.
The comparison unit compares the cooperation items other than the cooperation keys in the correspondence table when there is no cooperation key between the cooperation source DB and the cooperation destination DB, and adds the similarity coefficient determined for each matching cooperation item to obtain the similarity. The linkage key of the linkage source DB record that maximizes the similarity is set as a new linkage key of the linkage destination DB.
The content of the similar score is determined from the linkage table according to the degree of partial matching of the linkage keys.

  In addition, as a result of comparing the cooperation items in the comparison unit and calculating the similarity, when records in one or more cooperation destination databases are below a certain threshold, the records that have been linked in the cooperation source database are deleted. Deemed, explained that deleting the records in the linked database.

In the present embodiment, the following has also been described.
The correspondence table defines a set of similarity coefficients for each column for each element of the linkage key.
As a result of the search by the search unit, when a character string partially matching the character string in the link key of the link destination DB is extracted from the link key of the link source DB, the comparison unit matches both character strings. A set of similarity coefficients corresponding to the elements is extracted from the correspondence table, and a match determination is made between the records of the linkage source DB and the linkage destination DB for each column, and the similarity coefficient is applied to the matched columns and the linkage source The similarity between the DB record and the linkage destination DB is determined, and based on the similarity, the contents of the linkage source DB are accurately reflected in the linkage destination DB.
For this reason, even if there is a partial change in the linkage key of the linkage source DB, the relationship between the record of the linkage source DB and the record of the linkage destination DB can be recovered in correspondence with the changed portion. The contents of the original DB can be accurately reflected in the cooperation destination DB.

Embodiment 2. FIG.
In the method of the first embodiment, only the record with the maximum similarity is selected (S610 and S611 in FIG. 6), and the field value in the record with the maximum similarity is copied to the cooperation destination DB 20 (S614).
On the other hand, in this embodiment, a record of the cooperation source DB 10 in which a similarity level of a certain level or higher is stored, and there is one or more records of the cooperation source DB 10 having a similarity level of a certain level or higher. In this case, the comparison unit 103 displays the corresponding record in the cooperation destination DB 20 and the record in the cooperation source DB 10 on the input / output unit 106.
The database administrator looks at the display of the input / output unit 106 to determine which record of the cooperation source DB 10 corresponds to the record of the cooperation destination DB 20, and inputs the result to the input / output unit 106.
The comparison unit 103 determines the correspondence between the cooperation key of the cooperation source DB 10 and the cooperation key of the cooperation destination DB 20 based on the content input by the database administrator.
Then, the update unit 104 copies the field value of the record in the cooperation source DB 10 determined by the comparison unit 103 to the cooperation destination DB 20.

Further, in the method of the first embodiment, when the calculated similarity is equal to or less than the minimum similarity threshold, the record of the cooperation destination DB 20 is unconditionally deleted (S613 and S615 in FIG. 6).
On the other hand, in this embodiment, when there is only a record having a similarity less than or equal to the threshold of the minimum similarity, the comparison unit 103 acquires the record in the target cooperation destination DB 20 (acquired in S601 in FIG. 6). Are displayed on the input / output unit 106.
The database administrator looks at the display and determines which record of the cooperation source DB 10 corresponding to which record of the cooperation destination DB 20 has been deleted, and determines whether or not the record of the cooperation destination DB 20 may be deleted. The result is input to the input / output unit 106.
The update unit 104 deletes the record in the cooperation destination DB 20 or performs other processing based on the content input by the database administrator.

  As described above, according to the present embodiment, it is possible to cause the administrator to determine the correspondence with the cooperation destination DB 20 for the records of the cooperation source DB 10 having the same degree of similarity, and to delete the cooperation destination DB 20 records with low similarity. By allowing the administrator to determine whether it is possible or not, it is possible to restore more accurate cooperation.

The following has been described in the present embodiment.
When the comparison unit compares the cooperation items, when records of a plurality of cooperation source databases can be candidates for a new cooperation key, the display unit displays the records.
An administrator has an input unit for selecting and inputting the optimum one from the candidates as a linkage key.
The comparison unit sets the cooperation key of the cooperation source DB record as a new cooperation key of the cooperation destination DB based on an input from the administrator.

In the present embodiment, the following has also been described.
As a result of comparing the cooperation items in the comparison unit and calculating the degree of similarity, when records in one or more cooperation destination databases are below a certain threshold, it is considered that the records linked in the cooperation source database are deleted, and the cooperation destination When database records can be candidates for deletion, a display unit for displaying those records is provided.
An administrator has an input unit for selecting and inputting records deleted from these candidates.
In the comparison unit, the cooperation destination DB performs a deletion process according to an input from the administrator.

Finally, a hardware configuration example of the data linkage apparatus 100 shown in the first and second embodiments will be described.
FIG. 7 is a diagram illustrating an example of hardware resources of the data linkage apparatus 100 described in the first and second embodiments.
Note that the configuration of FIG. 7 is merely an example of the hardware configuration of the data linkage apparatus 100, and the hardware configuration of the data linkage apparatus 100 is not limited to the configuration illustrated in FIG. Also good.

In FIG. 7, the data linkage apparatus 100 includes a CPU 911 (also referred to as a central processing unit, a central processing unit, a processing unit, a processing unit, a microprocessor, a microcomputer, and a processor) that executes a program.
The CPU 911 is connected to, for example, a ROM (Read Only Memory) 913, a RAM (Random Access Memory) 914, a communication board 915, a display device 901, a keyboard 902, a mouse 903, and a magnetic disk device 920 via a bus 912. Control hardware devices.
Further, the CPU 911 may be connected to an FDD 904 (Flexible Disk Drive), a compact disk device 905 (CDD), a printer device 906, and a scanner device 907. Further, instead of the magnetic disk device 920, a storage device such as an SSD (Solid State Drive), an optical disk device, or a memory card (registered trademark) read / write device may be used.
The RAM 914 is an example of a volatile memory. The storage media of the ROM 913, the FDD 904, the CDD 905, and the magnetic disk device 920 are an example of a nonvolatile memory. These are examples of the storage device.
The “storage unit 105” described in the first and second embodiments is realized by the RAM 914, the magnetic disk device 920, and the like.
A communication board 915, a keyboard 902, a mouse 903, a scanner device 907, an FDD 904, and the like are examples of input devices.
The communication board 915, the display device 901, the printer device 906, and the like are examples of output devices.

The communication board 915 is connected to the cooperation source DB 10 and the cooperation destination DB 20.
The communication board 915 may be connected to a LAN (Local Area Network), the Internet, a WAN (Wide Area Network), a SAN (Storage Area Network), or the like.

The magnetic disk device 920 stores an operating system 921 (OS), a window system 922, a program group 923, and a file group 924.
The programs in the program group 923 are executed by the CPU 911 using the operating system 921 and the window system 922.

The RAM 914 temporarily stores at least part of the operating system 921 program and application programs to be executed by the CPU 911.
The RAM 914 stores various data necessary for processing by the CPU 911.

The ROM 913 stores a BIOS (Basic Input Output System) program, and the magnetic disk device 920 stores a boot program.
When the data linkage apparatus 100 is activated, the BIOS program in the ROM 913 and the boot program in the magnetic disk device 920 are executed, and the operating system 921 is activated by the BIOS program and the boot program.

  The program group 923 stores programs that execute the functions described as “˜units” in the description of the first and second embodiments (other than “storage unit 105”). The program is read and executed by the CPU 911.

In the file group 924, in the description of the first and second embodiments, “determination of”, “determination of”, “search of”, “comparison of”, “reflection of”, “update of” ”,“ Setting of ”,“ registration of ”,“ selection of ”,“ summation of ”,“ input of ”,“ output of ”, etc. Data, signal values, variable values, and parameters are stored as items of “˜file” and “˜database”.
The “˜file” and “˜database” are stored in a recording medium such as a disk or a memory.
Information, data, signal values, variable values, and parameters stored in a storage medium such as a disk or memory are read out to the main memory or cache memory by the CPU 911 via a read / write circuit.
The read information, data, signal value, variable value, and parameter are used for CPU operations such as extraction, search, reference, comparison, calculation, calculation, processing, editing, output, printing, and display.
Information, data, signal values, variable values, and parameters are stored in the main memory, registers, cache memory, and buffers during the CPU operations of extraction, search, reference, comparison, calculation, processing, editing, output, printing, and display. It is temporarily stored in a memory or the like.
In addition, the arrows in the flowcharts described in the first and second embodiments mainly indicate input / output of data and signals.
Data and signal values are recorded on a recording medium such as a memory of the RAM 914, a flexible disk of the FDD 904, a compact disk of the CDD 905, a magnetic disk of the magnetic disk device 920, other optical disks, a mini disk, and a DVD.
Data and signals are transmitted online via a bus 912, signal lines, cables, or other transmission media.

In addition, what is described as “˜unit” in the description of the first and second embodiments may be “˜circuit”, “˜device”, “˜device”, and “˜step”, It may be “˜procedure” or “˜processing”.
That is, the information processing method according to the present invention can be realized by the steps, procedures, and processes shown in the flowcharts described in the first and second embodiments.
Further, what is described as “˜unit” may be realized by firmware stored in the ROM 913.
Alternatively, it may be implemented only by software, or only by hardware such as elements, devices, substrates, and wirings, by a combination of software and hardware, or by a combination of firmware.
Firmware and software are stored as programs in a recording medium such as a magnetic disk, a flexible disk, an optical disk, a compact disk, a mini disk, and a DVD.
The program is read by the CPU 911 and executed by the CPU 911.
That is, the program causes the computer to function as “to part” in the first and second embodiments. Alternatively, the computer executes the procedure and method of “to unit” in the first and second embodiments.

As described above, the data linkage apparatus 100 shown in the first and second embodiments includes a CPU as a processing device, a memory as a storage device, a magnetic disk, a keyboard as an input device, a mouse, a communication board, a display device as an output device, and a communication device. A computer including a board or the like.
Then, as described above, the functions indicated as “˜units” are realized using these processing devices, storage devices, input devices, and output devices.

  DESCRIPTION OF SYMBOLS 10 Cooperation origin DB, 20 Cooperation destination DB, 100 Data cooperation apparatus, 101 Communication part, 102 Search part, 103 Comparison part, 104 Update part, 105 Storage part, 106 Input / output part, 108 Correspondence table.

Claims (8)

A column that communicates with a first database that uses a column whose field value is a character string divided into a plurality of element blocks as a linkage key, and that is in a correspondence relationship with the column of the linkage key of the first database, A communication unit that communicates with a second database that uses a column having a field value as a character string divided into a plurality of element blocks, and a linkage key;
A column pair information storage unit for storing column pair information indicating, as a column pair, a set of columns having a correspondence relationship between a plurality of columns included in the first database and a plurality of columns included in the second database; ,
Information for associating a coefficient value set, which is a set of coefficient values defined for each column pair, with an element block of a character string, and coefficient value information for which the coefficient value pattern of the coefficient value set is different for each element block A coefficient value information storage unit for storing;
The predetermined character string included in the cooperation key of the second database is acquired as the second cooperation candidate character string through the communication unit, and the acquired second cooperation candidate character string and the content in at least one of the element blocks A search unit that extracts a character string with a matching from the cooperation key of the first database via the communication unit;
The search unit extracts the character string whose contents match in the second cooperative candidate character string and some of the element blocks without extracting the character string whose contents match in the second cooperative candidate character string in all the element blocks. If it is determined, an element block whose contents match in the extracted first cooperation candidate character string and the second cooperation candidate character string is identified as a matching element block, and is associated with the identified matching element block A matching element block specifying unit for acquiring a set of coefficient values from the coefficient value information;
Based on the column pair information, for each column pair, the field value in the first cooperation candidate record that includes the first cooperation candidate character string and the second cooperation candidate record that includes the second cooperation candidate character string. Field values are extracted, and whether or not the extracted field values match is determined. The determination result of the match determination for each column pair and the coefficient value set acquired by the matching element block specifying unit for each column pair. A record determination unit that determines the similarity between the first cooperation candidate record and the second cooperation candidate record based on the numerical value, and determines whether or not to reflect the field value of the first cooperation candidate record in the second cooperation candidate record And an information processing apparatus. The record determination unit
The coefficient values of the column pairs determined to match the field values are added together, and the similarity between the first linkage candidate record and the second linkage candidate record is determined based on the added value. Information processing device. The matching element block specifying unit includes:
When a plurality of character strings whose contents match in the second cooperation candidate character string and some of the element blocks are extracted, a matching element block is identified and identified for each extracted first cooperation candidate character string A coefficient value set associated with the matching element block is acquired from the coefficient value information,
The record determination unit
For each of the first cooperation candidate character strings, for each column pair, it is determined whether the field value of the first cooperation candidate record matches the field value of the second cooperation candidate record, and the field values match. The coefficient values of the column pairs determined as
The information processing apparatus according to claim 2, wherein the field value of the first cooperation candidate record having the maximum combined value is reflected in the second cooperation candidate record. The record determination unit
The information processing apparatus according to claim 2 or 3, wherein when there is no first cooperation candidate record whose total value exceeds a predetermined threshold, the second cooperation candidate record is deleted from the second database. . The information processing apparatus further includes:
A user interface unit serving as an interface with a user of the information processing apparatus;
The matching element block specifying unit includes:
When a plurality of character strings whose contents match in the second cooperation candidate character string and some of the element blocks are extracted, a matching element block is identified and identified for each extracted first cooperation candidate character string A coefficient value set associated with the matching element block is acquired from the coefficient value information,
The record determination unit
For each of the first cooperation candidate character strings, for each column pair, it is determined whether the field value of the first cooperation candidate record matches the field value of the second cooperation candidate record, and the field values match. The coefficient values of the column pairs determined as
When there are two or more first cooperation candidate records having a sum value equal to or higher than a predetermined level, the two or more first cooperation candidate records are output to the user via the user interface unit, and the first by the user Input the designation of the cooperation candidate record through the user interface unit,
The information processing apparatus according to claim 2, wherein the field value of the first cooperation candidate record designated by the user is reflected in the second cooperation candidate record. The information processing apparatus further includes:
A user interface unit serving as an interface with a user of the information processing apparatus;
The record determination unit
When there is no first cooperation candidate record whose total value exceeds a predetermined threshold, the user is inquired through the user interface section whether or not to delete the second cooperation candidate record,
The information processing apparatus according to claim 2, wherein when the user permits deletion of the second cooperation candidate record, the second cooperation candidate record is deleted from the second database. A computer communicates with a first database having a column whose field value is a character string divided into a plurality of element blocks and has a correspondence relationship with a column of the linkage key of the first database. A communication step of communicating with a second database using a column having a character string divided into a plurality of element blocks as a field value as a linkage key;
From the storage area for storing column pair information indicating as a column pair a set of columns in a correspondence relationship between the plurality of columns included in the first database and the plurality of columns included in the second database, A column pair information reading step in which the computer reads the column pair information;
Information for associating a coefficient value set, which is a set of coefficient values defined for each column pair, with an element block of a character string, and coefficient value information for which the coefficient value pattern of the coefficient value set is different for each element block A coefficient value information reading step in which the computer reads coefficient value information from a storage area for storing;
The computer acquires a predetermined character string included in the cooperation key of the second database as a second cooperation candidate character string through the communication step and at least one of the acquired second cooperation candidate character string and A search step for extracting a character string having the same content in the element block from the linkage key of the first database through the communication step;
The computer does not extract the character string whose contents match the second cooperative candidate character string in all the element blocks in the search step, and the contents match in the second cooperative candidate character string and some of the element blocks. When a character string is extracted, an element block whose contents match in the extracted first cooperation candidate character string and the second cooperation candidate character string is identified as a matching element block, and the identified matching element block A matching element block identification step for obtaining a coefficient value set associated with the coefficient value information;
Based on the column pair information, the computer includes a field value in the first cooperation candidate record including the first cooperation candidate character string and the second cooperation candidate character string included in each column pair. The field value in the cooperation candidate record is extracted, it is determined whether or not the extracted field values match each other, the determination result of the matching determination for each column pair and the coefficient value set obtained by the matching element block specifying step Based on the coefficient value for each column pair, the similarity between the first cooperation candidate record and the second cooperation candidate record is determined, and it is determined whether or not the field value of the first cooperation candidate record is reflected in the second cooperation candidate record. An information processing method comprising: a record determination step to perform. A column that communicates with a first database that uses a column whose field value is a character string divided into a plurality of element blocks as a linkage key, and that is in a correspondence relationship with the column of the linkage key of the first database, A communication step of communicating with a second database having a column whose field value is a character string divided into a plurality of element blocks,
From a storage area for storing column pair information indicating a pair of columns in a correspondence relationship between a plurality of columns included in the first database and a plurality of columns included in the second database, a column pair A column pair information reading step for reading information;
Information for associating a coefficient value set, which is a set of coefficient values defined for each column pair, with an element block of a character string, and coefficient value information for which the coefficient value pattern of the coefficient value set is different for each element block A coefficient value information reading step for reading coefficient value information from the storage area for storing;
The predetermined character string included in the cooperation key of the second database is acquired as the second cooperation candidate character string through the communication step, and the acquired second cooperation candidate character string and at least one of the element blocks A search step for extracting a character string matching the same from the linkage key of the first database through the communication step;
The search step extracts a character string whose contents match in the second cooperative candidate character string and some of the element blocks without extracting a character string whose contents match in the second cooperative candidate character string in all element blocks. If it is determined, an element block whose contents match in the extracted first cooperation candidate character string and the second cooperation candidate character string is identified as a matching element block, and is associated with the identified matching element block A matching element block specifying step for acquiring a set of coefficient values from the coefficient value information;
Based on the column pair information, for each column pair, the field value in the first cooperation candidate record that includes the first cooperation candidate character string and the second cooperation candidate record that includes the second cooperation candidate character string. Field values are extracted, and whether or not the extracted field values match is determined. The determination result of the match determination for each column pair and the coefficient value set obtained by the matching element block specifying step for each column pair. Record determination step for determining whether or not the field value of the first cooperation candidate record is reflected in the second cooperation candidate record by determining the similarity between the first cooperation candidate record and the second cooperation candidate record based on the numerical value A program characterized by causing a computer to execute.

Images