top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

Facebook Login
Site Registration
Print Preview

data structure to provide nano seconds lookup for more than 10 million objects

+1 vote
65 views

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.

posted Aug 27, 2013 by Pankaj Agarwal

Share this question
Facebook Share Button Twitter Share Button Google+ Share Button LinkedIn Share Button Multiple Social Share Button

1 Answer

+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.

answer Aug 27, 2013 by anonymous
thanks ! This looks useful, do we have other data structures which provides same functionality ?
Similar Questions
0 votes

How to use a workflow for one to one mapping for more than one source with source name as parameter with different source structure in Informatica power Center. I have a data migration where i need to unload 800 tables into delimited text files. Is there a way we can give the table name in parameter while running the workflow and the data will be unloaded to the output text file. Need help.

+4 votes

How to construct BFS-suitable data structure for adjacency list?

+1 vote

Considering a server that should ignore requests older than 1 second, create a structure to handle this behavior and give its complexity.


Useful Links with Similar Problem
Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#470/147, 3rd Floor, 5th Main,
HSR Layout Sector 7,
Bangalore - 560102,
Karnataka INDIA.
QUERY HOME
...