3.3 Succinct and Compressed Structures

Bit vectors, rank-select, succinct trees, FM-index, wavelet trees, Huffman and arithmetic coding, roaring bitmaps, and compressed range queries.

3.3 Succinct and compressed structures, 45

index slug name
1 succinct-data-structure Succinct Structure
2 bit-vector Bit Vector
3 rank-select Rank Select
4 succinct-rank Succinct Rank
5 succinct-select Succinct Select
6 wavelet-tree-succinct Succinct Wavelet Tree
7 wavelet-matrix-succinct Succinct Wavelet Matrix
8 compressed-trie-succinct Succinct Trie
9 compressed-suffix-array Compressed Suffix Array
10 fm-index FM Index
11 burrows-wheeler-transform BWT
12 run-length-encoding RLE
13 delta-encoding Delta Encoding
14 gamma-coding Gamma Coding
15 elias-delta-coding Elias Delta Coding
16 huffman-coding Huffman Coding
17 arithmetic-coding Arithmetic Coding
18 succinct-tree Succinct Tree
19 balanced-parentheses Balanced Parentheses
20 louds LOUDS
21 compressed-graph Compressed Graph
22 adjacency-bitset Adjacency Bitset
23 sparse-bitset Sparse Bitset
24 roaring-bitmap Roaring Bitmap
25 succinct-hash Succinct Hash
26 minimal-perfect-hash-succinct Succinct MPH
27 compressed-array Compressed Array
28 dictionary-encoding Dictionary Encoding
29 columnar-compression Columnar Compression
30 vector-compression Vector Compression
31 cache-compressed-layout Cache Layout
32 succinct-index Succinct Index
33 compressed-range-query Compressed Range Query
34 compressed-structure-update Update
35 succinct-memory-layout Memory Layout
36 succinct-concurrency Concurrency
37 succinct-lock-free Lock Free
38 succinct-invariant-check Invariant Check
39 succinct-benchmarking Benchmarking
40 succinct-debugging Debugging
41 compressed-io Compressed IO
42 compressed-database Compressed DB Structures
43 succinct-graph-traversal Graph Traversal
44 succinct-tree-navigation Tree Navigation
45 succinct-rank-select-optimization Optimization