Using Bloom Filter Array (BFA) to Speed up the Lookup in Distributed Storage System

Today’s storage systems have a major issue for the long-term storage of massive amounts of unstructured data. The reliability and availability of that fortune of data become important factors. So, distributed storage system is essential for many large-scale organizations. It is challenging that how to access the distributed data from a place. In this paper, a structure of the Bloom filter array (BFA) is proposed to get time and space efficiency in distributed storage system. The proposed structure that can efficiently lookup the queries will be discussed from the algorithm perspective and then evaluate BFA through simulations