Bloom maps

Details Bloom maps Bloom maps

2007-10-17

arxiv.org/abs/0710.3246v1

Computer Science

Data Structures and Algorithms

15 pages

Scientific paper

We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our bounds differ by a factor log e. For the upper bound we introduce a novel data structure, the Bloom map, generalising the Bloom filter to this problem. The lower bound follows from an information theoretic argument.

Affiliated with

Also associated with

No associations

Rating

Bloom maps 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 Bloom maps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bloom maps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11637