JPH05134911A - Information constitution control method - Google Patents

Abstract

PURPOSE:To store information on a work process like the decentralization information on the specification, the information on the specification under development, etc., on the same data base by adding the semi-relation, the decentralization relation, and draw-out relation to a substance/relation model. CONSTITUTION:The semi-relation showing an incomplete state, the decentralization relation showing a decentralized state, and the draw-out relation showing the conversion of structure carried out based on a certain rule are added to a substance/relation model. Thus a concept model is obtained. The substance/ relation model expresses a real world in the relation defined between the substances and is used for the concept design of a data base. Then this model consists of a substance set 92, a relation set and the attributes, e.g. a substance set 91, a generalized substance set 92, a relation set 93, and a weak relation set 94. Furthermore a semi-relation set 95, a decentralization set 96, and a draw-out relation set 97 are added together with a substantialized relation set 98 and an attribute 99.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for managing the configuration of information in a database for a computer environment (CASE) that supports software engineering, and particularly to the configuration management of information in a database constructed on the basis of an entity / relationship model. Regarding the method.

[0002]

2. Description of the Related Art Conventionally, various proposals have been made to improve CASE. Specifically, a system using commands, a system using structural rules, a system with extended source language specifications, and a database-based system have been proposed. In a system centered on this database, much research has been done on a software engineering database (SEDB) that integrates and stores and manages data necessary for software engineering. For example, “Yoshihiro Matsumoto, Data Model of Soft Engineering Database SEDB / OKBL, Information Processing Society of Japan, Vol. 30, N.
o. 9 (1989), pp. 1154 to 1163 ”, a database based on an object-based data model that integrates an object model and a semantic model is proposed, which is in an experimental stage. However, the method of managing information related to software development in the database based on the entity / relationship model is not described.

[0003]

In the above prior art, the database based on the entity / relationship model performs a series of operations for guaranteeing the consistency of the software specification information according to the schema defining the information structure model. However,
No consideration was given to the fact that incomplete specifications during development could not be described, distributed information could not be managed, and structure conversion based on certain rules could not be handled. Accumulation of information on software development work processes There was a problem that it was difficult to manage. An object of the present invention is to provide a method for managing the configuration of information by a database that solves such problems, stores and manages information related to software development, and supports development work in which this information is processed and transformed. It is in.

[0004]

In order to achieve the above object, an information structure management method of the present invention comprises a database for accumulating information according to an entity / relationship model and a data processing device for operating the database. In the provided information processing system, in the entity / association model, a relationship (semi-association) indicating that the relationship between the entities is not in the incomplete state that does not satisfy the specified constraint condition, and the entity on the main side There is a relation (derivative relation) that indicates that the structure is transformed to the subordinate entity based on the specified rule (derivative relation) and a relation (dispersion related) that one entity is distributed / reproduced. When a data processing device is added, and a database using this as a conceptual model is constructed, and the entity / relationship model is in a complete state that satisfies the above constraint,
If a semi-association is converted to a semi-association, or if an incomplete state that does not satisfy the above constraint conditions is reached, the process of converting the semi-association to a semi-association is performed, and based on the specified rule, the It performs the process of converting the structure of the side entity to the subordinate side entity, and also distributes / replicates the information of the specified entity set based on the specified distribution method, or the set of distributed entities, It is characterized by accumulating and managing information about the software development process by performing the integration process based on the specified integration method. Also,
The above semi-association information can be used as a semi-association method, an entity as an attribute method, a relationship as an attribute method, a complete entity as an attribute method, or an incomplete entity as an attribute method. There is a way.

[0005]

In the present invention, by adding the semi-relationship, distributed relation, and derivation relation to the entity / relationship model,
It is possible to store not only software specifications but also information about work processes, such as distributed information of specifications and specifications in development, on the same database. By tracing the relationship of these information, it is possible to support various work depending on the user's position and development process such as change spread analysis, backtrack work support, project management support, etc. In addition to reducing the number, it is possible to rationalize and improve the work of the user.

[0006]

DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 2 is a configuration diagram of an information processing system to which the information configuration management method of the present invention is applied. In FIG. 2, reference numerals 20 and 21 denote a main storage device and an auxiliary storage device that store data, 22 an input / output device that controls input / output, 23 a central processing unit that performs arithmetic processing, and 24 a communication control device that controls communication. And these constitute the hardware environment of this embodiment.

Here, the entity / related model in this embodiment is
The following is an outline of the rules. In this embodiment, the conventional entity
The relational model is divided into semi-relationships that represent incomplete states and distributed
Relations that represent states that are in motion and a structure based on a rule
Add a derivation association that represents a transformation, and use this as a conceptual model.
ing. First, regarding basic operations of entity / related models
Describe. The entity / relationship model is based on the real world
ty) and the relationship between the entities (Relationship)
A data model expressed in terms of a database concept
Widely used in design. This is the entity set (E
Entity Set), Associations (Relations)
hip Set), and attribute (Attribute)
Composed of. Then, based on the entity / relationship model,
The data manipulation system for the database is mainly composed of entity sets.
It is composed of basic operations such as join, direct product, projection, selection, etc.
Can be defined as an algebraic system that is The general form is Σ = Γ1 θ Γ2 ..., where Σ and Γi represent the entity set and θ represents the set operation.
There is. Database of database according to entity / relationship model
The element data is a specific entity set, related set, or attribute
Is. The underlying definition is called a data schema. Up
In the equation, Γi on the right side belongs to a certain data schema.
is doing. At this time, the data schema indicated by Σ on the left side is
From the right side of the data schema limited by each operation θ
It is derived based on the inheritance rule to the left side. Then each operation
The function of is specifically described. Figure 3 shows the data operation system.
Fig. 4 is an explanatory diagram of the join operation in the data manipulation system.
Fig. 5 is an explanatory diagram of Cartesian product calculation, and Fig. 5 is projection in the data operation system
Explanatory diagram of calculation, Fig. 6 shows selection operation in data manipulation system
FIG. Note that FIG. 3 is divided into FIG. 3A and FIG. 3B.
ing. FIG. 3A is an example of a symbol mark, and 31 is a substance.
Set, 32 is related set, 33 is attribute (group), 34 is no
Indicates Join operation (Join) starts a certain entity set.
As a point, it has the function of tracing the related set. The general form is E = E₁* R (E₂, E₃,…) The meaning of this is as shown in FIG. 3B.
is there. E₁The occurrence of E corresponds to the occurrence of
I am responding. E₁The attribute of is inherited to E as it is.
Furthermore, R is transformed into a node of the attribute (multivalued attribute),
The attribute of R is inherited as a subordinate attribute of node R. Well
E attached to R₂, E₃Is subordinate to node R
Attributes of each entity, noded as single-valued attributes
Is further inherited as a subordinate attribute to this node. Na
Oh, E₁There is a one-to-one correspondence between the elements of and the elements of E,
This operation is not commutative. In addition, the direct product operation (Produc
tion) is virtually all pairs between two entity sets.
It has the function of getting a match. The general form is E = E₁** E₂  Is. The meaning of this is as shown in FIG.
It E₁Occurrences of E correspond to occurrences of
And E₁The attribute of is inherited to E as it is. Well
E₁One occurrence of E₂All occurrences of
It is nodeized and combined as a dependent attribute. E₂Attributes of
Is inherited as an attribute of this node. The main performance
Arithmetic does not hold commutative or associative rules. In addition, the projection operation (P
is a machine that transforms the attributes of an entity set.
Have the ability. Its general form is E =% π (E₁) Is. This means as shown in FIG.
It E₁Occurrences of E correspond to occurrences of
ing. Also, E₁Attribute a₁Is defined by π
Transformed according to the attribute conversion rule, a₁’ this
The operation is E₁Applied uniformly to all elements of. here
The projection operator of is more generalized and structured
A framework that can define arbitrary structural transformations even for attributes
have. Detailed logic of the program and source code
Information that has a tree structure, such as information about
Tree operations targeting these are handled as attributes
Is specified in the operation system of π. Also, the selection operation
(Selection) is from the given entity set
It has a function to extract the ones that satisfy the specified conditions. So
The general form of is E = | σ (E₁) Is. This means as shown in FIG.
It E₁For the occurrence of
It becomes an occurrence of E. E₁The attribute of is the genus of E
Inherited by sex. E is E₁Is a subset of. Furthermore
, The basic set operation (Basic Set Operat
union, difference set, product (common) set operation
Respectively E = E₁+ E₂, E = E₁-E₂, E = E₁． E₂  Express with. An overview of such data manipulation languages based on pairing
The point is shown below by the syntax rule according to the AN notation. In addition, below
What is preceded by a line is the constituent symbol of the language. <Set expression> = <association set> | <direct product set> | <projection set> | <selection set> | <union set> | <difference set> | <common set> | <extended definition set> | <set identifier> <Combined set> = _ {<main set> _ * [<role name>] [<related set name>] [<role name>] _ (<dependent set> _) {_,} _) _} <direct product Set> = _ {<Main set> _ ** _ (<Slave set> _) _} <Projection set> = _ {<Main set> _% <Tree operation specification> _} <Selection set> = _ {< Main set> _ | <Condition specification> _} <Union set> = _ {<Main set> _ + _ (<Slave set> _) _} <Difference set> = _ {<Main set> ___ (<Slave set > _) _} <Common set> = _ {<main set> _. _ (<Dependent set> _) _} <extended definition set> = _ {<set element> {_,} _} <set identifier> = [<role name> _:] <set name> <main set> = <Set expression> [<Side effect child>] <Side effect child> = _! <Subset> = <Set Expression> A specific example of data manipulation using this language is shown in FIG.
As shown in FIG. FIG. 7 is a data operation for extracting list information.
An example diagram and FIG. 8 are data operation example diagrams of function specification extraction. An example
For example, in the specification database schema shown in FIG.
On the other hand, a list (display) schema in the order of names shown in (b)
Is an occurrence that asks for a Pack List.
As an element set that becomes, {Pack List ** (Package)}% Or
der_by Name}. In addition, the specification data shown in FIG.
Named'F1 'for database schema
Of a function that has (Name),
Get the (display) schema of the name-ordered list shown in (b)
The operation is {{Function | Name == “F1”} * Pa
It can be represented by rametwr (Variable).

Next, the relationship added in this embodiment will be described. In the present embodiment, the entity / association model to which the following relationships (a) to (c) are added is called an “extended entity / association model”. (B) Semi-relation This is a relation set that represents an incomplete state in which relations between entities do not satisfy constraints such as the absence of entities. Note that a semi-association is an association that satisfies a constraint condition such as the existence of an entity in the conventional entity / association model is called a "normal association". A semi-association eventually results in a positive association. This allows not only complete information but also incomplete information to be stored in the database. Also, if there is semi-association information, one association, or semi-association information between a complete entity and an incomplete entity is the attribute of that incomplete entity, or conversely Or attribute. (B) Derivation relation This is a relation set representing a mode in which the main body entity is structurally transformed based on a certain rule to become a subordinate entity. With this, it is possible to handle the relation of the structure conversion via the tool. (C) Dispersion-related This is a relation set representing a mode in which the subordinate entity is a duplicate of the master entity. This makes it possible to handle information that is physically divided and duplicated. Further, the data operation system for the database based on the extended entity / relationship model can be constructed similarly to that in the entity / relationship model. FIG. 9 is a symbol example diagram for diagramming the extended entity / association model in one embodiment of the present invention, and FIG. 10 is a schema description example diagram of software specifications using the symbols shown in FIG. In FIG. 9, 91 is an entity set, 92 is a generalized entity set, 93 is a related set, 94 is a weak related set, 95 is a semi-related set, 96 is a distributed related set, 97 is a derived related set, and 98 is a materialized related set. A set, 99 is a symbol indicating an attribute, and symbols 95 to 97 are added in this embodiment. In addition, FIG.
Is a schema description example of software specifications including the concept of configuration management drawn using these symbols, and expresses the following matters (1) to (9). (1) As a Member of Project, Desi
There are gner and Coder. (2) Designer is the development of Project (De
v), and the development period (Interval) is managed. (3) Mo as a component (Inc) of Package
There is a rule and a variable. That is, the existence of the latter depends on the existence of the former. (4) Module calls Module (Cal
ls) does not necessarily call the Module
Does not have to be assumed. Module called at the stage of creating the specification of the module to be called
Does not exist, but this calling relationship is a semi-related Cal
It can be defined by ls. This semi-association is converted into a positive association Call when the specification of the called Module is created. (5) The relation that the Module accesses the Variable (Accesses) is not necessarily the Var.
It is not necessary to assume the existence of the iable. (6) Logic design is M defined by modular design.
Duplicate external specifications of module (Distribute)
I will do it in another place. When the design is completed, the specifications are integrated following this relationship. (7) The internal specifications of Module are described by the attribute Exp that has a complex structure. (8) Source Code is Module
Created by structure conversion based on a rule from the specifications of (G
is erased). (9) Object Code from Source Code through Compiler, and then Link
An Executeable Code is created via r.

The conversion process between the relationships will be described below. FIG. 1 is a flowchart showing a conversion process between a semi-association and a positive association according to an embodiment of the present invention. In this embodiment, when the conversion instruction is issued (101), the related type is checked (102), and the constraint condition corresponding to the type is checked (103, 104). Then, if the constraint condition is satisfied, conversion processing corresponding to the type is performed (105,
106) If not satisfied, error information is set (107) and the process ends. FIG. 11 is a flowchart showing the structure conversion processing in the embodiment of the present invention. In this embodiment, when a conversion instruction is issued (110
1) Extract the information of the entity on the main side to be converted (11
02), the structure is converted according to the rule (1103), and the result is stored in the database as information of the subordinate entity (1104). The rules for conversion are given by a prescribed method, but can also be given as an existing tool name and a group of options associated with it. FIG. 12 is a flowchart showing the decentralization processing according to the embodiment of the present invention. In this embodiment, when a distribution instruction is issued (120
1), the specified distribution target is extracted (1202), the next entity included in the distribution target is searched (1203), and if there is an entity (1204), the distribution relation having the specified attribute for this Is created (1205). The previous processing is performed until the next entity included in the distribution target disappears. Next, a copy of the extracted distribution target is created (1206) and stored in the specified distribution destination database (1207). In addition,
This decentralized processing may be provided with a plurality of databases, and an entity designated by a certain database may be dispersed / replicated to another database or may be dispersed / replicated by a plurality of data processing devices. FIG. 13 is a flowchart showing the integration process in the embodiment of the present invention. In this embodiment, when an integration instruction is issued (130
1) The specified integration target is extracted (1302), the next entity included in the integration target is searched (1303), and if there is an entity (1304), the original and the copy are compared (130).
5) If the access status of the copy is read-only (1
306), the original is adopted (1307), and if the copy is updated, the copy is adopted (1308). After that, the previous processing is performed until there is no entity included in the integration target. FIG. 14 is a flowchart showing the change ripple analysis processing in the embodiment of the present invention. In the present embodiment, when the content of change and modification is instructed (1401), the distributed relation possessed by the entity which is the object of change is searched according to the schema (140).
2). If there is no distribution relation, the process ends. If there is a distribution relation (1403), the information (distributed information) of the subordinate entity is changed (1404). Further, the derivation association of the subordinate entity is searched (1405), and if there is no derivation association, the next distributed association processing of the modification target entity is executed (1402). If there is a derivation relationship (140
6) The information to be derived (hereinafter referred to as derived information) is changed (1407), and the process related to the derivation of the derived information is executed (1405). For example, when the interface of “Module” is changed according to the schema shown in FIG. 10, the specification of “Module” created by the duplication and distribution (Distribute) and the derived “Source Code” to “Object C”.
“Code” and “Executable Code”. The database of this embodiment can also be configured by using a relational database.
In this case, the consistency check is performed, for example, at a specified time or at regular time intervals so as to loosen the exclusive control for each transaction and prevent a deadlock.

[0010]

According to the present invention, it is possible to construct a database for accumulating and managing information related to software development processes such as distributed information of specifications and specifications in development, in addition to software specifications. Therefore, by tracing the relationship of the information, it is possible to support various work depending on the position of the user and the development process, reduce the burden on the user, and rationalize and streamline the work of the user. It is possible to plan.

[0011]

[Brief description of drawings]

FIG. 1 is a flowchart showing a conversion process between a semi-association and a positive association according to an embodiment of the present invention.

FIG. 2 is a configuration diagram of an information processing system to which the information configuration management method of the present invention is applied.

FIG. 3A is a part of an explanatory diagram of a join operation in a data operation system.

FIG. 3B is a part of an explanatory diagram of a join operation in the data operation system.

FIG. 4 is an explanatory diagram of a direct product calculation in a data operation system.

FIG. 5 is an explanatory diagram of a projection calculation in a data operation system.

FIG. 6 is an explanatory diagram of a selection calculation in the data operation system.

FIG. 7 is a diagram illustrating a data operation example of list extraction.

FIG. 8 is a diagram illustrating a data operation example of function specification extraction.

FIG. 9 is an example symbol diagram for illustrating an extended entity / association model in one embodiment of the present invention.

10 is a diagram illustrating a schema description of a software specification using the symbols shown in FIG.

FIG. 11 is a flowchart showing a structure conversion process in an embodiment of the present invention.

FIG. 12 is a flowchart showing decentralization processing according to an embodiment of the present invention.

FIG. 13 is a flowchart showing an integration process according to an embodiment of the present invention.

FIG. 14 is a flowchart showing a change ripple analysis process according to an embodiment of the present invention.

[Explanation of symbols]

 20 main storage device 21 auxiliary storage device 22 input / output device 23 central processing unit 24 communication control device 31 entity set 32 related set 33 attributes (group) 34 node 91 entity set 92 generalized entity set 93 related set 94 weakly related set 95 half Related set 96 Distributed related set 97 Derived related set 98 Materialized related set 99 Attribute

Claims (15)

[Claims] 1. A method for managing configuration of information in an information processing system comprising a database for accumulating information according to a data model represented by entities and associations, and an information configuration management method for an information processing system, comprising: The model includes a semi-association set that indicates that the relationships between entities are in an incomplete state that does not satisfy the specified constraints,
A method for managing configuration of information, characterized in that, when the data model is in a complete state satisfying the constraint condition, a semi-relationship is converted to a positive association. 2. An information configuration management method of an information processing system comprising a database for accumulating information according to a data model expressed by entities and associations, and a data processing device for operating the database, comprising: The model includes a derivation related set that represents that the structure-transformed entity of the master side based on the designated rule is the slave side entity, and based on the designated rule, the master side entity to be converted is defined. A structure management method for information, characterized in that the structure is converted into a subordinate entity. 3. An information structure management method of an information processing system comprising a database for accumulating information according to a data model expressed by entities and associations, and an information configuration management method of an information processing system, comprising: The model includes a distribution-related set that represents the existence of distribution / replication of one entity, and is characterized by distributing / replicating the information of the set of specified entities based on the specified distribution method. How to manage the configuration of information. 4. The information structure management method according to claim 1, wherein when the data model is in an incomplete state that does not satisfy the constraint conditions, the positive relation is converted into the semi-relation. 5. The information structure management method according to claim 1, wherein the semi-related information representing the incomplete state has an attribute of the data model entity. 6. The information structure management method according to claim 1, wherein the relation of the data model has an attribute of the semi-relation information indicating the incomplete state. 7. The data model includes semi-relational information representing that an association between a complete entity and an incomplete entity is in an incomplete state that does not satisfy specified constraints. 5. The information structure management method according to claim 1, wherein each entity has an attribute. 8. In the above data model, the semi-association information indicating that the relationship between a complete entity and an incomplete entity is in an incomplete state that does not satisfy the specified constraint condition is included in the data model. The information structure management method according to claim 1, wherein a complete entity has an attribute. 9. The information structure management method according to claim 2, wherein the designation rule is designated by an existing tool name and an accompanying option. 10. The information structure management method according to claim 2, wherein if the specifications to be converted are not formed by an existing program, the specifications are extracted from the existing program. 11. The information structure management method according to claim 3, wherein the set of distributed entities is integrated based on a specified integration method. 12. The information according to claim 3, wherein the database is composed of a plurality of databases, and a set of entities specified from a certain database is distributed / replicated to a database other than the database. Configuration management method. 13. The data processing apparatus according to claim 3, wherein a plurality of the data processing apparatuses are provided, and a set of designated entities is distributed / copied to the plurality of data processing apparatuses based on a designated distribution method. Information structure management method. 14. The processing of the data processing device comprises: a step of analyzing a change spread range based on an instructed change content; and a step of changing information of the change spread range analyzed in the analysis step. The information structure management method according to any one of claims 1 to 13, wherein: 15. When the database is constructed based on a relational database, exclusive control for transactions is loosened, and data consistency check is performed at a designated time or every fixed time. A method for managing configuration of information according to claim 1.