Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences
- 1.9k Downloads
Rank & select data structures are one of the fundamental building blocks for many modern succinct data structures. With the continued growth of massive-scale information services, the space efficiency of succinct data structures is becoming increasingly attractive in practice. In this paper, we re-examine the design of rank & select data structures from the bottom up, applying an architectural perspective to optimize their operation. We present our results in the form of a recipe for constructing space and time efficient rank & select data structures for a given hardware architecture. By adopting a cache-centric design approach, our rank & select structures impose space overhead as low as the most space-efficient, but slower, prior designs—only 3.2% and 0.39% extra space respectively—while offering performance competitive with the highest-performance prior designs.
KeywordsBasic Block Combine Sampling Cache Line Array Density Lower Block
Unable to display preview. Download preview PDF.
- 1.Clark, D.R.: Compact pat trees. PhD thesis, Waterloo, Ont., Canada, Canada (1998)Google Scholar
- 3.Fano, R.M.: On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC (1971)Google Scholar
- 4.Gog, S.: https://github.com/simongog/sdsl
- 5.González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA 2005), pp. 27–38 (2005)Google Scholar
- 6.Jacobson, G.: Space-efficient static trees and graphs. In: Proc. Symposium on Foundations of Computer Science, SFCS 1989, pp. 549–554. IEEE Computer Society, Washington, DC (1989)Google Scholar
- 7.Knuth, D.E.: The Art of Computer Programming. Fascicle: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol. 4. Addison-Wesley Professional (2009)Google Scholar