11. The method of claim 1 , further comprising: determining whether the particular in-memory data structure is a dense bloom filter data structure containing a bit vector or a dictionary data structure containing hash values; and based on determining whether the particular in-memory data structure is the dense bloom filter data structure or the dictionary data structure, and to determine whether the particular data block set can possibly contain the filtering value in the particular column of the target data set, determining whether to generate a hash value that contains at least two sub-hash values from the filtering value by applying a hash algorithm of cryptographic strength to the filtering value, wherein each sub- hash value of the at least two sub-hash values is statistically independent from other sub-hash value of the at least two sub-hash values.
11. The method of claim 1 , further comprising: determining whether the particular in-memory data structure is a dense bloom filter data structure containing a bit vector or a dictionary data structure containing hash values; and based on determining whether the particular in-memory data structure is the dense bloom filter data structure or the dictionary data structure, and to determine whether the particular data block set can possibly contain the filtering value in the particular column of the target data set, determining whether to generate a hash value that contains at least two sub-hash values from the filtering value by applying a hash algorithm of cryptographic strength to the filtering value, wherein each sub- hash value of the at least two sub-hash values is statistically independent from other sub-hash value of the at least two sub-hash values. 12. The method of claim 11 , wherein determining whether the particular in-memory data structure is the dense bloom filter data structure or the dictionary data structure is based on metadata associated with the particular in-memory data structure.