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

    Figures and Tables from this paper

    References

    SHOWING 1-10 OF 32 REFERENCES
    Fast, Small, Simple Rank/Select on Bitmaps
    • 84
    • PDF
    Broadword Implementation of Rank/Select Queries
    • 119
    • Highly Influential
    • PDF
    Rank and select: Another lesson learned
    • 3
    • PDF
    Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences
    • 16
    • Highly Influential
    • PDF
    Optimized succinct data structures for massive data
    • 68
    • Highly Influential
    • PDF
    From Theory to Practice: Plug and Play with Succinct Data Structures
    • 285
    • Highly Influential
    • PDF
    Practical Trade-Offs for the Prefix-Sum Problem
    • 2
    • PDF
    A Fast x86 Implementation of Select
    • 3
    • PDF
    A Framework of Dynamic Data Structures for String Processing
    • N. Prezza
    • Computer Science, Mathematics
    • SEA
    • 2017
    • 12
    • PDF