International Business Machines Corporation

Stephen John Watjen

Charles Kinston Williams

David Edward Biesenbach

Steven J Liddle

Frankie Elizabeth Patman Maguire

Brian Eugene Macy

Leonard Arthur Shaefer, Jr

Frank Everett Whaley

Bin Qin

Anna Khasin

A system creates a query name bitmap signature comprising at least one bigram for a query name. The system calculates a query name bitmap range for the query name based on a match threshold and a number of bigrams in the query name bitmap signature. The system creates a data list name bitmap signature comprising at least one bigram, for each of a plurality of data list names, and identifies a subset of the plurality of data list names. The subset comprises data list name bitmap signatures that are within the query name bitmap range. The system reduces a number of comparisons by comparing only the query name and each of the subset of the plurality of data list names when performing the analytical name search. The system also reduces the number of comparisons by reducing the number of bit positions that are compared.

Search performance using smart bitmap operations

Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.

Name search using multiple bitmap distributions

Provided are techniques for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.

A method and system for performing a search request for a name among a database including a plurality of names. In one implementation, the method includes receiving the search request on the name, determining a geographic location associated with the name, assigning a cultural classification to the name based on the geographic location associated with the name, and completing the search request by searching for the name among the plurality of names within the database based on the cultural classification assigned to the name.

Growing community of inventors

Ashburn, VA, United States of America

Stephen John Watjen