Scalable bloom filters
Bloom filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori based on the number of elements to store and the desired false positive probability, being impossible to store extra elements w...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/6627 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/6627 |