International Business Machines Corporation

Hemanth Kumar Babu

Martin Oberhofer

Thuany Karoline Stuart

Yannick Saillet

Mike W Grasselt

Lars Bremer

Robert Kern

Basem Elasioty

Claudio Andrea Fanconi

Oliver Suhre

Jason Allen Woods

Jonathan Roesner

Karin Steckler

Sergej Schuetz

Theresa Schmitt

A computer-implemented method for managing data records subject to placement condition rules in a distributed data management system comprising a plurality of nodes. The method may include receiving, by an endpoint management component of the distributed data management system, a request for a data record. The method may also include routing, by the endpoint management component of the distributed data management system, the request to a node of the distributed data management system. The method may also include upon determining that the request is a create request, verifying, by a service component of the distributed data management system, a placement condition rule for the data record, where the placement condition rule is retrieved from a configuration component of the distributed data management system.

Multi-partitioned global data system

Duplicating identification in a graph having a second version. The graph includes nodes representing entities and edges representing relationships between the entities. The method includes: providing a previous first version of the graph. At least two target nodes of the graph may be identified. The first version and the second version of the graph may be compared for determining a comparison score indicative of a similarity between the two target nodes. The comparison score may be used for determining whether the two target nodes are duplicates with respect to each other.

Duplicate determination in a graph using different versions of the graph

The present disclosure relates to a method for a weighting graph comprising nodes representing entities and edges representing relationships between entities in accordance with one or more domains. The method comprises: pre-processing the graph comprising assigning weights to the nodes and/or the edges of the graph in accordance with a specific domain of the domains, wherein the weight indicates a domain specific data quality problem of attribute values representing an edge of the edges and/or an entity involved in that edge. The weighted graph may be provided for enabling a processing of the graph in accordance with the specific domain.

Method for weighting a graph

Methods, computer program products and/or systems are provided that perform the following operations: obtaining a first graph comprising first nodes representing first entities and first edges representing relationships between first entities, the first nodes being associated with first entity attributes descriptive of the first entities represented by the first nodes, the first edges being associated with first edge attributes descriptive of the relationships represented by the first edges; determining a first subgraph for a certain node of the first nodes of the first graph, the first subgraph including the certain node and at least one neighboring node of the certain node; and determining a data quality issue regarding the certain node based, at least in part, on applying one or more applicable rules of a set of data quality rules to first entity attribute values and first edge attribute values of the first subgraph.

Measuring data quality of data in a graph database

Embodiments of the present invention provide for a method for duplicate determination in a graph. The graph comprises nodes representing entities and edges representing relationships between the entities. Embodiments of the present invention identify two target nodes in the graph. A neighborhood subgraph may be determined for each of the two nodes. The neighborhood subgraph includes the respective node. Embodiments of the present invention can then determine whether the two nodes are duplicates with respect to each other, based on a result of a comparison between the two subgraphs and based on a comparison of the two target nodes of the subgraphs.

Duplicate determination in a graph

Embodiments of the present invention determines duplicates in a graph. The graph comprises nodes representing entities and edges representing relationships between the entities. The method comprises: identifying at least two nodes in the graph. A neighborhood subgraph may be determined for each of the two nodes. The neighborhood subgraph includes the respective node. The method further comprises determining whether the two nodes are duplicates with respect to each other, based on a result of a comparison between the two subgraphs.

Growing community of inventors

Boeblingen, Germany

Hemanth Kumar Babu