101 search results - page 3 / 21 » The Bloom paradox: When not to use a Bloom filter |
IM
2007
13 years 5 months ago
2007
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...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
LCN
2008
IEEE
14 years 11 days ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
APLAS
2009
ACM
14 years 15 days ago
2009
ACM
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...