Top all-time · #20705
Antonio Mallia
Personal blog · antoniomallia.itprogrammingdata
Antonio Mallia's personal blog at antoniomallia.it covers programming and data. Since 2017, 3 different Hacker News readers have linked it 10 times, most often “Sorted integers compression with Elias-Fano encoding”. The last post was in 2019, but the archive is still widely read.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN readers link Antonio Mallia's posts on compressing sorted integers with succinct data structures, cited as a better static alternative to Bloom and xor filters. Commenters use them as support, not as praise.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Personal blog and resume
Most-linked posts?
- Sorted integers compression with Elias-Fano encoding3 people · 4 mentions · first linked 2018-01-06
What Hacker News says?
Comparing a static data structure to two well-known dynamic structures is disingenuous, to say the least. And for a static structure you can do better than just a minimal perfect hash table of fingerprints. You can use a succinct data structure to compress the fingerprints in a form that is still efficiently queryable (unlike say Golomb-compressed sequences): https://www.antoniomallia.it/sorted-integers-compression-…
Comment linking /sorted-integers-compression-with-elias-fano-encoding.html
on “Xor Filters: Faster and Smaller Than Bloom Filters”Submitted Implementing a Gaussian Naive Bayes Classifier in Python as a story · 92 points
HN discussionYeah, and somebody has even done that: https://www.antoniomallia.it/sorted-integers-compression-wit...
Comment linking /sorted-integers-compression-with-elias-fano-encoding.html
on “Sorted Integer Compression”Submitted On-the-fly encoding and decoding of bitmaps as a story · 34 points
HN discussionMore on latency and search: We benchmark against 10 other search APIs on fresh news queries. The median was around 1.2s; we came in around 166ms and scored highest on answer accuracy (89% vs 84% for the next cluster). Latency matters because agents loop. A 1.2s first call eats the budget for follow-ups — you get one shot at framing the query. At sub-250ms the agent can actually search, read, reformulate, and search…
Comment linking /uploads/ECIR19c.pdf
on “Show HN: Seltz – The fastest, high quality, search API for AI agents”Submitted On implementing k Nearest Neighbor for regression in Python as a story · 6 points
HN discussionSubmitted On implementing k Nearest Neighbor for regression in Python as a story · 2 points
HN discussionSubmitted Sorted integers compression with Elias-Fano encoding as a story · 2 points
HN discussionSubmitted On implementing k Nearest Neighbor for regression in Python as a story · 1 points
HN discussionSubmitted Sorted integers compression with Elias-Fano encoding as a story · 1 points
HN discussion