Rank/Select Queries over Mutable Bitmaps

09/27/2020 ∙ by Giulio Ermanno Pibiri, et al. ∙ 0

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 instruction sets. Compared to the state-of-the-art, our solution improves runtime with no space degradation. Moreover, it does not incur in a significant runtime penalty when compared to the fastest immutable indexes, while providing even lower space overhead.



There are no comments yet.


page 10

page 13

page 14

page 17

page 19

Code Repositories


A C++ library providing rank/select queries over mutable bitmap. http://arxiv.org/abs/2009.12809

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.