Please use this identifier to cite or link to this item:
Title: Optimal indexes for sparse bit vectors
Authors: Golynski, Alexander
Orlandi, Alessio
Raman, Rajeev
Rao, S. Srinivasa
First Published: 16-Mar-2013
Publisher: Springer Science+Business
Citation: Algorithmica, 2014, 69 (4), pp. 1-19
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).
DOI Link: 10.1007/s00453-013-9767-2
ISSN: 0178-4617
eISSN: 1432-0541
Version: Post-print
Status: Peer-reviewed
Type: Journal Article
Rights: Copyright © 2014, Springer. Deposited with reference to the publisher’s archiving policy available on the SHERPA/RoMEO website.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
jnl-algo.pdfPost-review (final submitted)354.04 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.