46 search results - page 3 / 10 » A Shifting Bloom Filter Framework for Set Queries |
IPL
2007
13 years 8 months ago
2007
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 bas...
ISLPED
2006
ACM
14 years 2 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
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...