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 $\left(i\right)$ 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.

对于许多简洁的数据结构而言，通过位图回答排名/选择查询的问题至关重要。当位图不变时，在理论和实践方面都存在许多解决方案。在这项工作中，我们考虑了允许通过翻转来修改位图的情况 $（\mathrm{一世}）$ 切换其操作 $\mathrm{一世}$第一点。通过适应和适当扩展有关前缀和数据结构的一些结果，我们为现代CPU指令集量身定制了该问题的实用解决方案。与最新技术相比，我们的解决方案在不降低空间的情况下改善了运行时间。而且，与最快的不可变索引相比，它不会招致重大的运行时间损失，同时还提供了更低的空间开销。