Abstract
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction generalizes the classical Bloom filter, an ingenious hashing scheme heavily used in networks and databases, whose main attribute - space efficiency - is achieved at the expense of a tiny false-positive rate. Whereas Bloom filters can handle only set membership queries, our Bloomier filters can deal with arbitrary functions. We give several designs varying in simplicity and optimality, and we provide lower bounds to prove the (near) optimality of our constructions.
| Original language | English |
|---|---|
| Pages | 30-39 |
| Number of pages | 10 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States Duration: 11 Jan 2004 → 13 Jan 2004 |
Conference
| Conference | Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Country/Territory | United States |
| City | New Orleans, LA. |
| Period | 11/01/04 → 13/01/04 |