Caution

  • If system customizing changes are made to data tables or data items (e.g. new data items are created, data item parameters are changed), the Tools → Restart PLANTA service menu item must be executed in order to make the changes visible.
    • Note: If you click on the menu item, all open client connections (sessions) are closed. During restart, new client connections are not possible. This does not apply to changes made to I-texts, e.g. changes to the DI name or adjustment of value ranges (also of the VR type).
    • Before restarting the service, the target directory must be deleted so it can be created anew upon server restart in order to make sure that the POJO classes contained in it, which are responsible for the meta data of the data dictionary, are generated anew.

DI000277 Index

  • The index is the identification of the primary ID of a data table. Each data table belongs to exactly one index.
    • Example: Data table 461 Project: Index 461
  • The 1:1 relation of a DT is the basis for the name.
  • Example for naming indexes:
    • DT461 Project
    • Index: 461
    • Variable name: ID461

Note

  • All foreign key and primary key constraints on the database must also be stored in the Data Dictionary.

DI000278 ID of DI

Relations go from an ID no. in a data table to an index. This ID number can be formed from one or more data items. The entry here is the first DI which forms part of the ID no.

Note

  • For type = 2 relations: DI of the node ID.
  • The sequence is based on the DBPos from the data item.
  • Relations are only supported if they are of the same data type.
See also: ID to DI

DI000363 ID to DI

Last data item which forms part of the ID no. of the relation.

Note

  • For type = 2 relations: DI to of the node ID.
  • Relations are only supported if they are of the same data type.
See also: ID of DI

DI000279 Relation

The relation for a set is specified as the frequency of occurrence in the data table for any index:

Values

  • 1:1 = In the data table, an ID number equal to the index may appear only once
  • N:1 = In the data table, an ID number which is equal to this index may appear in an arbitrary number of records.

DI000951 Variable name

Contains the name of the ID in the database syntax

Examples

  • DT463 Task DT463 "Task" has a N:1 relation to DT461 Project.
    • The data item in data table 463 is called "ID461".
    • In the relation the variable name is = "ID461".
  • DT465 Link has two N:1 relations to DT463 Task.
    • As a result, there are two items in data table 465: "ID463A" and "ID463B".
    • The first relation has the variable name = "ID463A", the second has the variable name = "ID463B".

DI000281 Deletion flag

The delete flag determines the behavior when records are deleted that have a link to records in other data tables.

  • In the data table which has the same ID no. as the index for the relation under consideration, one record will be deleted (referred to below as current record ). What happens to records linked to it which are in the data table to which this relation belongs?

Values

  • 0: Linked records are deleted without asking for confirmation.
  • 1: Query, and if appropriate delete the linked records after the user gives positive confirmation. If the user answers the query with No, the linked records will not be deleted and the current record will not be deleted either.
  • 2: The dependent records may not be deleted. This means that the current record itself also cannot be deleted.
  • 3: The relation will be ignored when deleting. The current record will always be deleted, even if the relation concerned means that it has dependent records.

Example

  • Data table = 461 Project
    • Relation: Index: = 463, Deletion flag = 2
  • Result:
    • If a project is to be deleted in DT461 Project, and there are corresponding tasks in DT463 Task, these tasks must not be included in the deletion. As a result, the project itself also cannot be deleted.

Note

  • Deletion flag = 3 may only be used for relations which do not have to be satisfied. Otherwise, data arises which is application-logically invalid.
  • Used mainly for relations between different databases when a deletion cannot or may not be performed in the other database at the same time.

DI000379 Create implicitly

Determines the behavior of the software in the event that a parent record, required by a relation, is not present

Values

  • 0: An error message is displayed if the parent record does not exist.
  • 1: If the parent record does not exist, it is created.
  • 2: The record is created implicitly, the error message is suppressed.
  • 3: The relation is ignored during creation, and no dependent record is created if it is not already present.

DI001978 Recursion ID from

Recursion ID from First data item which is an element in the ID of the successor node. Is only used for Rel. type = 2.

DI001979 Recursion ID to

Recursion ID to Last data item which forms part of the ID of the successor node. Is only used for Rel. type = 2.

DI000374 Relation type

Relation type

Values

  • 0: is considered a quantity relation by PLANTA
  • 1: remains unconsidered in the internal determination of module logic in PLANTA
  • 2: Recursion relations

Example

  • Unconsidered relation:
    • Task link: the second relation (to the predecessors) has Rel. type = 1
  • Recursion relation:
    • Module with at least 2 areas:
      • a node area (area 1): the data (records) in this area are to have a structured representation.
      • a linkage area (area 2): the data (records) in this area contain the structure information
    • Example
      • Area 1: Procedure; they are to be displayed in the network as node
      • Area 2: Link; these say what successors the parent task (node) has
      • It must be possible to find the records in area 2 by means of a normal database relation.

Information in the Data Dictionary

  • The following is described in the data dictionary:
    • a) Path from a node to the linking object
    • b) Path from the linking object to the next or subordinate node
    • This is effected via 2 recursion relations.
  • These specify
    • for a) (in the first recursion relation):
    • for b) (in the second recursion relation):
      • 1: DI(s) which form the ID of the next or subordinate node ( Rec. ID from, Rec. ID tocolumn) error
      • 2: DI(s) which form this node ID (ID of the successor) in the linking object ( ID of DI, ID to DIcolumn) error
  • In the example,
    • a1: is the task ID in the task
    • a2: is the ID of the task’s predecessor in the link
    • b1: is the task ID in the task
    • b2: is the ID of the task’s successor in the link

Information in module area assignment

  • Res. parent area

Information in the area

  • DIs of class 8 for information on the required link type.