Compression

• Succinct Data Structure

  Data structures using near-optimal space (information-theoretic bounds) while maintaining efficient operations; compress without decompressing.

• Product Quantisation

  Vector compression technique decomposing high-dimensional vectors into products of lower-dimensional quantisers for memory-efficient ANN. Abbreviated PQ.

• Matryoshka Representation Learning

  Training method where prefixes of a vector are also useful embeddings; enables efficient storage and search at multiple granularities. Abbreviated MRL.

• Burrows-Wheeler Transform

  Reversible permutation clustering similar contexts; makes text more compressible and enables FM-index for full-text search.