239 search results - page 7 / 48 » Blooms |
IBMSJ
2006
13 years 7 months ago
2006
INFOCOM
2006
IEEE
14 years 1 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
14 years 1 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...
FCCM
2004
IEEE
13 years 11 months ago
2004
IEEE
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large...
TKDE
2010
13 years 5 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...