Sciweavers

369 search results - page 5 / 74
» Scalable Bloom Filters
Sort
View
DPD
2010
153views more  DPD 2010»
13 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
TPDS
2010
118views more  TPDS 2010»
13 years 5 months ago
Using Parallel Bloom Filters for Multiattribute Representation on Network Services
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
Bin Xiao, Yu Hua
ICON
2007
IEEE
14 years 1 months 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
IM
2007
13 years 7 months ago
Using the Power of Two Choices to Improve Bloom Filters
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
Steven S. Lumetta, Michael Mitzenmacher
ALENEX
2011
416views Algorithms» more  ALENEX 2011»
12 years 11 months ago
Exact Pattern Matching with Feed-Forward Bloom Filters
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
Iulian Moraru, David G. Andersen