A partition based bloom filter for fastest data search

Bloom filters (BFs) provide a simple and effective way to check whether an element belongs to a set. BFs are implemented using electronic circuits. The contents of a BF are commonly stored in a high speed memory and required processing is done in a processor or in dedicated circuitry. The Memory interleaving is a cost-competent approach to the increase bandwidth. That is improving data access locality and reducing memory access conflicts are two important aspects to achieve high efficiency for interleaved memory. In this project memory interleaving technique based on LSB bit applied to BIRA technique to reduce memory access complexities. The Xilinx experimental results show that the proposed technique requires a smaller area overhead than that of the previous state-of-the-art BIRA with an optimal searching rate. In this brief, we are proposed the interleaving technique method with BF so the errors and datas are find out quickly. Then the errors are partitioning the content of the memory.