Abstract: According to one embodiment of the present invention, a system for determining related entities includes at least one processor. The system identifies one or more candidate entities for a data object associated with an entity based on one or more features. The entity and candidate entities are each associated with one or more features and each feature is associated with one or more behaviors. The identified candidate entities related to the entity are determined based on the associated behaviors of the features of the identified candidate entities and the entity. Embodiments of the present invention further include a method and computer program product for determining related entities in substantially the same manner described above.

Abstract: Provided are techniques for incrementally integrating and persisting context over an available observational space. At least one feature associated with a new observation is used to create at least one index key. The at least one index key is used to query one or more reverse lookup tables to locate at least one previously persisted candidate observation. The new observation is evaluated against the at least one previously persisted candidate observation to determine at least one relationship. In response to determining the at least one relationship, a threshold is used to make a new assertion about the at least one relationship. The new observation is used to review previous assertions to determine whether a previous assertion is to be reversed. In response to reversing the previous assertion, the new observation, the new assertion, and the reversed assertion are incrementally integrated into persistent context.

Abstract: Provided are techniques for incrementally integrating and persisting context over an available observational space. At least one feature associated with a new observation is used to create at least one index key. The at least one index key is used to query one or more reverse lookup tables to locate at least one previously persisted candidate observation. The new observation is evaluated against the at least one previously persisted candidate observation to determine at least one relationship. In response to determining the at least one relationship, a threshold is used to make a new assertion about the at least one relationship. The new observation is used to review previous assertions to determine whether a previous assertion is to be reversed. In response to reversing the previous assertion, the new observation, the new assertion, and the reversed assertion are incrementally integrated into persistent context.

Abstract: According to one embodiment of the present invention, a system for determining related entities includes at least one processor. The system identifies one or more candidate entities for a data object associated with an entity based on one or more features. The entity and candidate entities are each associated with one or more features and each feature is associated with one or more behaviors. The identified candidate entities related to the entity are determined based on the associated behaviors of the features of the identified candidate entities and the entity. Embodiments of the present invention further include a method and computer program product for determining related entities in substantially the same manner described above.

Abstract: Provided are techniques for incrementally integrating and persisting context over an available observational space. At least one feature associated with a new observation is used to create at least one index key. The at least one index key is used to query one or more reverse lookup tables to locate at least one previously persisted candidate observation. The new observation is evaluated against the at least one previously persisted candidate observation to determine at least one relationship. In response to determining the at least one relationship, a threshold is used to make a new assertion about the at least one relationship. The new observation is used to review previous assertions to determine whether a previous assertion is to be reversed. In response to reversing the previous assertion, the new observation, the new assertion, and the reversed assertion are incrementally integrated into persistent context.

Abstract: Provided are techniques for incrementally integrating and persisting context over an available observational space. At least one feature associated with a new observation is used to create at least one index key. The at least one index key is used to query one or more reverse lookup tables to locate at least one previously persisted candidate observation. The new observation is evaluated against the at least one previously persisted candidate observation to determine at least one relationship. In response to determining the at least one relationship, a threshold is used to make a new assertion about the at least one relationship. The new observation is used to review previous assertions to determine whether a previous assertion is to be reversed. In response to reversing the previous assertion, the new observation, the new assertion, and the reversed assertion are incrementally integrated into persistent context.

Abstract: Techniques are disclosed for adding entities to a group of entity resolution candidates by selecting entities that have a minimum threshold of similarity to a candidate, allowing a greater number of resolutions in an entity resolution system. To resolve an incoming identity record, an initial group of candidates may be selected from known entities by identifying entities that match a candidate building attribute of the incoming identity record. Additional candidates may be selected by identifying entities with some information that is similar to one of the candidate entities.

Abstract: Provided are techniques for receiving a record, wherein the received record has a space-time feature, selecting candidate entities using the space time feature, performing space time analysis to determine whether the received record should be conjoined with a candidate entity from the candidate entities, and, in response to determining that the received record should be conjoined with the candidate entity, making an entity resolution assertion by conjoining the received record and the candidate entity to form a newly conjoined entity.

Abstract: Method for handling requests for data stored in database tables is provided. The method includes receiving a request for data stored in a database table, the database table including non-hash and hash columns, a hash column including hash values computed based on non-hash values in at least one non-hash column, generating database queries that are executable to retrieve data stored in the database table satisfying the request, each database query using a different combination of columns in the database table, ranking the database queries based on desirability, determining whether any of the database queries only uses indexed columns, responsive to one or more of the database queries only using indexed columns, selecting a highest ranked of the one or more database queries that only uses indexed columns for execution.

Abstract: Techniques are disclosed for adding entities to a group of entity resolution candidates by selecting entities that have a minimum threshold of similarity to a candidate, allowing a greater number of resolutions in an entity resolution system. To resolve an incoming identity record, an initial group of candidates may be selected from known entities by identifying entities that match a candidate building attribute of the incoming identity record. Additional candidates may be selected by identifying entities with some information that is similar to one of the candidate entities.

Abstract: Method for handling requests for data stored in database tables is provided. The method includes receiving a request for data stored in a database table, the database table including non-hash and hash columns, a hash column including hash values computed based on non-hash values in at least one non-hash column, generating database queries that are executable to retrieve data stored in the database table satisfying the request, each database query using a different combination of columns in the database table, ranking the database queries based on desirability, determining whether any of the database queries only uses indexed columns, responsive to one or more of the database queries only using indexed columns, selecting a highest ranked of the one or more database queries that only uses indexed columns for execution.