17 search results - page 2 / 4 » A Scalable Bloom Filter for Membership Queries |
GLOBECOM
2007
IEEE
13 years 12 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...
ESA
2006
Springer
13 years 9 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...
INFOCOM
2006
IEEE
13 years 11 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...
GLOBECOM
2008
IEEE
14 years 13 hour ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...