JP3847992B2 - Database management apparatus and program recording medium - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention Has an ID with a registration ID. Entry data The tube For the database T A database management device that performs processing for checking duplicate entries in the database when registering the registry data, and a program used to implement the device Record In particular, there is a database management device that enables high-speed checking of duplicate entries, and a program used to implement the device. Record And a program recording medium.
[0002]
[Prior art]
The body of a gene is a substance called DNA. DNA is composed of four types of bases connected in a row. This sequence of bases is called a base sequence. Proteins are the main substances that make up the body of organisms and perform various functions in vivo, such as enzymes. The sequence of 20 amino acids that make up this protein is the base sequence of the gene. Is determined by. In practice, a set of three consecutive bases corresponds to one amino acid.
[0003]
A gene sequence represented as a DNA base sequence or a protein amino acid sequence can be described by a character string with each base or each amino acid as one character. For example, four types of bases are represented by A, T, G, and C by taking the initial letter of the name.
[0004]
Gene sequences expressed in character strings are accumulated in a DNA database. The nucleotide sequences of genes clarified so far are registered in the DDBJ / EMBL / GenBank international nucleotide sequence database constructed jointly by Japan, Europe and the United States.
[0005]
FIG. 9 illustrates the internal structure of this DNA database. The DNA data registered in this DNA database is given a unique accession number (U75865 in the figure), and in addition to the base sequence information of the gene, it is created from the name of the organism having the gene and the gene. Related information such as the name of the protein is described. Similarly, an amino acid sequence database such as PIR / SWISS-PROT is also constructed for proteins.
[0006]
Up to now, the above accession number has been composed of 6 digits of "1 alphabet letter + 5 digits", but the amount of DNA data registered in the DNA database becomes large. Recently, an 8-digit code “2 alphabet letters + 6 digits” has been used.
[0007]
The DNA database is composed of a release database that is periodically released and a daily update database that stores DNA data registered after the release database is issued. In the daily update database, DNA data is registered every day, and the DNA data in the daily update database is added to the release database and released every several months.
[0008]
In addition to new DNA data, DNA data registered in the daily update database includes DNA data obtained by correcting or changing DNA data already registered in the release database. As a result, DNA data having the same accession number exists in the daily update database and the release database. Further, when the same DNA data is continuously corrected or changed, a plurality of DNA data having the same accession number exist in the daily update database.
[0009]
The DNA database issuer (DDBJ / EMBL / GenBank) does not necessarily assign consecutive accession numbers to new DNA data. It is not possible to determine whether the number is DNA data (accession number) already registered in the release database.
[0010]
For biology research, data retrieval by accession number is generally performed, but if there are multiple DNA data with the same accession number, correct results cannot be obtained by data retrieval, When adding DNA data registered in the daily update database to the release database, it is necessary to make it non-redundant.
[0011]
Conventionally, first, all DNA data is first divided into entries (accession numbers), the file is developed on the disk with the accession number as the file name, and the new DNA data and the updated DNA data are stored in the same area. The same method was used to expand the file to achieve this non-redundant conversion.
[0012]
If duplicate entries exist according to this method, there will be multiple files with the same name, and non-redundantization will be realized by overwriting old files with new files. Then, by merging the expanded files again, a completely non-redundant DNA database is completed.
[0013]
[Problems to be solved by the invention]
Recently, DNA data registered in the DNA database has been increasing at a rate of 1.5 to 2 times per year, and is expected to increase further in the future.
[0014]
From now on, if non-redundant conversion is executed according to the conventional technology, it will be difficult to complete the non-redundant conversion process within 24 hours because it takes a lot of time to divide the entries and combine the files. It has become.
[0015]
This problem is not limited to the DNA database, and a large amount of entry data is registered in a database that manages entry data randomly regardless of the registration ID. U The same happens when the processing configuration is adopted.
[0016]
The present invention has been made in view of such circumstances. E with registration ID Entry data The tube For the database T Providing a new database management device that enables high-speed checking of duplicate entries in the database when registering entry data, and a program used to implement the device. Record It is an object of the present invention to provide a new program recording medium.
[0017]
[Means for Solving the Problems]
In order to achieve this object, the database management apparatus of the present invention performs a process of checking duplicate entries in a database when registering entry data in a database that manages entry data having a registration ID. (1) Whether or not it is a registration ID that may be registered in the database by extracting character string information at a specified position that constitutes the registration ID from the registration ID of the entry data to be registered Creating means for creating the character string information used for the determination of (2) reading the registration IDs of the entry data from the database one by one, and creating the character string information and the creating means for the above-mentioned prescribed positions constituting the registration ID By determining whether or not the character string information matches, the registration ID of the entry data to be registered is the registration ID. The first determination means for determining whether or not there is a possibility, (3) the registration ID that the first determination means determines to be possible matches the registration ID of the entry data to be registered By determining whether or not the entry data to be registered is duplicate entry data.
When adopting this configuration, when there are a plurality of entry data to be registered, the creating means uses those as character string information used for determining whether or not the registration ID may be registered in the database. Character string information of the above-mentioned specified position constituting the registration ID of the entry data to be registered Information and a list of the extracted string information. In this case, the first determination means includes the character string information of the specified position constituting the registration ID read from the database in the table. Record By determining whether or not the registration ID is registered, it is determined whether or not the registration ID may be a registration ID of the entry data to be registered.
Further, when adopting this configuration, when there are a plurality of entry data to be registered, the creation means uses character string information used for determining whether or not the registration ID may be registered in the database. Then, the character string information of the above-mentioned specified position constituting the registration ID of the entry data to be registered is extracted, and the upper One possible character string information at the specified position About viewing It has a table structure to record And above Specified position Statement Presence / absence information of character string information Information indicating the presence of the extracted character string information is recorded in a table for recording information, so that the text is recorded. In this case, the first determination means determines that the character string information of the specified position constituting the registration ID read from the database exists in the table. Record By determining whether or not the registration ID is registered, it is determined whether or not the registration ID may be a registration ID of the entry data to be registered.
Here, the function of the database management apparatus of the present invention is specifically realized by a program, and this program is stored in a floppy disk or the like, or stored in a disk or the like of a server and the like. The present invention is realized by being installed in the database management apparatus of the invention and operating on the memory.
Next, the present invention will be described in more detail with reference to the principle configuration diagram shown in FIG.
Here, in the principle configuration diagram shown in FIG. 1, it is assumed that there are a plurality of entry data to be registered.
[0018]
In the figure, 1 is a database management apparatus comprising the present invention, 2 is a database, which randomly manages entry data regardless of registration ID, 3 is a registration database, and is registered in the database 2 Entry data is stored.
[0019]
The database management apparatus 1 according to the present invention performs processing for checking duplicate entries in the database 2 when registering a large amount of entry data stored in the registration database 3 with respect to the database 2. In order to realize the function, a creation unit 10, a character list table 11, a hash table 12, a determination unit 13, and a search unit 14 are provided.
[0020]
The creation means 10 creates a character list table 11 and a hash table 12 used for searching whether or not the registration ID is likely to be registered in the database 2 from the registration ID of the entry data to be registered. .
[0021]
The character list table 11 is created by the creating unit 10 and manages a list of characters located at the specified position of the registration ID of the entry data to be registered. The hash table 12 is created by the creation unit 10 and is recorded at the specified position of the registration ID of the entry data to be registered by recording the presence / absence of characters in a list of characters that can be taken at the specified position of the registration ID. Manage the list of characters to be used.
[0022]
The judging means 13 reads out the registration IDs of the entry data one by one from the database 2, and whether or not the read registration IDs may be the registration IDs of the entry data stored in the registration database 3. Determine whether. The search means 14 searches for duplicate entry data included in entry data to be registered.
[0023]
Here, the functions of the database management apparatus 1 of the present invention are specifically realized by a program, and this program is stored in a floppy disk or the like, or stored in a disk or the like of a server, and from these The present invention is realized by being installed in the database management apparatus 1 and operating on the memory.
[0024]
In the database management apparatus 1 of the present invention configured as described above, when a request for registering entry data stored in the registration database 3 in the database 2 is issued, the creating means 10 has the entry data to be registered. The character list table 11 and the hash table 12 are created from the registration ID.
[0025]
In response to the creation processing of the creation means 10, the judgment means 13 reads the registration IDs of the entry data one by one from the database 2, and uses the created character list table 11 and hash table 12 to read the registered information. It is determined whether or not there is a possibility that the ID is a registration ID of entry data stored in the registration database 3.
[0026]
In response to the determination process of the determination unit 13, the search unit 14 stores the registration ID determined by the determination unit 13 and the registration database 3. each By comparing with the registration ID of the entry data, duplicate entry data stored in the registration database 3 is searched.
[0027]
This As described above, in the database management apparatus 1 of the present invention, the database 2 that manages the entry data having the registration ID is used. plural When registering entry data To, climb Character string information used for determining whether or not the registration ID may be registered in the database 2 by creating the character list table 11 or the hash table 12 from the registration ID of the entry data to be recorded. Is used to extract from the registration IDs of the entry data managed in the database 2 those that may be the registration IDs of the entry data to be registered, and the extracted registration By comparing the ID and the registration ID of the entry data to be registered, the configuration is such that duplicate entry data included in the entry data to be registered is searched, so that duplicate entries in the database 2 can be checked at high speed. Become.
[0028]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, the present invention will be described in detail according to embodiments.
[0029]
FIG. 2 shows an embodiment of the database management apparatus 1 of the present invention. In the figure, the same components as those described in FIG. 1 are indicated by the same symbols.
[0030]
2a is a DNA release database, which is regularly released by managing DNA data, 3a is a DNA update database, which stores DNA data registered after the issuance of the DNA release database 2a. is there.
[0031]
The database management apparatus 1 according to the present invention performs processing for registering DNA data stored in the DNA update database 3a with respect to the DNA release database 2a, and is created by the table creation program 100 and the table creation program 100. A character list table 11 and a hash table 12, a duplicate entry search program 200, a deletion list 300 created by the duplicate entry search program 200, and an entry data registration program 400.
[0032]
Here, the table creation program 100, the duplicate entry search program 200, and the entry data registration program 400 are installed via a floppy disk, a line, or the like.
[0033]
Hereinafter, for convenience of explanation, it is assumed that only 8 digits of “2 alphabet letters + 6 digits” are used as the accession number of DNA data.
[0034]
As shown in FIG. 2, the character list table 11 includes, for example, a first character list table 110, a second character list table 111, and a third character list table 112. The hash table 12 includes, for example, The first hash table 120, the second hash table 121, and the third hash table 122 are configured.
[0035]
FIG. 3 shows an embodiment of the character list table 11, and FIG. 4 shows an embodiment of the hash table 12.
[0036]
As shown in FIG. 3, the first character list table 110 manages accession numbers of DNA data stored in the DNA update database 3a as management targets, and manages a list of leading characters of those accession numbers. . Then, the second character list table 111 manages the list of the first two characters of those accession numbers with those accession numbers as management targets. The third character list table 112 manages a list of the first three characters of the accession numbers with the accession numbers as management targets.
[0037]
For example, when the accession number of the DNA data stored in the DNA update database 3a has four types of leading characters A, C, D, and W, the first character list table 110 stores the A, C, D , W are managed.
[0038]
On the other hand, as shown in FIG. 4, the first hash table 120 includes a numeric string (000 to 999) that can take three digits in the numeric part of the accession number and an accession number having the numeric string. A table structure composed of pair data with a flag indicating whether or not the data is stored, and the accession numbers of the DNA data stored in the DNA update database 3a are managed, and the numerical part of the accession numbers By setting the flag paired with the upper 3 digit number string to “1”, the upper 3 digit number sequence of the accession number is managed.
[0039]
The second hash table 121 includes a numeric string (000 to 999) that can take three digits in the numeric part of the accession number, and a flag indicating whether or not an accession number having the numeric string exists. The accession number of the DNA data stored in the DNA update database 3a is a management target, and is stored in a three-digit number string in the number part of the accession number. By setting the paired flag to “1”, a 3-digit number string in the number part of those accession numbers is managed.
[0040]
The third hash table 122 includes a number string (000 to 999) that can be taken by the last three digits of the accession number and a flag indicating whether or not an accession number having the number string exists. The accession number of the DNA data stored in the DNA update database 3a has a table structure composed of paired data, and the number of the lower three digits of the accession number is paired with the accession number. By setting the flag to “1”, the number string of the last three digits of the accession number is managed.
[0041]
For example, when the accession number of DNA data stored in the DNA update database 3a has three types of numeric strings “111”, “123”, and “222” in the first three digits of the numeric part, the first hash The table 120 sets the flag paired with the number string “111” to “1”, the flag paired with the number string “123” “1”, and the flag paired with the number string “222”. By setting it to “1”, the numeric string of the upper three digits of the accession number is managed.
[0042]
5 and 6 show an embodiment of the processing flow executed by the table creation program 100, and FIGS. 7 and 8 show an embodiment of the processing flow executed by the duplicate entry search program 200. FIG. Next, according to these processing flows, the processing of the database management apparatus 1 of the present invention configured as described above will be described in detail.
[0043]
When the registration request of the DNA data stored in the DNA update database 3a to the DNA release database 2a is issued, the table creation program 100 first starts with step 1 as shown in the processing flow of FIGS. Then, the initial value “1” is set to the variable i.
[0044]
Subsequently, in step 2, the accession number of the i-th DNA data stored in the DNA update database 3a is read. Subsequently, in step 3, the first character of the read accession number is extracted. Subsequently, in step 4, when it is determined whether or not the extracted first character has already been recorded in the first character list table 110, and when it is determined that it has not been recorded yet, the process proceeds to step 5. When the extracted first character is recorded in the first character list table 110 and it is determined that it has already been recorded, the process of step 5 is omitted.
[0045]
Subsequently, in step 6, the first two characters of the accession number read in step 2 are extracted. Subsequently, in step 7, it is determined whether or not the extracted first two characters are already recorded in the second character list table 111, and when it is determined that they are not yet recorded, the process proceeds to step 8. Thus, when the extracted first two characters are recorded in the second character list table 111 and it is determined that they are already recorded, the processing of step 8 is omitted.
[0046]
Subsequently, in step 9, the first three characters of the accession number read in step 2 are extracted. Subsequently, in step 10, it is determined whether or not the extracted first three characters are already recorded in the third character list table 112, and when it is determined that they are not yet recorded, the process proceeds to step 11. Thus, when the extracted first three characters are recorded in the third character list table 112 and it is determined that they are already recorded, the processing of step 11 is omitted.
[0047]
Subsequently, in step 12 (processing flow in FIG. 6), the upper three digits of the accession number read in step 2 are extracted. Subsequently, in step 13, it is determined whether or not the flag of the first hash table 120 indicated by the extracted number string is already “1”, and it is determined that it is not yet “1”. When the process proceeds to step 14, the flag is set to “1” so that the extracted numeric string is recorded in the first hash table 120. If it is already “1”, this step 14 The process of is omitted.
[0048]
Subsequently, in step 15, three digits in the numeric part of the accession number read in step 2 are extracted. Subsequently, in step 16, it is determined whether or not the flag of the second hash table 121 pointed to by the extracted number string is already “1”, and it is determined that it is not yet “1”. When the process proceeds to step 17, the flag is set to “1” so that the extracted numeric string is recorded in the second hash table 121. The process of is omitted.
[0049]
Subsequently, in step 18, the last three digits of the numeric part of the accession number read in step 2 are extracted. Subsequently, in step 19, it is determined whether or not the flag of the third hash table 122 indicated by the extracted number string is already “1”, and it is determined that it is not yet “1”. When proceeding to step 20, the flag is set to “1” so that the extracted number string is recorded in the third hash table 122, and when it is already “1”, this step 20 The process of is omitted.
[0050]
Subsequently, in step 21, the value of the variable i is incremented by one. In the following step 22, it is determined whether or not the value of the variable i exceeds the number of DNA data stored in the DNA update database 3a. When it is determined that it has not been exceeded, the process returns to step 2, and when it is determined that it has been exceeded, all processing is terminated.
[0051]
In this way, when the registration request for the DNA data stored in the DNA update database 3a is issued to the DNA release database 2a, the table creation program 100 accesses the accession of the DNA data stored in the DNA update database 3a. From the numbers, the first character list table 110 / second character list table 111 / third character list table 112 / first hash table 120 / second hash table 121 / third hash table 122 are created. It is processed like this.
[0052]
When the table creation program 100 is started when the process is completed, the duplicate entry search program 200 is first set to the initial value “1” in the variable i in step 1 as shown in the processing flow of FIGS. 1 ”is set.
[0053]
Subsequently, in step 2, the accession number of the i-th DNA data stored in the DNA release database 2a is read. Subsequently, in step 3, the first character of the read accession number is extracted. Subsequently, in Step 4, when it is determined whether or not the extracted first character is recorded in the first character list table 110, and it is determined that it is not recorded, the DNA update database 3a stores the When it is determined that there is no DNA data having the read accession number, the process proceeds to step 18 (processing flow in FIG. 8) described later.
[0054]
On the other hand, when it is determined in step 4 that the first character extracted in step 3 is recorded in the first character list table 110, the process proceeds to step 5 and the first two characters of the accession number read in step 2 To extract. Subsequently, in Step 6, when it is determined whether or not the extracted first two characters are recorded in the second character list table 111, and it is determined that they are not recorded, the DNA update database 3a includes When it is determined that there is no DNA data having the read accession number, the process proceeds to step 18 (processing flow in FIG. 8) described later.
[0055]
On the other hand, when it is determined in step 6 that the first two characters extracted in step 5 are recorded in the second character list table 111, the process proceeds to step 7 where the first 3 characters of the accession number read in step 2 are read. Extract characters. Subsequently, in Step 8, when it is determined whether or not the extracted first three characters are recorded in the third character list table 112, and it is determined that they are not recorded, the DNA update database 3a includes When it is determined that there is no DNA data having the read accession number, the process proceeds to step 18 (processing flow in FIG. 8) described later.
[0056]
On the other hand, when it is determined in step 8 that the first three characters extracted in step 7 are recorded in the third character list table 112, the process proceeds to step 9 where the numeric part of the accession number read in step 2 Extract the first three digits. Subsequently, in Step 10, when it is determined whether or not the flag of the first hash table 120 indicated by the extracted number string is “1”, and when it is determined that it is “0”, the DNA update database It is determined that there is no DNA data having the read accession number in 3a, and the process proceeds to step 18 (processing flow in FIG. 8) described later.
[0057]
On the other hand, when it is determined in step 10 that the flag of the first hash table 120 pointed to by the number string extracted in step 9 is “1”, the process proceeds to step 11 where the accession number read in step 2 is stored. Extract a 3-digit number string in the number part. Subsequently, in step 12 (processing flow of FIG. 8), it is determined whether or not the flag of the second hash table 121 pointed to by the extracted number string is “1”. When making the determination, it is determined that there is no DNA data having the read accession number in the DNA update database 3a, and the process proceeds to step 18 described later.
[0058]
On the other hand, when it is determined in step 12 that the flag of the second hash table 121 indicated by the number string extracted in step 11 is “1”, the process proceeds to step 13 where the accession number read in step 2 is stored. Extract the numeric string of the last 3 digits of the number part. Subsequently, in step 14, it is determined whether or not the flag of the third hash table 122 indicated by the extracted number string is “1”, and when determining that it is “0”, the DNA update database It is determined that there is no DNA data having the read accession number in 3a, and the process proceeds to step 18 described later.
[0059]
On the other hand, when it is determined in step 14 that the flag of the third hash table 122 indicated by the number string extracted in step 13 is “1”, the DNA update database 3 a has the accession number read in step 2. When it is determined that there is a possibility that DNA data exists, the process proceeds to step 15 to search whether the DNA data having the read accession number is stored in the DNA update database 3a.
[0060]
Subsequently, when it is determined in step 16 whether there is DNA data having the accession number read in step 2 in the DNA update database 3a according to the search result in step 15, That is, when the DNA data having the accession number read in step 2 is to be updated, the process proceeds to step 17 to record the accession number in the deletion list 300 and determine that it does not exist. Sometimes, the process of step 17 is omitted.
[0061]
Subsequently, in step 18, the value of the variable i is incremented by 1. In the following step 19, it is determined whether or not the value of the variable i exceeds the number of DNA data stored in the DNA release database 2a. When it is determined that it has not been exceeded, the process returns to step 2, and when it is determined that it has been exceeded, all processing is terminated.
[0062]
In this way, the duplicate entry search program 200 uses the character list table 11 and the hash table 12 created by the table creation program 100 when the table creation program 100 finishes processing, and the DNA stored in the DNA release database 2a. It is determined whether or not the data is likely to be updated. If there is a possibility that the data is updated, the DNA update database 3a is searched to determine whether or not the data is actually updated. As a result, the accession number of the updated DNA data is recorded in the deletion list 300.
[0063]
When the deletion list 300 is created in accordance with the process of the duplicate entry search program 200, the entry data registration program 400 deletes DNA data having an accession number recorded in the deletion list 300 from the DNA release database 2a, while updating the DNA. Processing is performed so that the DNA data stored in the database 3a is registered in the DNA release database 2a.
[0064]
Although the present invention has been described with reference to the illustrated embodiments, the present invention is not limited thereto. For example, in the examples, the present invention has been described according to application to a DNA database, but the present invention is not limited to application to a DNA database.
[0065]
【The invention's effect】
As explained above, the book In the invention, for a database managing entry data having a registration ID plural When registering entry data To, climb Registered in the database by creating a table that records character string information used to determine whether the registration ID of the entry data to be recorded is a registration ID that may be registered in the database. Character string information used for determining whether or not the registration ID is likely to be registered is created, and using that information, the registration data of the entry data to be registered is registered among the registration IDs of the entry data managed in the database. By extracting what may be a registration ID and comparing the extracted registration ID with the registration ID of the entry data to be registered, duplicate entry data included in the entry data to be registered is searched. Since the configuration is adopted, duplicate entries in the database can be checked at high speed.
[Brief description of the drawings]
FIG. 1 is a principle configuration diagram of the present invention.
FIG. 2 is an example of the present invention.
FIG. 3 is an example of a character list table.
FIG. 4 is an example of a hash table.
FIG. 5 is a processing flow of a table creation program.
FIG. 6 is a processing flow of a table creation program.
FIG. 7 is a processing flow of a duplicate entry search program.
FIG. 8 is a processing flow of a duplicate entry search program.
FIG. 9 is an explanatory diagram of a DNA database.
[Explanation of symbols]
1 Database management device
2 Database
3 registration database
10 Making means
11 Character list table
12 Hash table
13 Judgment means
14 Search means

Claims (4)

A database management apparatus that performs processing for checking duplicate entries in a database when registering entry data in a database that manages entry data having a registration ID,
When the entry data to be registered there is a plurality, and eject the character string information defined position constituting the registration I D with the those registered target entry data, records for a list of those of the extracted character string information Creating means to create a table ;
Reading one registration ID with the entry data from the database, that string information of the defined position constituting the registration ID to determine whether or not recorded in the table, the registration ID A first determination means for determining whether or not there is a possibility of a registration ID of entry data to be registered;
The entry data to be registered is duplicate entry data by judging whether or not the registration ID that the first judging means judges is likely to match the registration ID of the entry data to be registered. Comprising a second judging means for judging whether or not
Feature database management device. A database management apparatus that performs processing for checking duplicate entries in a database when registering entry data in a database that manages entry data having a registration ID,
When the entry data to be registered there is a plurality, and eject the character string information defined position constituting the registration I D with the those registered target entry data, it can take a string information located in its predetermined position By recording information indicating the presence of the extracted character string information in a table having a table structure for recording the list and recording the presence / absence information of the character string information located at the specified position, the table and creation means for creating,
Reading one registration ID with the entry data from the database, that string information of the defined position constituting the registration ID to determine whether or not recorded as there exist in the table, First determination means for determining whether or not there is a possibility that the registration ID is a registration ID of entry data to be registered;
The entry data to be registered is duplicate entry data by judging whether or not the registration ID that the first judging means judges is likely to match the registration ID of the entry data to be registered. Comprising a second judging means for judging whether or not
Feature database management device. A program recording medium for recording a program used to realize a database management apparatus that performs processing for checking duplicate entries in a database when registering entry data in a database that manages entry data having a registration ID. There,
When the entry data to be registered there is a plurality, and eject the character string information defined position constituting the registration I D with the those registered target entry data, records for a list of those of the extracted character string information Creation process to create a table ,
Reading one registration ID with the entry data from the database, that string information of the defined position constituting the registration ID to determine whether or not recorded in the table, the registration ID A first determination process for determining whether or not there is a possibility of a registration ID of entry data to be registered;
The registration target entry data is duplicate entry data by determining whether or not the registration ID that is determined to be possible in the first determination processing matches the registration ID of the registration target entry data. A program for causing the computer to execute the second determination process for determining whether or not
A program recording medium. A program recording medium for recording a program used for realizing a database management apparatus that performs processing for checking duplicate entries in a database when registering entry data in a database that manages entry data having a registration ID Because
When there are a plurality of entry data to be registered, character string information at a specified position that constitutes a registration ID of the entry data to be registered is extracted, and a list of possible character string information at the specified position is recorded. The table is created by recording the information indicating the presence of the extracted character string information on the table that records the presence / absence information of the character string information located at the specified position. Creation process,
The registration ID of the entry data is read from the database one by one, and it is determined whether or not the character string information of the specified position constituting the registration ID is recorded as existing in the table. A first determination process for determining whether there is a possibility that the ID is a registration ID of entry data to be registered;
The registration target entry data is duplicate entry data by determining whether or not the registration ID that is determined to be possible in the first determination processing matches the registration ID of the registration target entry data. A program for causing the computer to execute the second determination process for determining whether or not
A program recording medium.

Images