Faster Practical Block Compression for Rank/Select Dictionaries

DOI10.1007/978-3-319-67428-5_20zbMath1454.68032OpenAlexW2752911227MaRDI QIDQ5150935

Yusaku Kaneta

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67428-5_20

zbMATH Keywords

compressioncompact data structuresrank/select queries

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Cites Work

• Membership in Constant Time and Almost-Minimum Space
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Dynamic entropy-compressed sequences and full-text indexes
• A General Framework for Dynamic Succinct and Compressed Data Structures

This page was built for publication: Faster Practical Block Compression for Rank/Select Dictionaries