Rank and select: Another lesson learned

•We present new solutions for the primitives on binary vectors, ranks and select.•Special care for blocks with all 0 or all 1 bits poses a good space-time tradeoff.•Compressed select is not much slower than compressed rank in a similar space. Rank and select queries on bitmaps are essential building...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information systems (Oxford) 2018-03, Vol.73, p.25-34
Hauptverfasser:	Grabowski, Szymon, Raniszewski, Marcin
Format:	Artikel
Sprache:	eng
Schlagworte:	Binary sequences Coding Compressed data structures Data compression Data structures Datasets Information systems Queries Rank Select Spatial data Time compression Wavelet analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!