[{"data":1,"prerenderedAt":189},["ShallowReactive",2],{"project-9360255":3},{"id":4,"name":5,"line":6,"line_source":7,"title":8,"url":9,"domain":10,"maker":11,"posted_at":12,"year":13,"points":14,"comments":15,"rank_in_year":16,"shown_in_year":17,"top":18,"tier":19,"category":20,"subcategory":21,"format":22,"keywords":23,"reception":28,"sentiment":29,"stance_mix":30,"scored_comments":33,"aspects":34,"strip":37,"post_text":29,"what":39,"said":52,"maker_in_thread":112,"shape":114,"grid":119,"attempts":150,"same_week":151,"maker_shows":181,"maker_hidden":182,"reader_version":183,"card":184},"9360255","BoomFilters","Probabilistic data structures for processing streams","title","Show HN: BoomFilters – Probabilistic data structures for processing streams","https:\u002F\u002Fgithub.com\u002Ftylertreat\u002FBoomFilters","github.com","tylertreat",1428778392,2015,70,13,393,2565,16,"notable","languages","probabilistic data structures library","library",[24,25,26,27],"bloom filter","probabilistic data structures","stream processing","cuckoo hashing","quiet",null,{"positive":31,"neutral":32,"mixed":31,"critical":32},0,1,2,{"idea":35,"docs":36},{"positive":31,"critical":31},{"positive":31,"critical":32},[31,31,31,31,38,31,31,31,31,31,32,31,31],3,{"problem":40,"audience":29,"pricing":29,"motivation":29,"time_to_build":29,"stack":50,"openness":51,"stage":51,"team_size":51},{"value":41,"source":42,"evidence":43},"Probabilistic set membership and counting over data streams","inferred",[44,46],{"id":45},"post",{"id":47,"by":48,"text":49},"9360511","lstamour","Looks consistently used to me. The project is a collection of stream-optimized bloom filters and the project or its filters, as a whole, are referred to as \"Boom Filters\" in…",[],"unknown",{"praise":53,"objections":62,"requests":94,"questions":95,"alternatives":101},[54],{"value":55,"source":56,"evidence":57},"Tyler's blog has good solid content for concurrency enthusiasts","commenter",[58],{"id":59,"by":60,"text":61},"9360944","eternalban","You should checkout Tyler's blog. Good solid content for the concurrency geeks.",[63,78,87],{"value":64,"source":56,"evidence":65},"InverseBloomFilter claim of no false positives is disputed as impossible in constant space",[66,70,74],{"id":67,"by":68,"text":69},"9360548","hurin","\u002F\u002F The InverseBloomFilter may report a false negative but can never report a false positive. This is actually not true and not possible. There is a good explanation here:…",{"id":71,"by":72,"text":73},"9360663","wcdolphin","That InverseBloomFilter sounds like an LRU cache of hashes. A true inverse bloom filter can be proven to be impossible, sadly.",{"id":75,"by":76,"text":77},"9360748","zeeboo","Then it doesn't do it in constant space. Constant space is the property that makes it not a true inverse bloom filter, and instead is just a cache with an interesting hashed…",{"value":79,"source":56,"evidence":80},"Naming is misleading; the InverseBloomFilter is really a cache",[81,82,86],{"id":67,"by":68,"text":69},{"id":83,"by":84,"text":85},"9360704","frankmcsherry","Well, I'm looking at the code and it looks like it doesn't report false positives. I understand that you expect it to hash the content down and store only the hash, but it…",{"id":71,"by":72,"text":73},{"value":88,"source":56,"evidence":89},"README uses Boom and Bloom inconsistently",[90],{"id":91,"by":92,"text":93},"9360491","natch","Why does the readme use Boom and Bloom interchangeably? Is it just a typo that for some reason is randomly scattered throughout the document (and in the repo name itself)? Or is…",[],[96],{"value":97,"source":56,"evidence":98},"Why the README uses both Boom and Bloom interchangeably",[99,100],{"id":91,"by":92,"text":93},{"id":47,"by":48,"text":49},[102,106],{"value":103,"source":56,"evidence":104},"Classic Bloom filters",[105],{"id":47,"by":48,"text":49},{"value":107,"source":56,"evidence":108},"Cuckoo hashing",[109],{"id":110,"by":68,"text":111},"9360791","I guess it's storing the pointer to the data? That sounds pretty bad. At any-rate it's one of two things, either you store the whole item or you store a hash. If you're storing…",{"comments":31,"answered":31,"key":113},[],{"commenters":115,"max_depth":116,"maker_replies":31,"first_comment_mins":117,"lifespan_hours":118},11,4,56,29,[120,122,123,124,125,129,132,136,140,141,144,146,148],[67,31,31,121,68,31],"commenter\u002Fneutral\u002Fidea",[83,31,31,121,84,31],[75,31,31,121,76,31],[110,31,31,121,68,31],[126,31,38,127,128,31],"9360730","project\u002Fneutral\u002Fidea","im3w1l",[130,31,31,131,60,31],"9360935","commenter\u002Fneutral\u002Fnone",[133,31,31,134,135,31],"9360744","commenter\u002Fcritical\u002Fidea","filipncs",[137,31,31,138,139,31],"9361229","other\u002Fneutral\u002Fnone","cbsmith",[71,32,31,134,72,31],[142,33,31,121,143,31],"9365148","Analog24",[91,38,32,145,92,31],"project\u002Fcritical\u002Fdocs",[47,38,31,147,48,31],"commenter\u002Fneutral\u002Fdocs",[59,116,31,149,60,31],"other\u002Fpositive\u002Fnone",[],[152,157,162,166,171,176],{"id":153,"name":154,"points":155,"category":156},"9348193","Where is “Who is hiring?” hiring?",493,"productivity",{"id":158,"name":159,"points":160,"category":161},"9372918","Niltalk",169,"consumer_social",{"id":163,"name":164,"points":165,"category":20},"9354873","CSS to render Markdown as unrendered Markdown",161,{"id":167,"name":168,"points":169,"category":170},"9351286","botwillacceptanything",155,"ai",{"id":172,"name":173,"points":174,"category":175},"9366549","TypeSlab",138,"creative",{"id":177,"name":178,"points":179,"category":180},"9375767","java-dirty",74,"data",6,false,"v2",{"id":185,"name":5,"line":6,"ai":182,"cat":20,"year":13,"points":14,"comments":15,"rec":28,"s":29,"top":18,"kw":186,"maker":11,"domain":10,"tier":19,"attempts":31,"strip":187,"url":9,"mix":188,"praise":55,"objection":64,"sub":21},9360255,[24,25,26,27],"0000300000100",[31,32,31,32],1794036530272]