Daniel Lemire personal blog

Xor Filters: Faster and Smaller Than Bloom Filters

In software, you frequently need to check whether some objects is in a set. For example, you might have a list of forbidden Web addresses. As someone enters a new Web address, you may want to check whether it is part of your black list. Or maybe you have a large list of already used … Continue reading Xor Filters…
Points
457
HN comments
81
Submissions
1
Cited by
0 commenters

Databases & DataMath & Algorithms2019

On Hacker News

SubmittedTitle on HNPointsComments
Dec 20, 2019Xor Filters: Faster and Smaller Than Bloom Filters by matt_d45781

More from Daniel Lemire

All 87 posts →

Related posts from the same era