Abstract
AbstractBit vectors are fundamental building blocks of succinct data structures used in compressed text indices, e.g., in the form of the wavelet trees. Here, two types of queries are of interest: rank and select queries. In practice, the smallest (uncompressed) rank and select data structure cs-poppy has a space overhead of $$\approx $$
≈
3.51 % [Zhou et al. SEA 2013] [26]. Using the same overhead, we present a data structure that can answer queries up to 8 % (rank) and 16.5 % (select) faster compared with cs-poppy.
Publisher
Springer International Publishing
Reference26 articles.
1. Arroyuelo, D., Weitzman, M.: A hybrid compressed data structure supporting rank and select on bit sequences. In: SCCC, pp. 1–8. IEEE (2020). https://doi.org/10.1109/SCCC51225.2020.9281244
2. Beskers, K., Fischer, J.: High-order entropy compressed bit vectors with rank/select. Algorithms 7(4), 608–620 (2014). https://doi.org/10.3390/a7040608
3. Boffa, A., Ferragina, P., Vinciguerra, G.: A learned approach to design compressed rank/select data structures. ACM Trans. Algorithms 18(3), 1–28 (2022). https://doi.org/10.1145/3524060
4. Clark, D.R.: Compact pat trees. Ph.D. thesis, University of Waterloo (1997)
5. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage (extended abstract). In: SODA, pp. 383–391. ACM/SIAM (1996)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bit-Parallel Wavelet Tree Construction (Abstract);Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing;2024-06-17
2. Compressing Vehicle Trajectory Data Using Hybrid Coding With Kinematic Motion Prediction;IEEE Transactions on Intelligent Transportation Systems;2024-06
3. Faster Wavelet Tree Queries;2024 Data Compression Conference (DCC);2024-03-19
4. Grafite: Taming Adversarial Queries with Optimal Range Filters;Proceedings of the ACM on Management of Data;2024-03-12
5. CoCo-trie: Data-aware compression and indexing of strings;Information Systems;2024-02