Bloom Filters Based on the B-tree

The Bloom filter has become attractive as one of the methods of looking up data in the distributed system. Since two or more keywords can be used in the method based on the Bloom filter, it is more flexible than the distributed hash table (DHT). Especially, the key aspect of the structured Bloom filter is that the number of query forwarding is fixed. In the research of the past, the ring of the Bloom filter which is like the Chord structure is proposed. However, the node in the ring must maintain many filters corresponding to the number of nodes. In this research, the Bloom filter based on the tree structure is proposed. The filter information managed in the node is reduced, and the size of information in this research is compared to the existing research.