{
  "schema_version": 2,
  "id": "develop/data-types/probabilistic",
  "title": "Probabilistic",
  "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/",
  "summary": "Probabilistic data structures in Redis",
  "aliases": [
    "/data-types/probabilistic/",
    "/manual/data-types/probabilistic/"
  ],
  "tags": [
    "docs",
    "develop",
    "stack",
    "oss",
    "rs",
    "rc",
    "oss",
    "kubernetes",
    "clients"
  ],
  "last_updated": "2026-09-10T15:45:40+01:00",
  "children": [
    {
      "id": "develop/data-types/probabilistic/bloom-filter",
      "summary": "Bloom filters are a probabilistic data structure that checks for presence of an item in a set",
      "title": "Bloom filter",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/bloom-filter/"
    },
    {
      "id": "develop/data-types/probabilistic/count-min-sketch",
      "summary": "Count-min sketch is a probabilistic data structure that estimates the frequency of an element in a data stream.",
      "title": "Count-min sketch",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/count-min-sketch/"
    },
    {
      "id": "develop/data-types/probabilistic/cuckoo-filter",
      "summary": "Cuckoo filters are a probabilistic data structure that checks for presence of an element in a set",
      "title": "Cuckoo filter",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/cuckoo-filter/"
    },
    {
      "id": "develop/data-types/probabilistic/hyperloglogs",
      "summary": "HyperLogLog is a probabilistic data structure that estimates the cardinality of a set.",
      "title": "HyperLogLog",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/hyperloglogs/"
    },
    {
      "id": "develop/data-types/probabilistic/t-digest",
      "summary": "t-digest is a probabilistic data structure that allows you to estimate the percentile of a data stream.",
      "title": "t-digest",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/t-digest/"
    },
    {
      "id": "develop/data-types/probabilistic/top-k",
      "summary": "Top-K is a probabilistic data structure that allows you to find the most frequent items in a data stream.",
      "title": "Top-K",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/top-k/"
    },
    {
      "id": "develop/data-types/probabilistic/configuration",
      "summary": "Redis probabilistic data structures support multiple configuration parameters.",
      "title": "Configuration Parameters",
      "url": "https://redis.io/docs/latest/develop/data-types/probabilistic/configuration/"
    }
  ],
  "page_type": "content",
  "content_hash": "99a8de5670545fdcd746774e3fcae1179dfe5bc875694b5916a80693680e8a22",
  "sections": [
    {
      "id": "content",
      "title": "Content",
      "role": "content",
      "text": "*Probabilistic data structures* give approximations of statistics such as\ncounts, frequencies, and rankings rather than precise values.\nThe advantage of using approximations is that they are adequate for\nmany common purposes but are much more efficient to calculate. They\nsometimes have other advantages too, such as obfuscating times, locations,\nand other sensitive data.\n\nProbabilistic data structures are available as part of Redis Open Source and they are available in Redis Software and Redis Cloud.\nSee\n[Install Redis Open Source](https://redis.io/docs/latest/operate/oss_and_stack/install/install-stack) or\n[Install Redis Software](https://redis.io/docs/latest/operate/rs/installing-upgrading/install)\nfor full installation instructions."
    }
  ],
  "examples": []
}