稀疏比特向量的最佳索引
Optimal Indexes for Sparse Bit Vectors
摘要：
我们考虑的问题，支持秩（）和选择（）操作的位向量长度为m与n 1位。这个问题在简洁索引模型中考虑，其中位向量存储在“只读”存储器中，并且在预处理期间创建称为索引的附加数据结构以帮助回答上述查询。我们给出了渐近最优的密度敏感的权衡，涉及m和n，涉及索引的大小的访问位向量（和处理时间）的数量需要回答上述查询。结果是特别有趣的情况下，n = o（m）。
英文摘要：
We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit vector is stored in "read-only" memory and an additional data structure, called the index, is created during pre-processing to help answer the above queries. We give asymptotically optimal density-sensitive trade-offs, involving both m and n, that relate the size of the index to the number of accesses to the bit vector (and processing time) needed to answer the above queries. The results are particularly interesting for the case where n = o(m).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
