Almeida, Paulo Sérgio and Baquero, Carlos and Preguiça, Nuno and Hutchison, David (2007) Scalable Bloom Filters. Information Processing Letters, 101 (6). pp. 255-261. ISSN 1872-6119Full text not available from this repository.
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 without increasing the false positive probability. This leads typically to a conservative assumption regarding maximum set size, possibly by orders of magnitude, and a consequent space waste. This paper proposes Scalable Bloom Filters, a variant of Bloom filters that can adapt dynamically to the number of elements stored, while assuring a maximum false positive probability.
|Journal or Publication Title:||Information Processing Letters|
|Uncontrolled Keywords:||Data structures ; Bloom filters ; Distributed systems ; Randomized algorithms|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Departments:||Faculty of Science and Technology > School of Computing & Communications|
|Deposited On:||05 Oct 2012 11:33|
|Last Modified:||07 Jan 2015 17:47|
Actions (login required)