25 search results - page 1 / 5 » Low complexity set reconciliation using Bloom filters |
DIALM
2011
ACM
12 years 8 months ago
2011
ACM
TON
2002
13 years 4 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
TKDE
2010
13 years 3 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
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
2007
IEEE
13 years 11 months ago
2007
IEEE
—Bloom filters allow membership queries over sets with allowable errors. It is widely used in databases, networks and distributed systems and it has great potential for distribut...