2. The method of claim 1 , wherein the query comprises an AND query.
2. The method of claim 1 , wherein the query comprises an AND query. 3. The method of claim 2 , wherein computing the first Bloom filter length, L s , for the first set, D1, having keywords of maximum length b, further comprises computing according to the following equation: L s = (  D ⁢ ⁢ 1  ( ln ⁢ ⁢ 2 ) 2 ) * ln ⁡ ( b ⁡ ( ln ⁢ ⁢ 2 ) 2 ) . and wherein computing first number of hash functions, r s , for the first set, D1, further comprises computing according to the following equation: r s = ( L s  D ⁢ ⁢ 1  ) * ln ⁢ ⁢ 2.