JPH11143749A - Relational database management system and data management method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve the performance of retrieval or a file outputting processing, and to reduce the amounts of a memory-in use in a data managing method of a relational database management system. SOLUTION: A item A group 14 sharing the item of an item B group 13 related with an item A9 is defined as an item similar to the item A9, and a similar number column 8 capable of identification of the similar item is added to a data structure. A similar number stored in the similar number column 8 is automatically identified and registered at the time of data registration. Then, retrieval or file outputting is operated by using the similar number stored in the similar number column 8 as a key.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data management method for a relational database management system, and more particularly to an m-side that shares an n-side item group associated with the m-side in data management having m-to-n relationship information. The present invention relates to a data management method for constructing a mechanism for identifying a group of items.

[0002]

2. Description of the Related Art FIG. 3 is a diagram for explaining the configuration of a conventional data management method. Conventionally, when information of two systems is stored in the data structure, the item A
A column 34 and a management number A column 35 are set, and an item B column 36 and a management number B column 37 are set in the item B table 32 to store respective values. In the case of the m-to-n relationship, a correspondence table 33 is provided, and the management number columns of the item A table 31 and the item B table 32 are held.
A correspondence was being built.

In this data structure, the following procedure is required to identify and search for similar items (item A group 44 sharing items of item B group 43 associated with item A39).

FIG. 4 shows a conventional similar item search processing step and expanded data. Conventionally, when searching for a similar item, as a first process, an item B group 51 corresponding to an item A50 that is
As a second process, an item A group 52 corresponding to the item B group 51 of the search result of the first process as a key, and an item A group 52 of the search result of the second process as a third process. It is necessary to count the number of keys as keys and extract the same number of item A groups 54 as the number 53 of item A50, which is the search key of the first processing, from the search result of the third processing as the final processing.

[0005]

In the conventional data structure, in order to perform a process using a similar item existing in the item A table as a key, it is necessary to create and process a key item from a data structure. Therefore, it takes a long processing time, and particularly in the processing of all data, a large amount of data being processed is secured in a memory or a database area, so that performance is lowered in terms of access efficiency and memory efficiency.

An object of the present invention is to provide a data management method for an m-to-n relationship in a relational database management system, in which an m-side item sharing an n-side item group associated with an m-side item exists. Another object of the present invention is to provide a data management method for improving the performance of search and file output processing and reducing the amount of memory used.

[0007]

According to the present invention, in a data management method of a relational database for managing m-to-n relation information, a similar number sequence serving as a similarity identifier is added to an m-side item group, and a m-side item group is added. The m-side item group that shares the n-side item group associated with the item is searched using the similarity number stored in the similarity number sequence as a key.

According to the present invention, the processing performance can be improved by holding a similar identifier in a data structure and performing a search using the identifier as a key. More specifically,
A similarity number sequence serving as a similarity identifier is added to the data structure, and a search can be performed using the similarity number stored in the similarity number sequence as a key during a search.

[0009]

Next, an embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a diagram showing a data management method according to an embodiment of the present invention, and FIG. 2 is a diagram showing search processing steps and expanded data in the embodiment of FIG. The data management method shown in FIG. 1 is configured such that a similarity number column 8 is added to the item A table 1 and, as an operation, a similarity number is automatically added at the registration stage, and a search or file output is performed using the similarity number as a key. Is different from the conventional one.

Hereinafter, information registration and search processing for an identifier of a similar item will be described with reference to FIGS.

In the item A table 1, an item A column 4, a management number A column 5, and a similar number column 8 are set.
In the item B table 2, an item B column 6 and a management number B column 7 are set. The correspondence table 3 holds the management number strings of the item A table 1 and the item B table 2 and establishes a correspondence.

After associating and registering the registered item A9 and the registered item B10, it is checked whether or not there is an item A group similar to the registered item A9. If there is a similar item A group 14, the similar number 11 of any item of the similar item A group 14 is extracted and stored in the similar number column of the item A9. If there is no similar item, the management number B12 when the item B10 was registered
Is stored in the similar number sequence of the item A9.

At the time of retrieval, when the retrieval is performed using the item A20 as a key, the similar number 21 of the item A20 is extracted, and then the retrieval is performed using the similar number 21 as a key, whereby the similar item A group 24 can be retrieved.

According to the present invention, the similar number column 8 is held in the data structure in the item A table 1, and data is automatically identified and registered in the similar number column 8 at the time of data registration. Therefore, there is no need to access the correspondence table 3 and the item B table 2 to determine the similarity.

As described above, in this data management method,
A similarity number is provided as an identifier of the m-to-n correspondence, and similarity can be identified by using an existing management number as a value of the similarity number. Can be planned.

The item A table 1 and the item B table 2 can be stored in a storage medium.

[0018]

As described above, the data management method of the present invention automatically searches for similar item identifiers at the time of data registration processing, and constructs a mechanism for adding the similar item identifiers. And file output processing performance can be improved. Further, even in batch processing of all data using similar items as keys, the amount of memory used can be reduced because the number of data to be accessed is small.

[Brief description of the drawings]

FIG. 1 is a diagram showing a data management method according to an embodiment of the present invention.

FIG. 2 is a diagram showing a similar item search processing step and expanded data according to the present invention.

FIG. 3 is a diagram showing a conventional data management method.

FIG. 4 is a diagram showing a conventional similar item search processing step and expanded data.

[Explanation of symbols]

 1,31 Item A table 2,32 Item B table 3,33 Correspondence table 4,34,50 Item A column 5,15,35,45 Management number A column 6,36 Item B column 7,17,37,47 Management number B column 8 Similar number column 9, 20, 39 Item A 10 Item B 11, 21, Similar number 12 Management number 13, 43, 51 Item B group 14, 24, 44, 52, 54 Item A group 53 Number

Claims (6)

[Claims] 1. A relational database management system for managing two types of items using a correspondence table, wherein a first item group that shares an item of a second item group associated with a first item is stored in a first item group. A relational database management system, wherein the relational database management system is defined as an item similar to the first item, and has a similar number sequence for identifying the similar item in a data structure. 2. The relational database management system according to claim 1, wherein a similar number is automatically identified and registered in the similar number sequence at a data registration stage. 3. A data management method for a relational database that manages m-to-n relationship information, wherein a similarity number sequence serving as a similarity identifier is added to the m-side item group, and n is associated with the m-side item. A data management method for a relational database, comprising: searching for an m-side item group that shares a side item group with a similarity number stored in the similarity number string as a key. 4. The data management method for a relational database according to claim 3, wherein a file is output using the similar number as a key. 5. The data management method for a relational database according to claim 3, wherein said similar number is automatically added at a registration stage. 6. When two items are managed using a correspondence table, a second item associated with the first item is managed.
A computer, characterized in that a first item group sharing an item of the first item group is defined as an item similar to the first item, and a similar number sequence for identifying the similar item is provided in a data structure. A readable recording medium.