113 Bloom Filters (New) PDF

113 Bloom Filters (New) Let's learn about Bloom filters and how to use them. Background * If we have a large set of structured data (identified by record IDs) stored in a set of data files, what * ***...

113 Bloom Filters (New) Let's learn about Bloom filters and how to use them. Background * If we have a large set of structured data (identified by record IDs) stored in a set of data files, what * *** *** ** ** * * *** is the most efficient way to know which file might contain our required data? We don't want to *** * read each file, as that would be slow, and we have to read a lot of data from the disk. * *~ Clarification: This data isn’t stored in a single file but is distributed across a set of data files. ~ Each file contains multiple records, each with its own record ID. * * One solution can be to build an index on each data file and store it in a separate index file. * * ** ** * This index can map each record ID to its offset in the data file. *** * * * * * * *** *** *** ** ** *~ Clarification: The explanation in this article simplifies things by focusing on mapping record IDs ~ to offsets within a single data file’s index, but it leaves out an important detail: when data is spread across multiple files, the system also needs to know which file contains the record. This ** ** is typically managed through a global directory or metadata, which maps record IDs (or ranges ** ** of them) to the corresponding data files and their index files. So, while each index file only needs to know the offsets within its specific data file, the global directory helps determine where to ** look first, saving time. Without this higher-level mapping, the explanation can feel incomplete ** because it doesn’t address how the system efficiently handles multiple data files. * * Each index file will be sorted on the record ID. * *** * * * ** * Now, if we want to search an ID in this index, the best we can do is a Binary Search. ** *** *** *** *** Can we do better than that? *** Solution Use Bloom filters to quickly find if an element might be present in a set. The Bloom filter data structure tells whether an element may be in a set, or definitely is not. **~ ~** *** *** *** The only possible errors are false positives, i.e., a search for a nonexistent element might give *** * * * an incorrect answer. * With more elements in the filter, the error rate increases. *** *** *** ***  An empty Bloom filter is a bit-array of m bits, all set to 0. *** *** ` ` ` ` There are also k different hash functions, each of which maps a set element to one of the m *** ` ` *** * * * * ` ` bit positions. * Adding an element and searching for it: * To add an element, feed it to the hash functions to get k bit positions, and set the bits at *** *** *** ` ` *** *** these positions to 1. ` ` *** * To test if an element is in the set, feed it to the hash functions to get k bit positions. * * ` ` * * If any of the bits at these positions is 0 , the element is definitely not in the set. ** ` ` *** *** *** *** If all are 1 , then the element may be in the set. ` ` *** * * *** *** * E.g. Here is a Bloom filter with three elements P , Q , and R. It consists of 20 bits and uses three hash * * * ` ` ` ` ` ` * * * functions. The colored arrows point to the bits that the elements of the set are mapped to. * * * * * [Bloom Filter Using 3 Hash Functions] ~ ~ The element X definitely is not in the set, since it hashes to a bit position containing 0. ` ` *** *** == ` ` == * For a fixed error rate, adding a new element and testing for membership are both constant time * *** operations, and a filter with room for 'n' elements requires O(n) space. *** ** ** ** ` ` **