第 37 卷第 3 期 通 信 学 报 Vo l .3 7 20bute combinations in the bit matrix could be reduced and weighted on demand to further enhance memory utilization rate. Theoretical analysis proves that CBFM utilizes memory more effi- ciently than BFM, the current state of art. Experiments also show that, on the scenario of memory size fixed, the false positive rate of CBFM is lower than that of all other indexing methods. Especially on the scenario of memory constrained, the false positive rate of CBFM can be 3 orders of magnitude lower than that of BFM(Bloom filter matrix) indexing me- thod. CBFM is an accurate data structure for multi-dimensional membership query. Key words: query algorithm, multi-dimensional membership query, Bloom filter, bit matrix
