probabilistic Data structure which can search a object out of 100 million objects in nano seconds. 0.01% false positives are acceptable with no false negatives.

+1 vote

probabilistic Data structure which can search a object out of 100 million objects in nano seconds. 0.01% false positives are acceptable with no false negatives.

+1 vote

I believe you are looking for Bloom Filter see the http://en.wikipedia.org/wiki/Bloom_filter, Bloom filter is used to find out if an object is a member of a set or not. False positives are acceptable where negatives are not in this DS.

Speed and accuracy depends on your machine power and your code iterations, you should able to locate the code for bloom filter on the net.

thanks ! This looks useful, do we have other data structures which provides same functionality ?

...