23 citations · 28 across the 13 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Approximate Membership Query Filters with a False Positive Free Set
Pedro Reviriego, Alfonso Sánchez-Macián, Stefan Walzer +1
In the last decade, significant efforts have been made to reduce the false positive rate of approximate membership checking structures. This has led to the development of new struc…
cs.DS2021
Fast Succinct Retrieval and Approximate Membership using Ribbon
Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders +1
A retrieval data structure for a static function supports queries that return for any . Retrieval data structures can be used to implemen…
cs.DS2021★ 23 cited
Ribbon filter: practically smaller than Bloom and Xor
Peter C. Dillinger, Stefan Walzer
Filter data structures over-approximate a set of hashable keys, i.e. set membership queries may incorrectly come out positive. A filter with false positive rate is kn…