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: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

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: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

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: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

Abstract: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

Abstract: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

Abstract: Data management and control, including obtaining an importance level associated with a data item, identifying a data entry interface as a source of the data item, associating the importance level with the data entry interface, and performing an action corresponding to the association of the importance level with the data entry interface.

Abstract: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

Abstract: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

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: Data management and control, including obtaining an importance level associated with a data item, identifying a data entry interface as a source of the data item, associating the importance level with the data entry interface, and performing an action corresponding to the association of the importance level with the data entry interface.