Corpus ID: 221970742

Rank/Select Queries over Mutable Bitmaps

@article{Pibiri2020RankSelectQO,
  title={Rank/Select Queries over Mutable Bitmaps},
  author={Giulio Ermanno Pibiri and Shunsuke Kanda},
  journal={ArXiv},
  year={2020},
  volume={abs/2009.12809}
}

Giulio Ermanno Pibiri, Shunsuke Kanda

Published 2020

Computer Science

ArXiv

The problem of answering rank/select queries over a bitmap is of utmost importance for many succinct data structures. When the bitmap does not change, many solutions exist in the theoretical and practical side. In this work we consider the case where one is allowed to modify the bitmap via a flip(i) operation that toggles its i-th bit. By adapting and properly extending some results concerning prefix-sum data structures, we present a practical solution to the problem, tailored for modern CPU… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed