International Business Machines Corporation

Peter Gerstl

Albert Maier

Oliver Suhre

Thomas Schwarz

Michael Baessler

Mike W Grasselt

Dirk Seider

Frank Neumann

Werner Schuetz

Magnus Karlsson

Yannick Saillet

Andreas Arning

Roland Seiffert

Simon D Moser

Jochen F Doerre

Thomas A Hampp-Bahnmueller

Alexander Lang

Kunjavihari Madhav Kashalikar

Robert Kern

Sebastian Goeser

Bernhard Mitschang

Joerg Erdmenger

Daniel C Wolfson

Mariya Chkalova

Jonathan Roesner

Daniel S Haischt

Brian Heumann

Adrian Mueller

Florian Funke

Ulrich Hofmann

Enrico Regge

Michael Beck

The present disclosure relates to a method of metadata enrichment using an enrichment comprising multiple steps. The method comprises: determining for an input data asset a metadata value descriptive of the input data asset. Characteristics of the metadata value of the input data asset may be determined. At least one informativeness score of the metadata value of the input data asset may be computed using the determined characteristics. An execution of the enrichment step may be skipped in case an input characteristic of the enrichment step is not part of the determined characteristics. In case the input characteristic of the enrichment step is part of the determined characteristics, the enrichment step may be adapted and executed or the enrichment step may be executed without adaptation. Labels resulting from the executed enrichment steps may be combined for providing one or more labels of the data asset.

Optimizing metadata enrichment of data assets

A system may receive a data glossary comprising a list of terms. The system may then measure a usage dimension for a set of the terms from the list of terms. The system may select a candidate term from the set based on the usage dimension and perform a maintenance action on the candidate terms.

Maintenance of a data glossary

A method, system, and computer program product for implementing automated serverless runtime container allocation is provided. The method includes defining a number of runtime containers and associated characteristics required for each worker node of a plurality of worker nodes for execution of a specified workload. The specified workload is dispatched to the plurality of worker nodes and a specified portion of the specified workload is assigned to each worker node. An application executing a universal runtime container that includes potential application runtimes and associated supported software versions within a layered modifiable format is generated and unused layers are removed from the universal runtime container. The specified workload is executed via the universal runtime container and a set of available universal runtime containers is refilled on an associated work node.

Serverless runtime container allocation

Aspects of the present invention disclose a method, computer program product, and system for governing a set of information assets using an information governance system. The method includes one or more processors applying one or more high-level classification assignment rules to one or more information assets of the set of information assets. Furthermore, the method includes one or more processors applying one or more high-level classification propagation rules to the one or more information assets provided with the high-level classification assignments for propagating the respective high-level classification assignments upwards within a containment hierarchy formed by the set of information assets to one or more superordinate information assets of the set of information assets.

Determining and propagating high level classifications

In an approach, a processor groups documents into a plurality of groups based on similarity, where: documents of each group have a same document structure; and the document structure is defined by coordinates of text blocks. A processor, for each group of the plurality of groups and for each document of the respective group: retrieves a value of each text block of the respective document in accordance with a document structure of the group; and assigns to each text block of the respective document an attribute that represents the retrieved value of the text block. A processor assigns a first document of the documents to an entity of a database that matches the first document based on the group of text block values and the assigned attributes of the document.

Assigning documents to entities of a database

The present disclosure relates to assigning an ownership of a first component of a communication system. A processor may identify a second component of the communication system having a relationship to the first component. The processor may identify an owning entity of the second component, the owning entity may have ownership of the second component, and the communication system may include the owning entity. The processor may generate an owner information, the owner information may relate the owning entity of the second component to the first component. The processor may provide the owner information to the communication system. In response to the providing of the owner information, the processor may receive a command for assigning the ownership of the first component to the owning entity. In response to receiving the command, the processor may assign the ownership of the first component to the owning entity.

Ownership assignment for a communication system component

A method, system and computer program product for classifying a data collection of data of a predefined domain. A hierarchical representation scheme describing terms of the domain and one or more relationships between the terms is provided. At least one classifier may be applied on the data collection, resulting in a set of term assignments. Each term assignment of the term assignments associates a term candidate with a respective confidence value to the collection or to one or more data items of the collection. At least one of the term assignments may be refined based on the representation scheme and the set of term assignments.

Refining classification results based on glossary relationships

The present disclosure relates to a method for accessing data of one or more data sources using a discovery engine. The method comprises: determining a discovery space content from initial metadata of a data source indicated in a data exploration request. The discovery space content may be rendered. The rendered content may be used for determining a set of one or more tasks for generating further metadata from at least part of the data of the data source, wherein the set of tasks comprises a combination of API calls. The API calls may be issued to the discovery engine. Discovery results of the issued API calls may be received. A data discovery status may be devalued using the discovery results. The discovery space content may be augmented using the further metadata and the data discovery status. The augmented discovery space content may be rendered for receiving further API calls.

Method and system for a discovery engine

Processing data errors in a data processing system, includes a computer receiving one or more patterns and a data set. The one or more patterns describe characteristics of an erroneous data record and are associated with a root cause. The root cause includes a description of a technical deficiency causing the data error in the erroneous data record. Responsive to the computer determining that a first set of data records in the received data set have characteristics that match a first pattern of the one or more patterns, the computer assigns the first set of data records of the received data set having characteristics that match the first pattern to a first error group.

Processing data errors for a data processing system

Data to be loaded into a target system includes entities having corresponding unique primary data value and secondary data values. The secondary data values have associated foreign key relationships, which links the secondary data value to the primary data value of another entity. In loading the data, the entities are split into insertion leaf groups by execution of an iteration process, each iteration involving generation of a respective set of insertion leaf groups containing entities whose secondary data values have no foreign key relationships or only foreign key relationships with the primary data values of entities of the insertion leaf groups generated during any prior iteration. The iteration process is executed until there are no such entities are left. A sequence of generation of the sets of insertion leaf groups is recorded, and the sets of insertion leaf groups are consecutively loaded into the target system according to the sequence.

Loading data with complex relationships

The present invention relates to electronic mail. In particular, it relates to a method and system for processing electronic mail, wherein mails are stored in a space efficient way by removing redundancy from the content. Prior art is known for doing a limited version of this on a mail client. In order to provide a method and system which is adequate for server operation it is proposed to perform the steps of: splitting the content of an incoming e-mail into elementary mail segments by parsing and optionally normalizing the e-mail body based on a regular grammar with transduction rules; computing a unique ID for each elementary mail segment; storing the normalized or original form of an elementary mail segment together with a link to its respective parent elementary mail segment in a table in a way retrievable by said unique ID; and reconstructing an original e-mail from a concatenation of a respective sequence of said elementary mail segments wherein the unique ID for each elementary mail segment is used as a key for accessing said table and retrieving the respective elementary mail segment.

Space-efficient mail storing and archiving based on communication structure

A method includes receiving a request from a source service, determining whether the target service associated with the request supports a by-reference evaluation strategy, determining whether an information object associated with the request is a data reference, retrieving data associated with the reference from a database, adding the data to the information object, and invoking the target service and passing the information object to the target service responsive to determining that the target service does not support the by-reference strategy and the information object is a data reference.

Systems and methods involving information objects

A method to model and change the state of associated content objects from one or more workflow and task management systems is provided. The method includes overlaying a business process model associated with a graphical content state overlay. A state of the content objects changes accordingly when the business process instance proceeds. Access rights are forwarded from human tasks in a business process to an associated content object. Concurrent access rights that are forwarded from multiple systems are handled. The graphical content state overlay areas include an active state overlay to graphically indicate a business process instance is active, an assessed overlay to graphically indicate a business process instance is assessed, an approval/rejected overlay to graphically indicate a business process instance has received one of an approval decision and a rejection decision, and a state archived overlay to graphically indicate a business process instance has been archived.

Method and apparatus to model content state and access control in backend-systems and business processes

In an exemplary embodiment of this disclosure, a data selection method may include receiving first data representative of program code having a plurality of database operations. Second data is generated and is representative of a sequence of operations encounterable in an execution of the program code, where the sequence of operations includes at least one of the database operations. A third data is selected from a database, by using the second data.

Growing community of inventors

Holzgerlingen, Germany

Peter Gerstl