<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1612.02284/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1612.02284/feed.xml" rel="self" type="application/rss+xml" /><item><title>LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting — mentioned by octernion</title><link>https://news.ycombinator.com/item?id=13239651</link><guid isPermaLink="false">urn:hackerpapers:mention:1612.02284:13239651</guid><pubDate>Thu, 22 Dec 2016 19:30:45 GMT</pubDate><description>&lt;p&gt;See the Arxiv paper[0] on it. Found this from the Redis code[1] (I was curious, too). [0]:https://arxiv.org/abs/1612.02284 [1]:https://github.com/antirez/redis/blob/87538cb7fe19b567118944...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1612.02284/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
