<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Probabilistic on Docs</title>
    <link>https://redis.io/docs/latest/develop/data-types/probabilistic/</link>
    <description>Recent content in Probabilistic on Docs</description>
    <generator>Hugo</generator>
    <language>en</language><atom:link href="https://redis.io/docs/latest/develop/data-types/probabilistic/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Bloom filter</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/bloom-filter/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/bloom-filter/</guid>
      <description>Bloom filters are a probabilistic data structure that checks for presence of an item in a set</description>
    </item>
    
    <item>
      <title>Count-min sketch</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/count-min-sketch/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/count-min-sketch/</guid>
      <description>Count-min sketch is a probabilistic data structure that estimates the frequency of an element in a data stream.</description>
    </item>
    
    <item>
      <title>Cuckoo filter</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/cuckoo-filter/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/cuckoo-filter/</guid>
      <description>Cuckoo filters are a probabilistic data structure that checks for presence of an element in a set</description>
    </item>
    
    <item>
      <title>HyperLogLog</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/hyperloglogs/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/hyperloglogs/</guid>
      <description>HyperLogLog is a probabilistic data structure that estimates the cardinality of a set.&#xA;</description>
    </item>
    
    <item>
      <title>t-digest</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/t-digest/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/t-digest/</guid>
      <description>t-digest is a probabilistic data structure that allows you to estimate the percentile of a data stream.</description>
    </item>
    
    <item>
      <title>Top-K</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/top-k/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/top-k/</guid>
      <description>Top-K is a probabilistic data structure that allows you to find the most frequent items in a data stream.</description>
    </item>
    
    <item>
      <title>Configuration Parameters</title>
      <link>https://redis.io/docs/latest/develop/data-types/probabilistic/configuration/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://redis.io/docs/latest/develop/data-types/probabilistic/configuration/</guid>
      <description>Redis probabilistic data structures support multiple configuration parameters.</description>
    </item>
    
  </channel>
</rss>
