101 search results - page 9 / 21 » The Bloom paradox: When not to use a Bloom filter |
ISLPED
2006
ACM
14 years 1 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. ...
ACSAC
2008
IEEE
13 years 9 months ago
2008
IEEE
Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Mea...
INFOCOM
2012
IEEE
11 years 9 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...
ICCCN
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper we present a hardware architecture for string matching. Our solution based on using a Bloom filter based pre-processor and a parallelized hashing engine is capab...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...