Abstract: A principal model is configured within a memory to facilitate automatic generation of at least one resource for use by a computer-executable application. At least one model item required for a task that is absent from the principal model is identified. The absent model item is instantiated in a decoration model that operates with the principal model to augment operational functionality of the principal model.

Abstract: Aspects include detecting that an extract transform load (ETL) job in an ETL system has been submitted for execution. The ETL job can include an input data storage location and an output data storage location. The ETL job is analyzed to predict whether execution of the ETL job will result in sensitive information being made accessible to an unauthorized user. The analyzing can be based on a sensitivity status of contents of the input data storage location and a data lineage of contents of the output data storage location. The ETL job is prevented from executing based on predicting that execution of the ETL job will result in sensitive information being made accessible to an unauthorized user. Execution of the ETL job is initiated based on predicting that execution of the ETL job will not result in sensitive information being made accessible to an unauthorized user.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: As disclosed herein a method determining whether a tree graph operation is a cutting operation. The method further includes, responsive to determining that the tree graph operation is a cutting operation, determining a cutting zone for the cutting operation, and identifying a developed node in the cutting zone that is to be retained in the tree graph, wherein the developed node is a root node of a shared subtree. The method further includes, responsive to determining the tree graph operation is not a cutting operation, attaching each child of the developed node to a parent of the developed node, and responsive to determining the developed node is a shared subtree with one or more children, attaching a reference to each child of the developed node to a parent of remaining undeveloped nodes. A computer program product and a computer system corresponding to the above method are also disclosed herein.

Abstract: As disclosed herein a method determining whether a tree graph operation is a cutting operation. The method further includes, responsive to determining that the tree graph operation is a cutting operation, determining a cutting zone for the cutting operation, and identifying a developed node in the cutting zone that is to be retained in the tree graph, wherein the developed node is a root node of a shared subtree. The method further includes, responsive to determining the tree graph operation is not a cutting operation, attaching each child of the developed node to a parent of the developed node, and responsive to determining the developed node is a shared subtree with one or more children, attaching a reference to each child of the developed node to a parent of remaining undeveloped nodes. A computer program product and a computer system corresponding to the above method are also disclosed herein.

Abstract: Aspects include detecting that an extract transform load (ETL) job in an ETL system has been submitted for execution. The ETL job can include an input data storage location and an output data storage location. The ETL job is analyzed to predict whether execution of the ETL job will result in sensitive information being made accessible to an unauthorized user. The analyzing can be based on a sensitivity status of contents of the input data storage location and a data lineage of contents of the output data storage location. The ETL job is prevented from executing based on predicting that execution of the ETL job will result in sensitive information being made accessible to an unauthorized user. Execution of the ETL job is initiated based on predicting that execution of the ETL job will not result in sensitive information being made accessible to an unauthorized user.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A principal model is configured within a memory to facilitate automatic generation of at least one resource for use by a computer-executable application. At least one model item required for a task that is absent from the principal model is identified. The absent model item is instantiated in a decoration model that operates with the principal model to augment operational functionality of the principal model.

Abstract: A principal model is configured to facilitate automatic generation of at least one resource for use by a computer-executable application. The principal model includes a group of classes, references, attributes, and associations between any of the classes. At least one model item required for a task that is absent from the principal model is identified. The absent model item is instantiated in a decoration model that operates with the principal model to augment operational functionality of the principal model. The decoration model includes a class, a reference, and an attribute for any corresponding one of the group of classes, references, and attributes of the principal model.

Abstract: Using metamodels during context-sensitive analyzes of reusable components of computer software applications, including identifying entry and exit paths into and from a reusable component within a metamodel of a computer application development environment, determining during a static analysis of a computer software application that navigation will proceeds along a path corresponding in the metamodel to such an entry or exit path, retaining, if an entry path, an identifier of an invoking node along the path within the computer software application, and, if an exit path, for each terminal node along each of a plurality of paths from the reusable component within the computer software application, comparing an identifier of an invoking node preceding the terminal node with the retained invoking node identifier, and determining, if the invoking node identifiers match, that the path among the plurality of paths is a correct path for a current context of the static analysis.

Abstract: Using metamodels during context-sensitive analyses of reusable components of computer software applications, including identifying entry and exit paths into and from a reusable component within a metamodel of a computer application development environment, determining during a static analysis of a computer software application that navigation will proceeds along a path corresponding in the metamodel to such an entry or exit path, retaining, if an entry path, an identifier of an invoking node along the path within the computer software application, and, if an exit path, for each terminal node along each of a plurality of paths from the reusable component within the computer software application, comparing an identifier of an invoking node preceding the terminal node with the retained invoking node identifier, and determining, if the invoking node identifiers match, that the path among the plurality of paths is a correct path for a current context of the static analysis.

Abstract: A principal model is configured to facilitate automatic generation of at least one resource for use by a computer-executable application. The principal model includes a group of classes, references, attributes, and associations between any of the classes. At least one model item required for a task that is absent from the principal model is identified. The absent model item is instantiated in a decoration model that operates with the principal model to augment operational functionality of the principal model. The decoration model includes a class, a reference, and an attribute for any corresponding one of the group of classes, references, and attributes of the principal model.

Abstract: Augmenting a model in a model-driven application development architecture, including defining a task to be performed on at least one model item of a principal model, where the principal model is configured to facilitate the automatic generation of at least one resource for use by a computer-executable application, identifying at least one model item required for use the task that is absent from the principal model, defining the absent model item in a decoration model, mapping the decoration model to the principal model, and storing both of the models on a computer-readable medium.

Abstract: A computer-executable application is provided with access to resources generated using a principal model. A decoration model associated with the principal model is instantiated for use by the application. The application is provided with access to an object of the decoration model responsive to a request by the application to access an object of the principal model. The decoration model object corresponds to the principal model object.