Optimal Indexes for Sparse Bit Vectors

Optimal Indexes for Sparse Bit Vectors

0.00 Avg rating0 Votes
Article ID: iaor2014937
Volume: 69
Issue: 4
Start Page Number: 906
End Page Number: 924
Publication Date: Aug 2014
Journal: Algorithmica
Authors: , , ,
Keywords: databases, vector optimization
Abstract:

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).

Reviews

Required fields are marked *. Your email address will not be published.