Search optimization in a computing environment

摘要

Systems and methods for verifying membership in one or more sets that are subsets of a global set are provided. The method compromises representing members of the global set by mapping each member to a distinct Boolean variable of length d, wherein 2d is not less than the number of members in the global set; representing each of the given subsets of the global set by a Boolean expression which evaluates to a first value for any of the assignments to the Boolean variables which represent members of the subset, and which evaluates to a second value for any of the assignments to the Boolean variables which represent members of the global set that are not members of the subset.

主权项

1. A computer-implemented method for verifying membership of a code in one or more subsets of a global set, comprising:
representing, using one or more processors, a subset C of the global set based on a Boolean clause assignment for the subset C =y1z1 or y2z2 or . . . or yizi, wherein yi and zi represent a first word and a second word of respective Boolean clauses, a conjunction of which defines the subset C; determining that the code xi is a member of the subset C when:
((xi XOR zi)AND yi)=0; verifying membership in one or more sets that are subsets of a the global set, wherein a co-occurrence count for each pair of codes in the subsets is determined, wherein a d-dimensional data structure is utilized to represent the global set, where one or more vertices of the d-dimensional data structure are respectively mapped to one or more members of the global set, using the co-occurrence count, and, wherein a one-bit word is added to a Boolean clause in one or more Boolean clauses used to define the subset C, wherein an indicator value indicates whether a corresponding Boolean clause uses the maximum of d Boolean literals; and wherein if the indicator value indicates that the corresponding Boolean clause uses the maximum of d Boolean literals, then the corresponding Boolean clauses includes the d-bit word with the values of said Boolean literals and excludes the first word and the second word, wherein when testing to determine if xi is a member of C as defined by the corresponding Boolean clause, xi is a member of C if ((xi XOR zi) AND yi) =0.