Bloom Filters - Implementing Hash Functions -


Simple questions here. Okay, so I understand the basics of using a Bloom filter, and this is to check that no member not is part of the set, the way the bit array of work, the way # To use the hash function and etc., calculation is done, but whatever I am not able to implement is that how do you keep mapping characters in bytes. For example, say I have input 1 and output is 8 and then I set bit 8 to 1, to indicate that the member is a part of the set. Do not have to do with the function like Fanvi or Jenkins, or actually any hash function that letter with integer if it is a stupid question, so feel free to tell me, I'm not the implementation of some of these . Stringes are an array of letters (character datatype) and are either dependent on 16 bit or 8 bit basis. If the language is using utf or ascii then psuedo code will look something like this:

 // ord () means that you can use serial or typedcasting. Var str: string; B: byte; Str = "zoom" b = (byte) str [4]; // Delphi i will use b = ord (str [4]); // Now there is a number for letter m in B 

Strings are just arrays and you can use them in Java You will use string.indexboot or something similar.

I have written a tutorial on Bloom Filters, if you are interested


Comments

Popular posts from this blog

import - Python ImportError: No module named wmi -

Editing Python Class in Shell and SQLAlchemy -

c# - MySQL Parameterized Select Query joining tables issue -