Optimal Indexes for Sparse Bit Vectors

Details Optimal Indexes for Sparse Bit Vectors Optimal Indexes for Sparse Bit Vectors

2011-08-10

arxiv.org/abs/1108.2157v1

Computer Science

Data Structures and Algorithms

Some of these results were published in preliminary form in the proceedings of SWAT 2008. There are new upper bounds not in th

Scientific paper

We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit vector is stored in "read-only" memory and an additional data structure, called the index, is created during pre-processing to help answer the above queries. We give asymptotically optimal density-sensitive trade-offs, involving both m and n, that relate the size of the index to the number of accesses to the bit vector (and processing time) needed to answer the above queries. The results are particularly interesting for the case where n = o(m).

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-665294