Sciweavers

165 search results - page 2 / 33
» Theory and Network Applications of Dynamic Bloom Filters
Sort
View
TPDS
2010
118views more  TPDS 2010»
13 years 2 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
GLOBECOM
2008
IEEE
13 years 11 months 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
GLOBECOM
2008
IEEE
13 years 5 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
CN
2011
91views more  CN 2011»
12 years 11 months ago
In-packet Bloom filters: Design and networking applications
Christian Esteve Rothenberg, Carlos Alberto Braz M...
GLOBECOM
2007
IEEE
13 years 11 months ago
A Scalable Bloom Filter for Membership Queries
—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...
Kun Xie, Yinghua Min, Dafang Zhang, Jigang Wen, Ga...