Bloomier Filters: A second look

Details Bloomier Filters: A second look Bloomier Filters: A second look

2008-07-06

arxiv.org/abs/0807.0928v1

Computer Science

Data Structures and Algorithms

13 Pages, 3 figures, to appear in ESA - 2008

Scientific paper

A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A Bloomier filter generalizes a Bloom filter to compactly store a function with a static support. In this article we give a simple construction of a Bloomier filter. The construction is linear in space and requires constant time to evaluate. The creation of our Bloomier filter takes linear time which is faster than the existing construction. We show how one can improve the space utilization further at the cost of increasing the time for creating the data structure.

Affiliated with

Also associated with

No associations

Rating

Bloomier Filters: A second look does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bloomier Filters: A second look, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bloomier Filters: A second look will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-48983