Sciweavers

233 search results - page 3 / 47
» Spectral Bloom Filters
Sort
View
138
Voted
DPD
2010
153views more  DPD 2010»
14 years 10 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
113
Voted
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 1 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
141
Voted
TPDS
2010
118views more  TPDS 2010»
14 years 11 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
107
Voted
ICON
2007
IEEE
15 years 7 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
124
Voted
IM
2007
15 years 1 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