273 citations · 290 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023★ 11 cited
Grafite: Taming Adversarial Queries with Optimal Range Filters
Marco Costa, Paolo Ferragina, Giorgio Vinciguerra
Range filters allow checking whether a query range intersects a given set of keys with a chance of returning a false positive answer, thus generalising the functionality of Bloom f…
cs.DS2023
Learned Monotone Minimal Perfect Hashing
Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders +1
A Monotone Minimal Perfect Hash Function (MMPHF) constructed on a set S of keys is a function that maps each key in S to its rank. On keys not in S, the function returns an arbitra…