对可变位图进行排序/选择
Rank/Select Queries over Mutable Bitmaps
摘要：
对于许多简洁的数据结构，在位图上回答秩/选择查询的问题是极其重要的。当位图不改变时，理论和实践方面存在许多解决方案。在这项工作中，我们考虑的情况下，允许修改位图通过翻转（i）操作，切换其第i位。通过修改和适当扩展有关前缀和数据结构的一些结果，我们提出了一个实用的解决方案，为现代CPU指令集量身定制的问题。与最先进的解决方案相比，我们的解决方案在不降低空间的情况下提高了运行时间。此外，与最快的不可变索引相比，它不会带来显着的运行时损失，同时提供更低的空间开销。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
