JP2000348056A - Device for recognizing related data - Google Patents

Abstract

PROBLEM TO BE SOLVED: To relieve the burden of a data management system user by automatically executing relating by means of previously defined related reference, making a data structure clear, inspecting relevancy even when data is additionally registered and automatically correcting relevancy in data even between different kinds of application data. SOLUTION: The related structure chart of data is generated by an inter-data relating means 36 from a subordinate keyword and a related keyword which are generated by a subordinate keyword generating means 34 and a related keyword generating means 35 concerning data generated in various application programs 2. The chart is managed. Then inter-data relevancy and an influence range by a part of data correction are identified and a related data generating person reporting means 39 reports the data generating person that related data are corrected.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a data management device (PDM system) for centrally managing data generated from a wide variety of applications.
The present invention relates to a related data recognition device that collectively obtains related data at the time of data reference, browsing, and correction, and notifies a creator of the related data that another related data has been corrected.

[0002]

2. Description of the Related Art Conventionally, data association is performed by an administrator of a data management system, based on the type of registered data,
Determines the type, associates data with related data, and when there is an acquisition request for certain data, acquires related data based on the association, or attribute assigned to data By performing search work using data, after obtaining relevant data,
I was trying to get relevant data. In addition, if data is modified, the data modifier may examine the relevant data and notify the creator of the relevant data of the change,
The creator of the related data needed to confirm using the data management system.

[0003]

However, in the above-described conventional association between data, the number of association steps increases in proportion to the number of data items, and there is no clear standard for association in the conventional methods. Relationship becomes complicated. Some applications automatically associate data according to the type of data within the same application.However, despite the use of multiple different applications, data generation is not considered at all between different applications. Was.

[0004] The present invention solves the above-mentioned conventional problems. The present invention automatically associates data with each other based on a pre-defined association criterion, clarifies the data structure, and associates data even if additional data is registered. An object of the present invention is to provide a related data recognizing device which examines the characteristics and automatically corrects the relevance of data even between different application data to reduce the load on the data management system user.

[0005]

SUMMARY OF THE INVENTION In order to solve the above-mentioned problems, the present invention provides a data management device which sets related keywords and subordinate keywords in data to be registered when registering data generated by application software in a data management device. Automatically set the relationship between the data to be registered in the, to retrieve the related data collectively at the time of data retrieval, and to notify the creator of the related data at the time of registration Things.

[0006] As described above, data created by an application is treated as one data by adding management information to the application data regardless of the application, and the data is automatically associated with each other according to a predetermined association criterion. In addition to clarifying the relationship, even if data is additionally registered, the relationship between the data is checked, and the relationship between the data is automatically corrected between different application data, so that the load on the data management system user can be reduced.

[0007]

BEST MODE FOR CARRYING OUT THE INVENTION
A registration data input unit for generating data to be registered in the data management device, which is generated by application software, and a data management device state detection unit for detecting a state of data managed by the data management device; A related keyword creating unit that attaches a keyword to registration data, a dependent keyword creating unit that attaches a dependent keyword that determines a related dependency relationship to the registration data according to a data type, an inter-data associating unit that associates data, Related data detecting means for detecting related data, and an association storage D for storing an association between data
B (database) and registration output means for registering data in the data management device, automatically detecting data related to the data to be corrected, and manually associating data between the data on the management device. It has the effect that association can be performed without the need to register.

According to a second aspect of the present invention, an association management data is added to raw data created from an application or the like by a dependent keyword for determining a data dependency.
By storing management data consisting of a plurality of related keywords for examining the relation and a combination status for determining the strength of the relation, when one data is taken out from the data management device, other related data can be taken out at the same time. In addition, there is an effect that related data requiring correction can be collectively corrected.

According to the third aspect of the present invention, when the data is corrected and registered, the creator of the related data having the higher related level corrects and registers the data having the lower related level. That is, the user is prompted to confirm the contents of the correction, and has the effect of reducing inconsistencies in the contents due to the influence of other data corrections and allowing the data to always reflect the latest contents.

Hereinafter, an embodiment of the present invention will be described with reference to FIG.
5 and (Table 1).

FIG. 1 is a block diagram showing a configuration of a related data recognition apparatus according to an embodiment of the present invention. In FIG. 1, reference numeral 1 denotes a data management device (PD) for managing various data.
M system), 2 is a user area where a user generates data and various application programs which generate data, and 3 is a related data recognition device of the present invention.

The registration data input means 30 in this related data recognition device fetches data of various application programs 2 existing in a user area (an area not under the control of the data management apparatus 1), and the registered data becomes new. Determine whether it is data or re-registration. The data management device status detection means 31 has a function of extracting relevant information of data registered in the data management device 1 and the status of the data. The related data detecting means 32 collects data having the same related keyword from the data management device 1. Dependency related DB
The (database) 33 has data associating the dependent keywords 33a and the dependent hierarchical levels 33b as shown in (Table 1).

[0013]

[Table 1]

The dependent keyword creating means 34 determines a dependent level of data and a dependent search range. The related keyword creating means 35 sets a related keyword in the data.
The data association unit 36 creates a data structure tree indicating the association between data. The association storage DB (database) 37 stores the data name and the dependent keyword creation means 3
4 is a database storing a dependent keyword and a dependent range set in step 4, a data structure tree representing a relationship between data and a set of related keywords and a related binding degree set by the related keyword creating unit 35 as one record. The registration output unit 38 is a unit that registers data in the data management device 1. Further, the related data creator notification means 39 notifies the creator of the data related to the corrected data that the related data has been corrected, and urges the correction of the data. The data fetching means 40 fetches data from the data management device 1 in response to a data acquisition request from the user, and collectively obtains related data in cooperation with the related data detecting means 32. The data output means 41 outputs data to various application programs (various data creation applications) 2.

A series of operations of registering data generated by various application programs, retrieving data again, and re-registering the related data recognition apparatus configured as described above will be described with reference to FIGS. .

First, FIG. 2 is a transition diagram of a related data structure tree for explaining the operation of the related data recognition apparatus according to the present embodiment, and the operation of registering DataC from the state of FIG. 2A will be described. As shown in the processing flow chart of FIG. 3, in the registration procedure shown in FIG. 3A, a procedure for registering data from the user area to the data management device 1 is started in step 1. The registration data input unit 30 determines whether the data to be registered is data to be newly registered or data to be reregistered by inquiring the data management device 1 by the data management device status acquisition unit 31 (step 2).

Next, in step 3, the dependent keyword 33a and the dependent range 33c are determined from a screen as shown in the example of the dependent keyword setting screen in FIG. Dependent keyword 3
Reference numeral 3a selects a keyword registered as the dependent keyword 33a registered in the dependent DB 33 (Table 1).
For the dependent range, select an attribute that determines the range, such as the same project number.

Next, when the register button is pressed, the keywords are moved from the list on the left to the list on the right in the screen shown in FIG. Considering the tree structure of the data, the related keywords are attached in the form of (keyword 1) (keyword 2) (keyword 3-1) (keyword 3-2) (keyword 3-3). That is, the lower the subordinate hierarchy is, the more related keywords are (step 5). When the register button is pressed, data having the closest related keyword is detected in the subordinate range set in step 3, and all data related to the data are searched (step 6). Next, in step 7, data is associated by the data association unit 36. FIG. 3B illustrates step 7 in detail.

In step 7-1 of FIG. 3B, all the relevant data detected in step 6 is stored in the dependent relation DB3.
The data structure tree (FIG. 2) according to the subordinate hierarchy level 33b from the subordinate keywords registered in FIG.
(A)) is generated. To register DataC of subordinate hierarchy level D, upper level C has no related data and upper level B
Is retrieved in step 7-2. This DataB is A
Higher-level related data. Next, in step 7-3, a search is made to see if there is any higher-level related data. Here DataA
Is applicable. In step 7-4, the number of keywords that match between the related keywords of DataC and the related keywords of DataB is checked. Similarly, check the number of matching keywords in DataC and DataA. The matching rate of each keyword is compared (step 7-5). In this case, since there are more keywords in DataB than in DataA, the higher relation of DataC is assigned to DataB (Step 7-6). DataC for lower order
Since there is no data at a lower subordinate level (step 7-7), the result is as shown in FIG. 2B.

The coincidence rate is calculated by (Equation 1).

[0021]

(Equation 1) Next, the data structure tree generated in step 7-1 is shown in FIG.
In (b), when registering DataD of the dependent level C, the procedure up to step 7-6 is the same as the registration of DataC. In step 7-7, there is a DataC of the subordinate level D at a lower level. In step 7-8, the degree of coupling is checked (the degree of coupling will be described in step 8 later. In the case of loose coupling, the dependency of lower-order related data may be changed, and in the case of tight coupling, the dependency is unchanged. Becomes). For the data DataC existing at the subordinate level D, which is the lower related data because it is loosely coupled, the related keywords are examined. If it is larger than the data (DataB in this case), the higher-order related data is changed from DataB to DataD. In this embodiment,
Since the ratio of DataD is greater than the ratio of DataB, the state shown in FIG. 2C is obtained.

Next, when the data structure tree generated in step 7-1 is shown in FIG. 2C and DataE of the subordinate level D is registered, the procedure is exactly the same as when DataC is registered.
The state shown in FIG.

Next, when the data structure tree generated in step 7-1 registers DataF of the dependent level C in the state shown in FIG. 2D, steps up to step 7-7 are performed in the same procedure as that of registering DataD. is there. In step 7-8, it is assumed that the coupling degree of both DataC and DataE is loosely coupled. Next, in step 7-9, the DataF to be added and the Dat that already has a higher-order dependency on DataC and DataE
Compare the match rate of related keywords with aD. DataC has a higher match rate for DataC and DataF for DataE
FIG. 2E shows that the matching rate is higher for.

Next, at step 7-1, the data structure tree is
In (e), when adding DataG of the dependent level E, DataC with a high related data matching rate is searched in step 7-2. Next, in step 7-3, DataD is searched. If the matching rate of DataD is higher in step 7-5, step 7 is executed.
Through -5-1, the data is compared with the higher-order DataB (steps 7-3 to 7-5). In this case, since the matching rate of DataB is higher, comparison with DataA is further performed through step 7-5-1 (steps 7-3 to 7-5). Here, since the matching rate of DataB is higher than that of DataA, at step 7-6 Dat
aG is associated with DataB. Since there is no lower data in DataG, steps 7-8 to 7-9 are skipped, and the result is as shown in FIG.

Next, in step 8 shown in FIG. 3A, the management data and the connection degree set in steps 4 and 5 and the data structure tree created in step 6 are registered in the association storage DB 37. The coupling degree cannot be read normally unless another file is called at the same time when a file as an application is called (for example, three-dimensional CAD).
In, the assembly file cannot call the assembly unless the component files are called at the same time)
Is tightly coupled automatically, otherwise loosely coupled. However, tight coupling is established irrespective of the data structure tree (for example, it is established even when the subordinate levels are the same, and the hierarchical relationship is defined by the application). In step 9, the registration data is stored in the data management device 1
Register with.

Next, the association of the data is shown in FIG.
A series of operations for extracting the taF will be described with reference to FIGS.

In step 21 shown in FIG.
The data fetching unit 40 requests the data management device 1 to retrieve DataF. Next, the related data detecting means 32 searches the association storage DB 37 for data that is tightly coupled with DataF (step 22), and if there is tightly coupled related data, the related data detecting means 32 re-closes the dependent level in step 23 by tightly coupling. Is the same as DataF,
Alternatively, a request for extracting lower-order related data is made. Steps 21 to 23 are repeated with respect to the data to be taken out again by this request. Next, in step 24, the data output means 41 outputs the retrieval request data and related data to the various application programs (various data creation applications) 2, and the data retrieval is completed.

Next, the above-mentioned embodiment is taken out.
A series of operations for correcting DataF and registering it again in the data management device 1 will be described with reference to FIGS. 1, 3, and 5. FIG.

The DataF corrected by the various application programs 2 is fetched by the registered data input means 30 (step 1). Next, in step 2,
It is determined that DataF is not a new registration and step 1
In step 1, the related data of DataF is acquired through the related data detecting means 32. Next, in step 12, the related data creator is notified by a related data creator notifying means 39 such as an e-mail that the DataF has been corrected.
Encourage correction of top data. Next, in step 13, the registrant selects whether to correct the related keyword for the corrected DataF, and if not, the operation after step 8 for new registration is performed. The screen is displayed again, and the operation after step 4 at the time of new registration after correcting the related keyword is repeated.

As described above, according to the embodiment of the present invention, it is possible to easily search and retrieve related data by automating data association and clarifying the data structure.

[0031]

As described above, the present invention makes it easy to search for related data by automatically setting and recognizing the relationship of data registered in the data management device, and to correct the data by modifying the data. By easily grasping the affected data and notifying the creator of the affected data that other relevant data has been modified, it is possible to eliminate inconsistencies in the content between the data.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a configuration of a related data recognition device according to an embodiment of the present invention.

FIG. 2 is a related data structure tree transition diagram for explaining the operation of the related data recognition device according to the embodiment of the present invention.

FIG. 3 is a processing flow chart for explaining the operation of the related data recognition device in the embodiment of the present invention.

FIG. 4 is an example of a dependent keyword setting screen for explaining the operation of the related data recognition device according to the embodiment of the present invention.

FIG. 5 is an example of a related keyword setting screen for explaining the operation of the related data recognition device according to the embodiment of the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Data management device 2 Various applications 3 Related data recognition device 30 Registration data input means 31 Data management device data state detection means 32 Related data detection means 33 Dependency related DB 34 Dependent keyword creation means 35 Related keyword creation means 36 Data association means 37 Association storage DB 38 Registration / output unit 39 Related data creator notification unit 40 Data acquisition unit 41 Data output unit

Claims (3)

[Claims] 1. Registered data input means for registering data in a data management device or for taking out and correcting the registered data, the data being generated by application software and taking in data to be registered in the data management device; Data management device status detection means for detecting the status of registered data managed by the management device; related keyword creation means for attaching a related keyword for associating to the registered data; Dependent keyword creating means for attaching a dependent keyword to the registered data to determine a dependent relationship, inter-data associating means for associating data, and related data detecting means for detecting related data with the registered data, An association storage database for storing an association between data, and the data management A related data recognizing device, comprising: registration output means for registering data in the device; and automatically associating the registered data with other data. 2. When data having the same related keyword and having a higher-order dependent keyword is associated, and there is already data having the same related keyword and having a lower-order dependent keyword, the data has a dependency relationship. 2. The related data recognition apparatus according to claim 1, wherein the association is corrected according to the related keyword matching rate, and the data association is performed so as to automate the subordination of the data. 3. When the data is corrected and registered,
A related data creator notification means for notifying a creator of related data having a higher related level that the data having a lower related level has been corrected and registered, and prompting the user to confirm and correct the contents of the correction. The related data recognition device according to claim 1 or 2, further comprising: