43 search results - page 1 / 9 » Using the Power of Two Choices to Improve Bloom Filters |
IM
2007
13 years 4 months ago
2007
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
TC
2011
12 years 11 months ago
2011
— Implementing shared memory consistency models on top of hardware caches gives rise to the well-known cache coherence problem. The standard solution involves implementing cohere...
ISLPED
2006
ACM
13 years 10 months ago
2006
ACM
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...