Skip to content

Commit 679455d

Browse files
committed
DOC-3110: incorporate PM feedback
1 parent 61283be commit 679455d

File tree

2 files changed

+6
-10
lines changed

2 files changed

+6
-10
lines changed

src/redis_stack/probabilistic_data_structures.md

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,15 @@
1-
This tutorial will demonstrate Redis Stack's probabilistic data structure capabilities using the bike shop use case.
2-
3-
Redis Stack supports the following probabilistic data structures:
1+
In addition to a comprehensive set of basic data structures, Redis supports the following probabilistic data structures:
42

53
- Bloom filter
64
- Cuckoo filter
75
- Count-min sketch
86
- Top-K
97
- t-digest
8+
- Hyperloglog
109

11-
Probabilistic data structures, in general, provide results that are "close enough" in a much shorter time and by using significantly less memory than other data types such as sets or hashes. Here, you'll learn how to use a Bloom filter.
10+
In this tutorial you will learn how to use a Bloom filter, a resource efficient data structure, in a bike shop use case.
1211

13-
A Bloom filter allows you to check if an element is present in a set using a very small, fixed-size amount of memory. A query will return one of two possible answers:
12+
A Bloom filter allows you to check if an element is present in a set in a memory-efficient and scalable way. A query will return one of two possible answers:
1413

1514
1. the element *might* be in the set
1615
2. the element is definitely not in the set

src/redis_stack/redis_for_time_series.md

Lines changed: 2 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -2,10 +2,7 @@ This tutorial will demonstrate Redis Stack's ability to store time series data u
22

33
The bike shop company consists of multiple physical stores and an online presense. It would be helpful to have an aggregate view of sales volume across the physical and online stores.
44

5-
In the following example, a time series key is created for each of the five shops to track total sales. Each key is marked with an appropriate region label, `east` or `west`. This kind of representation will allows you to easily
6-
query bike sales performance certain time periods on a per shop, per region, or across all shops.
7-
8-
Notice the `DUPLICATE_POLICY SUM`
5+
The following example creates a time series key for five bike shops to track the total sales for each. Each key has an appropriate region label, `east` or `west`. This kind of representation will allow you to easily query bike sales performance over specific periods on a per-shop or per-region basis.
96

107
```redis Create time series per shop
118
TS.CREATE bike_sales_1 DUPLICATE_POLICY SUM LABELS region east compacted no
@@ -18,7 +15,7 @@ TS.CREATE bike_sales_5 DUPLICATE_POLICY SUM LABELS region west compacted no
1815
Notice the `DUPLICATE_POLICY SUM` arguments; these describe how Redis should behave when two events in the same store and region have
1916
the same timestamp. In this case, two sales that happen at exactly the same time in a particular store and region are added together.
2017

21-
Time series data is collected using millisecond timestamps. You can compact time series data and make it available in various sized aggregations. Here's an example of aggregating data by day:
18+
Time series data are collected at a millisecond resolution. You can compact time series data and make it available in various sized aggregations. Here's an example of aggregating data by day:
2219

2320
```redis Time series compaction
2421
TS.CREATE bike_sales_1_per_day LABELS region east compacted yes

0 commit comments

Comments
 (0)