Sciweavers

46 search results - page 2 / 10
» A Shifting Bloom Filter Framework for Set Queries
Sort
View
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
TPDS
2010
118views more  TPDS 2010»
13 years 3 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
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...
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 7 months ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 6 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...