JPS629432A - Data editing method - Google Patents

Abstract

PURPOSE:To facilitate an easy editing job by editing the timber structure data after converting the data shown in a timber structure into a data constitution of a subject relation model based on the rule information. CONSTITUTION:A sentence structure timber 93 stores the data on the timber structure extracted out of a data base management system 91 by a conversion package 94 based on a conversion rule 92. The package 94 extracts data out of the system 91 by the indication of the control 96 and according to the rule 92 for production of the timber 93 and stores data in the system 91 through the tree 93 and based on the rule 92. A display editor 95 displays the data on the timber 93 on a display device 97 according to the rule 92. Thus the addition and deletion of data are possible while the timber structure is maintained.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a data editing method, and particularly to a data editing method suitable for editing data corresponding to an entity relationship model.

[Background of the invention]

Conventionally, there is l8DO8, developed at the University of Michigan in the United States, which can edit data using an entity-relationship model (I
I Te1chroen and M, Ba5tar
ache.

“Problem Staten J”
t Language): Language, reference
ManualLanguage l'Reference
Manual, /1nn Arbor.

Michigan, I)partment of
Industrial andQperations
Engineering [Juniversity o
fMichigan 1975).

This system serves as a user interface.

P 8 L/P 8 A command group and l5DO
It has a program interface called 8/DM.

When the user attempts to edit data.

P S for creating, deleting, updating, and referencing entities, relationships, @ness, etc.
Should it be input as a command string for L/PSA?

Alternatively, it is necessary to construct a new system for each target data editing unit using l8DO8/DM.

With this in mind, in the former case, the use of the information displayed in the command input procedure f1 requires human intervention, which not only has low man-machine performance, but also reduces reliability due to input errors and reduces work man-hours. Increase occurs.

In addition, in the latter case, since only specific data editing can be performed, the effect is due to the fact that it is originally defined using an entity relationship model.

It is not possible to provide data at the stage the user wants to see.

For example, in the case of the production management system shown in FIG. 2, the following three diagrams are data processed using the entity relationship model.

In Figure 3, the entity set 1 is "parts", and the set 2 is "production line", the attributes of "parts" are "parts", "part name", and "shape", and the attributes of "production line" are "production line". There are "product", "production capacity", "current production speed", and "production line name".

There is a set 3 of relationships called "incorporation" between this "part" and "production line", and this "incorporation" has "unit of sending" as an attribute.

As elements of this schema, consider the data shown in Figure 9 (4) to 0. In Figure 9, element B1 of "part" is part A
is rMOOIJ and the part name is "motor".

The shape is rTAO3J. This data is expressed as elements of an entity relationship model as shown in Figure 3.

Here, for this element B1, the shape of one part ArMOOIJ is changed from rTAO3J to rTBO4J, and the shape of part m rM002J-t' rTTTTJ,! Figure 4 shows the results after the addition of the following data.

To perform this task, you generally need to input the following command group.

First, regarding changing the shape of rMOOIJ (1) As can be seen from FIG. 3, actual data is intricately intertwined, and it is impossible for humans to memorize it all at once. Therefore, the user inputs a command to check the current state of the database. In this example, the entity set name is "parts" and one part, the part whose light is rMOOIJ, is restored (an example of the operation is shown in FIG. 5 (4) α).

).

(2) Next, check the value of the corner pillar "shape" of the entity name "B1" (operation examples are shown in FIG. 5 (4) and (2)).

(3) Next, change the attribute “shape” of the entity name “B1” to rTB
Change to O4J (operation example is shown in Figure 5 (to) (3)).

This operation is necessary.

Next, about adding data.

(1) Check that the entity set name is "Parts" and data for the part ArMOO3J does not exist (see an example of operation in Figure 5 (4)
).

(2) Add an element to the entity set "parts" to be added and obtain the element name (an example of the operation is shown in FIG. 5(B) (5)).

(3) Map the data of "parts shop", which is the attribute of the element "B3" added in (2), to "Mo 002"j (an example of the operation is shown in (6) in Figure 5 CB).

(4) Update the "shape" data, which is an attribute of the element rB3J added in (2), to rT T T TJ (an example of the operation is shown in FIG. 5(B) (7)).

further operations are required.

In this ninth step, for example (6) in FIG. 5, even if the element name is mistaken for B1 instead of B3, it will be accepted as correct data, resulting in a meaningless database.

This becomes even more difficult when the amount of data and the number of operations per task increases because the data of the entity relationship model exists in an organic and network-like relationship.

Furthermore, data editors must be constantly aware of their own work procedures and must carry out their work while memorizing the data that has been displayed in the past on their terminals. Data was destroyed due to an error in this light work procedure.

An increase in work man-hours also occurs due to unclear work procedures.

On the other hand, in order to solve the above problem, there is a method to build a dedicated system for data editing, but since it can only support certain tasks, it is necessary to create a dedicated system for editing data. , system modification/
Additions must be made, and there are many problems in terms of maintainability.

[Purpose of the invention]

SUMMARY OF THE INVENTION An object of the present invention is to solve the above-mentioned drawbacks and provide a data editing method as a man-machine interface that allows data editing of an entity relationship model without errors and is easy to use.

[Summary of the invention]

The parent node number and eldest child node number in the tree structure are rule information for converting the data structure as an entity relationship model of the data editing unit into a tree structure.

The properties of each node 'f' are stored.
, the regular manifestation of the data structure ((direct product,
The identification information of a node with a 9-column Cartesian product (9 columns), or a node with an entity set name or relationship set name and a subset derivation condition in an entity relationship model, or a node with an entity set name and a subset derivation condition, is determined by the node number. memorize it in response to
Furthermore, the attribute name, attribute domain name, and display coordinate position of the node are stored in correspondence with the node number, and data in the entity relationship model is converted into a tree structure using the stored rule information. The entity name lfh is stored in the corresponding part of the converted tree structure.

It is characterized by storing data values, converting the data shown in the tree structure to the data structure of the entity relationship model based on the rule information, and adding and deleting data while maintaining the tree structure. .

[Embodiments of the invention]

The problems described above are problems that occur when data editing is performed on the entire database.

Generally, the content confirmation work and the actual editing work often use the same information, and in most cases only a portion of the database is required, rather than the entire database.

9. In general, data editing work is facilitated by having information in a tree structure, which makes it possible to optimally construct data that takes into account the meaning of the data.

In the above example as well, what can be captured as the sPa collection target is only the entity set name "parts" and its attributes "parts hazy" and "shape" as shown in the inner cylinder 6 of the entity relationship model in FIG.

That is, it can be seen that the elements shown in FIG. 3 shown in the above example need only be applied to those shown in FIG. All you need to know is that the elements shown in FIG. 8 will be the result of performing the same operations as in the previous example on this object.

The present invention facilitates data editing of an entity relationship model based on these points of interest. This will be explained below using examples.

FIG. 1 is an overall configuration diagram showing an embodiment of the present invention.

Database management system 91fl.

Data access is performed using an entity-relationship model.

The conversion rule 92 stores a correspondence rule between the data of the entity relationship model and the tree structure constructed at the time of editing. The details will be explained with reference to FIG. The syntax tree 93 stores tree-structured data derived from the database management system 91 by the conversion package 94 according to the conversion rules 92. The detailed structure is shown in FIG.

Conversion package 94 converts database management system 91 according to conversion rules 92 as directed by control 96 .
You can derive data from the syntax tree 93 and create a syntax tree 93.
3 is stored in the database management system 91 according to the conversion rule 92 as 7'-data. Conversion package 9
4 is shown in detail in FIGS. 12 and 13. The display/edit 95 displays the data on the syntax tree 93 on the display device 97 according to the conversion rules 92, and reflects data changes made by user operations on the syntax tree 93. Control 96 is 1 display editing 95
and controls the operation of the conversion package 94.

FIG. 10 shows the detailed structure of the conversion rule 92 shown in FIG. The conversion rule name storage area (OCRI~1 is conversion rule salt 1~i) is a storage area for the identifier of the conversion rule, and a unique name is given to the entire rule.

Node 5 storage area (CNN1~CNN,:n.

The number of nodes required for creating the conversion rule is a storage area for the job number assigned to represent the conversion rule t in the tree structure, and is also the node identification number in the tree structure.

Parent node planar storage area (CPNs-C8N,: n.

(same as two-tom) is the storage area of the parent node on the tree structure of node A in the same row.

First child node A storage area (C8N+ ~C8N,: n is
(same as node S) is a storage area of the eldest two-tom in the tree structure of two-toms in the same row.

No. 1 storage area (CB Nx - CB N- is n.

(same as two-tom) is the storage area of the second node on the tree structure of two-toms in the same row.

Node partition storage area (CNN1 to CNN,: n.

(same as two-tom) is a storage area that stores any of the following types of information held by two-toms on the same line.

/1) Structural information that represents the regular structure of the tree structure (referred to as structure nodes) C) Intermediate information that illuminates information on entity sets or relationship sets in the entity relationship model (referred to as intermediate nodes) (3) Attributes in entity relationship model A/ Attribute information (referred to as attribute node) representing information about the node property information storage area (NIl=NI, where n is the same as node A) differs depending on the node classification stored in the node classification storage area of the same row.

α) When the node classification is a structure node (node classification=structure node), the node property information is information that the structure node has a regular structure. Indicates whether it has a direct product or a direct profit sequence.

(2) When the node classification is an intermediate node (node classification = intermediate node) The node property information is information regarding the entity relationship model on the database.

(a) Set classification: Distinguishing information between entity set and relation set Φ) Set name: Entity set name or relation set name (C) Role name: Relationship between entity set and relation set Role name of relation set related to entity set in case (d) Condition...Entity set -? Represents the reference conditions set when referencing elements (data) of a relation set.

(3) When the node classification is attribute information (node classification =
Attribute node) Node property information is information regarding the entity relationship model on the database and information for display.

(a) I! Gender name: Entity set name or entity relationship model name.

Attribute of relationship set name (b) Definition area...Definition area corresponding to the attribute in (a) (e) Display case...Display location address (X, Y coordinates) where data corresponding to (a) should be displayed ) is memorized.

These pieces of information are stored together with the structure of the entity-relationship model using a structure node or an intermediate node as the root node. In other words, when there are multiple elements of a certain entity set, the parent of an intermediate node always has a "sequence" of node property information.
A node with the node classification "Structure node" is required.

FIG. 11 shows the detailed structure of the syntax tree 93 shown in FIG. Corresponding conversion memory name storage area (KMR1 to 1, where j
is the number of required syntax trees) indicates the conversion rule salt, or CCI, used when the present syntax tree was generated.

The two-tom storage area (KNN1~..1m is the number of nodes required to create a syntax tree) is a storage area for identification numbers given to express the syntax tree in a tree structure. It's also a number.

The parent node store storage area (K P N 1 to .1m is the same as the node storage area) stores the parent node store on the tree structure of the node A in the same row.

The first-born two-tom storage area (KSNs~msmu/-same as the do-ya) stores the first-born two-toms on the tree structure of two-toms in the same row.

The second node storage area (K B N r ~, , same as mld node A) stores the second obscurity on the tree structure of the two-toms in the same row.

Conversion rule node constitution storage area (K M RN I Nm
bm is the same as the two-tom), the two-tom conversion rule CCRJ of the conversion rule used to generate the two-tom node in the same row, the node, the arc -CNN*~
CNN, any one is stored.

Value storage area (KV Rs - KV R,: m is node A
) differs depending on the node classification of the tomb stored in the node A storage area of the conversion rule of the syntax tree in the conversion rule of the conversion rule name indicated in the corresponding conversion rule name storage area.

(1) When the node classification is a structure node, it has no meaning as a value.

(2) When the node classification is an intermediate node, as a value.

Has an element name.

(3) When the node classification is an attribute node, as a value.

The data value in the database is reflected as the attribute value.

The status (KST 1 to KST wa: rn is the same as two-tom) indicates the status of the value in the same row. 1) The data in the database is reflected or the entity name is included. (2) Database If the υ value is added by editing 1 and it does not exist in If deleted, r, D
Remember ELETEJ.

12 and 13 illustrate the operational logic of the conversion package 94 of FIG. 9.

FIG. 12 shows how a syntax tree is created from a database based on conversion rules.

FIG. 13 shows the logic for reflecting changes in the syntax tree to the database.

The logic in FIG. 12 receives conversion rules from the control and performs processing from the root node.

The node classification of the twotom is referred to in step 810, and the node classification is determined in step 82G.

If the resulting node classification is an intermediate water node.

The process moves to intermediate node processing step S30. If it is an attribute node, the process moves to attribute node processing step 5140. If it is a structure node, the process moves to structure node processing step 8160.

The intermediate node processing 830 refers to the set classification of the node performance information of the node referenced in step 810, and in the case of an entity set, moves to the entity condition reference step S80.

(;・In step 840, the parent node of the node referenced in step 810 of the conversion rule is The classification is "intermediate node" and the set classification of node property information is "entity set", and the name of the entity set.

Refer to the role name and condition, and then refer to the eldest child node in the same way, its entity set name, and role name 1 condition.

In step S50, the node set name and conditions referred to in step 810 are referred to.

In step 860, the elements of the relationship set based on the conditions referenced in step 840 and step S50 are referenced from the database.

At step 870, a parent totom representing the structure of the syntax tree according to the structure of the transformation rule.

Set the first child two-tom, node A, and make node A of the corresponding conversion rule the two-tom of the conversion rule.

Set the element name of the relation set element as the value and rOLDJ as the state.

In step S80, the conditions and set name of the node property information of the node referred to by node 810 are referred to.

In step 890, the elements of the entity set based on the conditions referenced in step S80 are referenced from the database.

In step 8100, if the transition has been made from step 870, the entity element on the eldest child side of the element in the relationship referenced in step 860, and if the transition has been made from step 890, Create an element in the syntax tree. into a syntax tree.

Set the parent node, the first child node A, and the second node that represent the thought structure according to the structure of the conversion rule, set the node grave of the corresponding conversion rule to node A of the conversion rule, and set the element name of the element of the entity set as the value. , set the state to roLDJ.

In step 5110, the first child node A corresponding to the node AK referenced in step 810 is referenced.

In step 5120, if the first child node referenced in step 8110 exists, the process moves to step 5125, and if the first child node does not exist, the process moves to step 8130.

In step 8130, the transformation package is called as the first child node/fi-parameter referenced in step 5110.

In step 8140, the parent node & corresponding to the node referenced in step SIO is traced to the one whose node classification is "intermediate node", and that node Af: all the nodes in the syntax tree that have it as node A of the conversion rule are black. Refer to the value of .

In step 8150, the attribute name of the node property information of the node referenced in step 810 is referred to.

In step 5155, the value of the attribute name referenced in step 5150 of the value referenced in step 5140 (i.e. entity name) is referenced from the database, and the parent two-tom and first child node representing the nine structure according to the structure of the conversion rule are added to the syntax tree. A
, the node number of the corresponding conversion rule is set as the node number of the conversion rule, the value of the referenced attribute name is set as the value, and the state Kr0LDJ is set.

In step 8160, a parent node, a first child node, and a node I6 representing a structure according to the structure of the conversion rule are set in the syntax tree, and the node A of the corresponding conversion rule is set as the node A of the conversion rule.

In step 8170, the eldest child node A of the node A referred to in step 10 is referenced.

In step 5180, step 5170 or.

If the reference is made in step 5200 and there are 9 nodes, the process goes to step 5190; if the 9 nodes do not exist, R, ETURN is performed.

At step 5190, the conversion package is called using the node determined at step 8180 as a parameter.

In step 8200, the node that was determined in step 5180 is referred to, and the process moves to step 5180.

FIG. 13 shows an algorithm for reflecting on the database the values of the syntax tree that have been edited one time.

(1) In step 8210, the set classification deleted as a result of [collection] searches all @ of the syntax tree of relation sets.

(2) At step 5220, the request group retrieved at step 5210 is deleted from the database.

(3) In step 5230, the set section deleted as a result of one edit searches all values of the syntax tree of the entity set.

(4) At step 8240, the element name searched at step 823G is deleted from the database.

(5) In step 5250, all values of the syntax tree whose set classification added as a result of editing is an entity set are searched.

(6) In step 826G, the element name searched in step 8250 is additionally registered in the database. then,
Set the registered entity name to the value of the syntax tree.

t'r) Search all the values of the syntax tree in which the set classification added as a result of one edit in step 8270 is a relational set.

(8) In step 8280, the element name searched in step 8270 is additionally registered in the database.

(9) UPDATE the result of 1 edit in step 5290
Alternatively, all attribute names marked as NEW and their parent element names are searched.

(10) In step 8300, the results searched in step 5290 are reflected on the database.

Note that the editing shown in Figure 1 involves traversing all the syntax tree nodes.
The value specified by the display location of the node ira of the conversion rule is displayed at the display location, and the user's operation is reflected in the syntax tree.

Next, this embodiment will be explained with reference to the cases shown in FIGS. 2 to 4 and 9.

FIG. 14 shows a tree structure representing the parts necessary for the same operation as in the above example. That is, the above operation is for the parts store and shape of the parts store "Moot" (see FIG. 7). A syntax tree created from the data in FIG. 7 according to this conversion rule is shown in FIG. 15. K1 to K5 are syntax tree twotoms.

The structure of the syntax tree resulting from the same editing as in the previous example is shown in FIG. That is, the value of 5 is changed from TiO2 to TBO4IC6 to the syntax tree node, and the state accordingly changes from OLD to UPDATE. Also 1
By adding the item, 6. is added to the syntax tree node. 7. 8. 9 is generated in the node, M2O3 is generated in the node 8, and 9 is generated in the node.
is set to TTTT, and the status becomes NEW. FIG. 17 shows an example of a man-machine displaying this syntax tree as a table image. In other words, the user can check the data in the displayed table and add, modify, or delete as necessary.

Here, a case will be shown in which it is applied to the configuration shown in FIG.

The conversion rule shown in FIG. 14 becomes as shown in FIG. 18.

FIG. 19 shows a syntax tree generated as a result of applying this conversion rule /I/ to the algorithm of FIG. 12.

The tore is equivalent to the nine shown in FIG.

That is, C1, which is the root node A of the conversion rule, is
Since it is a structure node, perform the process of step 160,
Generate node AKI of the syntax tree.

Since the conversion rule node l6C1 has the first child, the conversion node cage 94 is used as the node AC2t parameter.
Node &C2 calls the corresponding conversion program from
Since it is an intermediate node and is an entity, step 80 is executed to obtain one condition "Part A = M OOL 'j.In step 90, the element of the part entity set that satisfies the step 800 condition is referred to. In this example, the set is B1 Next, step 10
0, the eldest child node of syntax tree node AKI J1611C
Set K2, generate node AK2, and set the state to OLD in basket t-B1.

In step 110, the eldest child node AC3 of node AC2 of the conversion rule is referred to, and step 130t is executed. Node &C3 is a structure node, and in step 160, 3 is put in the eldest child node Puni of node AK2 of the syntax tree,
Generate node AK3. Step 170 refers to the eldest child node AC4, and step 190 is executed. Node A
C4 performs step 140 on the attribute node. Node A, which is the closest intermediate node to node AC4 in the conversion rule, has C2, and the node in the syntax tree associated with it has 2. The value of this node is B1.

In step 150, there is one part whose entity name is B1 &
See. In this case it is Mool. Step 15
In step 5, set the eldest child node AKK4' of read AK3 to generate node AK4, set C4 as the totom of the conversion root, ya, set M 001 as the value, and OLD as the state.

Next, in step 200, node AC5 is referred to and a syntax tree is created in the same manner as node AC4. As a result, the syntax tree shown in FIG. 19 is generated.

Next, FIG. 20 shows the result of editing the previous example. This means that the value of node AK5 in the syntax tree is UPDATE, and the value of node AK6. 7. 8°K9 is newly created.

Therefore, after the editing is completed, the results are reflected on the database according to the logic shown in FIG.

That is, in step 8260, an entity corresponding to 6 is generated in the two-tom, and in step 5300, the entity corresponding to 5 is added to the two-tom. 8. Modify the attribute value of 9.

This series of operations makes it possible to easily edit the data of the entity relationship model, that is, modify, add, or delete data.

〔Effect of the invention〕

According to the present invention, by simply defining conversion rules, the scope of the database to be edited is limited, and the user can easily carry out the editing work, thereby improving quality and reducing man-hours. effective.

[Brief explanation of drawings]

Figures 2 and 9 show examples of entity relationship models, Figures 3 and 4 show examples of data expressed by entity relationship models, and Figure 5 shows an example of a conventional man-machine. , FIG. 6 shows an example of the entity relationship model of the embodiment. Figures 7 to 8 show examples of data expressed in the entity relationship model of the embodiment, Figure 1 shows the overall configuration of the embodiment, and Figures 10 to 13 show examples of the data expressed by the entity relationship model of the embodiment. Detailed explanatory diagrams, FIGS. 14 to 20, show examples in which the data in FIGS. 7 to 8 are applied. are shown respectively. 91...f-database management system. 92... Conversion rule storage unit, 94... Conversion package. 95...Display editorial department.

Claims (1)

[Claims] 1. Rule information for converting a data structure as an entity relationship model in a data editing unit into a tree structure in a data editing method that adds, deletes, corrects, etc. data using an entity relationship model. The parent node number, eldest child node number, and younger brother node number in the tree structure are stored as information representing the properties of each node, and the node has a regular expression of the data structure (direct product, direct sum, sequence)
Alternatively, the identification information of a node having an entity set name or relationship set name and a subset derivation condition in the entity relationship model, or a node having an entity set name and a subset derivation condition is stored in correspondence with the node number, and Stores the attribute name, domain name of the attribute, and its display coordinate position in the node corresponding to the node number, converts the data in the entity relationship model into a tree structure using the stored rule information, and generates the conversion. Stores the stored entity name and data value in the corresponding part of the tree structure, converts the data shown in the tree structure into the data structure of the entity relationship model based on the rule information, and creates the tree. A data editing method characterized by editing structural data.