{
  "slug": "succinct-data-structure",
  "term": "Succinct data structure",
  "aliases": [
    "Succinct data structures"
  ],
  "definition": "A succinct data structure supports specified operations using the information-theoretic minimum space for its object class plus a lower-order redundancy.",
  "note": "Bound: If U is the class of possible objects, the worst-case distinguishing budget is ceil(log2(|U|)) bits. Succinct space adds o(log2(|U|)) redundancy; compact space only requires the same asymptotic order. The object class must be stated. [definition]\n\nBitvectors: For all length-n binary strings, |U| = 2^n and the succinct target is n + o(n) bits. Fixing the number of ones to k changes the class size to choose(n,k). A bound with o(n) redundancy need not be lower-order relative to log2(choose(n,k)) for very sparse inputs. [definition] [rrr]\n\nQueries: Rank/select support enables navigation without expanding an entire bitmap. Succinctness describes space, not a universal query-time guarantee; operation costs and the computational model are separate parts of the contract. [definition] [practical]\n\nEngineering: Lower-order does not mean negligible at deployed sizes. Count samples, pointers, lookup tables and boundary handling alongside encoded data. A theorem about a data structure is not a measured serialized-file size or a promise that every input shrinks. [practical]",
  "related": [
    "rrr-bitvector",
    "rank-select"
  ],
  "status": "shipping",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-17",
  "citations": [
    {
      "id": "definition",
      "title": "Bille, Gortz and Tarnow: Succinct Data Structures for Segments, CPM 2025, section 2; DOI 10.4230/LIPIcs.CPM.2025.27",
      "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/html/LIPIcs.CPM.2025.27/LIPIcs.CPM.2025.27.html",
      "accessed": "2026-11-17"
    },
    {
      "id": "rrr",
      "title": "Raman, Raman and Rao: Succinct Indexable Dictionaries, arXiv:0705.0552v1 (2007), sections 1.1.3 and 4.1",
      "url": "https://arxiv.org/pdf/0705.0552",
      "accessed": "2026-11-17"
    },
    {
      "id": "practical",
      "title": "Navarro and Providel: Fast, Small, Simple Rank/Select on Bitmaps, SEA 2012, sections 1 and 3",
      "url": "https://www.dcc.uchile.cl/~gnavarro/ps/sea12.1.pdf",
      "accessed": "2026-11-17"
    }
  ],
  "provenance": [
    "Primary-source synthesis of space accounting. No new compression algorithm, native benchmark or measured storage saving is claimed.",
    "The formula is asymptotic over a growing object class; degenerate singleton classes and fixed tiny inputs are not runtime size guarantees."
  ]
}
