[{"data":1,"prerenderedAt":215},["ShallowReactive",2],{"project-16097776":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":29,"sentiment":30,"stance_mix":31,"scored_comments":35,"aspects":36,"strip":40,"post_text":42,"what":43,"said":58,"maker_in_thread":126,"shape":137,"grid":141,"attempts":177,"same_week":178,"maker_shows":138,"maker_hidden":207,"reader_version":208,"card":209},"16097776","hyperminhash","HyperLogLog intersections","title","Show HN: HyperLogLog intersections","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fhyperminhash\u002Ftree\u002Fmaster","github.com","seiflotfy",1515428653,2018,88,16,497,2155,24,"notable","languages","probabilistic data structure library","library",[24,25,26,27,28],"hyperloglog","cardinality estimation","set intersection","minhash","probabilistic data structures","mixed",0.217,{"positive":32,"neutral":33,"mixed":34,"critical":34},3,4,1,9,{"idea":37,"execution":38},{"positive":34,"critical":34},{"positive":34,"critical":39},0,[41,39,32,39,39,39,41,32,39,39,32,39,32,41,34,32],5,null,{"problem":42,"audience":42,"pricing":42,"motivation":42,"time_to_build":42,"stack":44,"openness":57,"stage":57,"team_size":57},[45],{"value":46,"source":47,"evidence":48},"Go","commenter",[49,53],{"id":50,"by":51,"text":52},"16106204","yunwilliamyu","Thanks so much for producing a Golang implementation of our HyperMinHash paper (I'm the first author) [0] and pointing me to your Hackernews post! As an aside, we also have a…",{"id":54,"by":55,"text":56},"16098801","nemothekid","HLL intersections using MinSketch has been around for a while now, I remember writing a Go implementation a couple years back based on a AdRoll blog post…","unknown",{"praise":59,"objections":75,"requests":83,"questions":88,"alternatives":110},[60,71],{"value":61,"source":47,"evidence":62},"Useful library for approximate set operations",[63,67],{"id":64,"by":65,"text":66},"16098669","kgdinesh","Useful library. I hope someone out there is writing one for Java as well.",{"id":68,"by":69,"text":70},"16098764","mynameisfiber","This is great! Probabilistic datastructures are amazing. I did straight up HLL++ a while ago but had to do intersection with the inclusion–exclusion principle. It would be cool…",{"value":72,"source":47,"evidence":73},"Implementation is more efficient than the prototype Python version",[74],{"id":50,"by":51,"text":52},[76],{"value":77,"source":47,"evidence":78},"Naive HLL intersection via min of counts is inaccurate for cardinality estimation",[79],{"id":80,"by":81,"text":82},"16099318","stochastic_monk","Great work! I haven't messed around with the count-min augmentation for HLLs, but I've had a lot of success in practice. I've experimented with using HLL sketches for set…",[84],{"value":85,"source":47,"evidence":86},"Java implementation",[87],{"id":64,"by":65,"text":66},[89,96,103],{"value":90,"source":47,"evidence":91},"What is the code at hyperminhash.go line 102 meant to do",[92],{"id":93,"by":94,"text":95},"16099378","geocar","What is this[1] supposed to do? [1]: https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fhyperminhash\u002Fblob\u002Fmaster\u002Fhyperminhash.go#L102",{"value":97,"source":47,"evidence":98},"How well does merging many HyperLogLogs keep cardinality accuracy",[99],{"id":100,"by":101,"text":102},"16100725","djhworld","Forgive me if this is a dumb question, but is this library a way of merging multiple HyperLogLogs together and still have a reasonable cardinality estimate? What sort of loss do…",{"value":104,"source":47,"evidence":105},"Recommended resources for learning probabilistic data structures",[106],{"id":107,"by":108,"text":109},"16100070","bulldoa","I recently discovered probabilistic data structure and find it very interesting, bloom filter and hyperloglog is super cool, I am interested in learning more, is there recommend…",[111,118,122],{"value":112,"source":47,"evidence":113},"HLL-MinHash via AdRoll cantor library",[114,115],{"id":54,"by":55,"text":56},{"id":116,"by":51,"text":117},"16106321","Hi there! I'm the author of the paper the OP implemented, so I thought I'd give a bit more context. In practice, combining together HLL and MinHash as they do for AdRoll gives…",{"value":119,"source":47,"evidence":120},"Inclusion-exclusion with gohll",[121],{"id":68,"by":69,"text":70},{"value":123,"source":47,"evidence":124},"Ertl's improved HLL estimation with dnbaker\u002Fhll",[125],{"id":80,"by":81,"text":82},{"comments":32,"answered":32,"key":127},[128,131,134],{"id":129,"text":130},"16099659","the is supposed to show you how stupid i sometimes can be :P",{"id":132,"text":133},"16100358","Ok fixed it. My bad :(",{"id":135,"text":136},"16100904","its meant for merging and intersecting and it should be max 5% error",{"commenters":138,"max_depth":32,"maker_replies":32,"first_comment_mins":139,"lifespan_hours":140},12,124,30,[142,144,146,148,152,155,157,160,162,164,165,167,169,172,174,176],[68,39,41,143,69,39],"project\u002Fpositive\u002Fidea",[107,39,39,145,108,39],"other\u002Fneutral\u002Fnone",[80,34,32,147,81,39],"project\u002Fmixed\u002Fexecution",[149,34,39,150,151,39],"16101613","commenter\u002Fneutral\u002Fnone","xstartup",[153,34,39,150,154,39],"16101928","dman",[156,34,39,150,81,39],"16110741",[50,158,41,159,51,39],2,"project\u002Fpositive\u002Fexecution",[93,32,32,161,94,39],"project\u002Fneutral\u002Fexecution",[129,32,39,163,11,34],"maker\u002Fneutral\u002Fnone",[132,32,39,163,11,34],[100,33,32,166,101,39],"project\u002Fneutral\u002Fidea",[135,33,39,168,11,34],"project\u002Fneutral\u002Fperformance",[170,33,32,166,171,39],"16101479","gopalv",[64,41,41,173,65,39],"project\u002Fpositive\u002Fnone",[54,41,34,175,55,39],"project\u002Fcritical\u002Fidea",[116,41,32,166,51,39],[],[179,184,188,193,198,203],{"id":180,"name":181,"points":182,"category":183},"16070394","PAST",362,"security_privacy",{"id":185,"name":186,"points":187,"category":20},"16090977","A simple Go web server with logging, tracing, health check",318,{"id":189,"name":190,"points":191,"category":192},"16086800","Eel",201,"dev_tools",{"id":194,"name":195,"points":196,"category":197},"16108701","Hooks Data API",145,"data",{"id":199,"name":200,"points":201,"category":202},"16095477","Pushup alarm",134,"consumer_social",{"id":204,"name":205,"points":206,"category":20},"16117047","Nerv",133,false,"v2",{"id":210,"name":5,"line":6,"ai":207,"cat":20,"year":13,"points":14,"comments":15,"rec":29,"s":211,"top":18,"kw":212,"maker":11,"domain":10,"tier":19,"attempts":39,"strip":213,"url":9,"mix":214,"praise":61,"objection":77,"sub":21},16097776,0.22,[24,25,26,27,28],"5030005300303513",[32,33,34,34],1794036562422]