Sciweavers

239 search results - page 3 / 48
» Blooms
Sort
View
AINA
2007
IEEE
13 years 10 months ago
Improving distributed join efficiency with extended bloom filter operations
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
Loizos Michael, Wolfgang Nejdl, Odysseas Papapetro...
GLOBECOM
2008
IEEE
14 years 21 days ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— 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...
Mahmood Ahmadi, Stephan Wong
ENTCS
2002
66views more  ENTCS 2002»
13 years 6 months ago
Unique, guarded fixed points in an additive setting: Extended Abstract
Abstract Stephen L. Bloom Department of Computer Science Stevens Institute of Technology Hoboken, NJ 07030 and Zolt
Stephen L. Bloom, Zoltán Ésik
TKDE
2010
184views more  TKDE 2010»
13 years 4 months ago
The Dynamic Bloom Filters
—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...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ICON
2007
IEEE
14 years 17 days ago
A Cache Architecture for Counting Bloom Filters
— Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., u...
Mahmood Ahmadi, Stephan Wong