Abstract: Techniques are disclosed for resolving relationships in a relationship graph of identities. A strength of at least one link from a node of the relationship graph may be reduced, based on at least a count of the links from the node. Further, the reduction may be based on one or more predefined threshold counts. The node having a reduced link strength may be evaluated to identify whether a relationship between the node and a specified node meets predefined criteria for a relationship of interest. A user may be alerted of any identified relationship.

Abstract: The present invention generally is directed to a system, method and article of constructing queries from a set of query conditions. The query conditions are grouped using logical operators to generate a database query. Query conditions within a group may be connected using a logical “OR” operator and groups of query conditions may be connected using a logical “AND” operator. Once generated, the database query may be presented to a user for review.

Abstract: A method, article and apparatus for calculating a measure of similarity between names is disclosed. Generally, name elements from an inbound name may be matched to name elements in a candidate matching name. A measure of similarity for the inbound name and candidate matching name may be calculated based on the number of matching name elements, an inbound name word count, a candidate name word count, and the number of transpositions that occur in matching name elements with one another.

Abstract: Provided are a method, system, and article of manufacture for a query predicate generator to construct a database query predicate from received query conditions. A plurality of query conditions are received, wherein each query condition includes a comparison operator and a comparison value for a database attribute, and wherein the comparison operator is capable of comprising matching and non-matching operators. The query conditions are processed to determine at least one logical operator to include between the query conditions. A database query predicate is generated to use in a database query to apply against the database comprising the received query conditions chained using the determined logical operators.

Abstract: Systems, methods and articles of manufacture are disclosed for resolving relationships in a relationship graph of identities. A strength of at least one link from a node of the relationship graph may be reduced, based on at least a count of the links from the node. Further, the reduction may be based on one or more predefined threshold counts. The node having a reduced link strength may be evaluated to identify whether a relationship between the node and a specified node meets predefined criteria for a relationship of interest. A user may be alerted of any identified relationship.

Abstract: Provided are a method, system, and article of manufacture for a query predicate generator to construct a database query predicate from received query conditions. A plurality of query conditions are received, wherein each query condition includes a comparison operator and a comparison value for a database attribute, and wherein the comparison operator is capable of comprising matching and non-matching operators. The query conditions are processed to determine at least one logical operator to include between the query conditions. A database query predicate is generated to use in a database query to apply against the database comprising the received query conditions chained using the determined logical operators.

Abstract: The present invention generally is directed to a system, method and article of constructing queries from a set of query conditions. The query conditions are grouped using logical operators to generate a database query. Query conditions within a group may be connected using a logical “OR” operator and groups of query conditions may be connected using a logical “AND” operator. Once generated, the database query may be presented to a user for review.

Abstract: A method, article and apparatus for calculating a measure of similarity between names is disclosed. Generally, name elements from an inbound name may be matched to name elements in a candidate matching name. A measure of similarity for the inbound name and candidate matching name may be calculated based on the number of matching name elements, an inbound name word count, a candidate name word count, and the number of transpositions that occur in matching name elements with one another.