International Business Machines Corporation

Daimler Chrysler Ag

Thomas Schwarz

Albert Maier

Oliver Suhre

Peter Gerstl

Martin Oberhofer

Michael Baessler

Mike W Grasselt

Markus Buehler

Rainer Dorsch

Guenther Hutzl

Cagri Balkesen

Stefanie Scherzinger

Michael W Kaufmann

Daniel Pfefferkorn

David Rohr

Oliver Koeth

Dennis Butterstein

Thomas Dürr

Robert Kern

Werner Schuetz

Mariya Chkalova

Klaus Harm

Sergej Schuetz

Jonathan Roesner

Tobias Kevin Fränzel

Manfred Vodegel

Holger Koenig

Baxter R Yazbek

Anja Gruenheid

Alexander Merschel

Dirk Nowak

Nehal Dudani

A method, computer system, and a computer program product for storing a graph is provided. The present invention may include providing a key-value store. The present invention may include storing a graph in the key-value store, wherein storing a specific node of the graph in the key-value store comprises: storing, as a key, identifiers of the specific node and of k-hop neighborhood of the specific node, and as value of the key, attribute values of the specific node, wherein the k-hop neighborhood of the specific node comprises a set of neighboring nodes that are reachable from the specific node within k edges.

Storing graph data in a key-value store

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

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 for authentication of a username, a processor maintains a mapping of usernames and realms. A processor receives a username and a time-based one-time password code (TOTP code) for the username based on an authentication application. A processor, upon receiving the TOTP code: determines a realm from the mapping based on the received username and the received TOTP; and requests an entry of a credential relating to the username in the realm. A processor, upon receiving of the requested credential, authenticates the username by determining that the received credential matches an expected credential for the realm.

Second factor based realm selection for federated authentications

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

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

The present disclosure details a method and system used for turning human participants who control avatars in a virtual world setting into real life marketing leads. In one embodiment, a virtual location is presented within a virtual world to facilitate interaction with an avatar. The avatar is identified within a master data management system, and a profile of the human behind the avatar is created or retrieved. To encourage the human user to provide real-world information through the avatar within the virtual world, an incentive is offered and awarded as necessary. The real-world information about the human user, such as address or demographic information about the human user is collected and stored in the profile, and eventually synchronized with a CRM system. As appropriate, the data collected and compiled in the CRM system may be used to launch marketing campaigns.

Method and system for turning virtual world participants into real life leads

During migration of data from at least one data source to a target system, data quality is determined by obtaining metadata associated with the target system, automatically generating instantiated rules for assessing a quality of data to be loaded from the at least one data source into the target system, where the instantiated rules are dependent upon the obtained metadata associated with the target system, and applying a quality analysis based upon the instantiated rules to the data to be loaded into the target system. The quality analysis provides an indication of a level of compliance of the data with requirements of the target system.

Automatic generation of instantiation rules to determine quality of data migration

The present invention relates to a method for processing data quality exceptions in a data processing system, the data processing system having access to one or more data sources and having access to multiple technical support systems, the multiple technical support systems having one or more predefined technical tasks. The method comprises providing a predefined grouping rule for assigning data quality exceptions to exception groups, and associating each exception group using at least one technical task; receiving a first description of at least a first data quality exception in a data set of the first data source; using the grouping rule for assigning the first data quality exception to at least a first exception group using the first description, and for associating the first exception group with a first technical support system; routing by the exception engine at least part of the first description to the first technical support system.

Method for processing data quality exceptions in 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 a method and respective system for operating a DRAM main memory. One buffer line is provided for multiple pages. When writing data to the buffer it is decided which to which buffer-line the data is written to based on its destination main memory address. A tuple consisting of lower memory address and data is stored. Data entered into the buffer-line will be sorted by page in case the line is flushed to the main memory. Sorting the buffer entries results in less page openings and closings, since the data is re-arranged by memory address and therefore in logical order. By using one line for multiple pages only a fraction of memory of a common set-associative cache is needed, thus decreasing the amount of overhead significantly.

Write buffer for improved DRAM write access patterns

First and second sets of numbers are received in an input range, which is separated into sub ranges. A first sub range is processed by initializing bits of a memory to a first logical state and by changing the initial state of each of the bits corresponding to a received number of the first set that is within the first sub range. Each number received in the second set is compared to a bit in the memory to identify a set of received numbers that are in the first sub range and that are in both the first set and the second set. The comparing is responsive to detecting a change of initial state of any bit in the memory during the processing of the first sub range. The processing and comparing is repeated for remaining sub ranges to identify received numbers that are in both the sets.

Computing intersection of sets of numbers

A method and system for creating interrecord relationships between master data records stored in a relational database are provided. The method includes receiving information for a first master data record from a user, searching a plurality of master data records in the relational database for candidates that have a potential of being related to the processed master data record, the searching performed automatically in response to the receiving, determining at least one possible relationship type between the candidates found as a result of the searching and the first master data record, and presenting the at least one possible relationship type and the candidates found as a result of the searching to the user. The disclosed method and system allow a user to create and maintain relationships between multiple master data records with minimal steps.

Growing community of inventors

Stuttgart, Germany

Thomas Schwarz