A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences

Abstract

We introduce a practical data structure for supporting the fundamental operations rank, select, and member on integer sets (and their corresponding characteristic bit vector). Our data structure uses a hybrid compression approach to achieve compressed space, while still supporting the operations efficiently. Our aim is to take advantage of the long runs of successive elements that arise in several practical scenarios. Our experimental results indicate that our approach is highly competitive in these cases with the most efficient state-of-the-art data structures.