Adds new tutorials, updates the existing by nermiller · Pull Request #11 · redis/Tutorials

nermiller · 2023-01-17T05:44:59Z

No description provided.

nermiller · 2023-01-17T05:45:50Z

@elena-kolevska, @ViktarStarastsenka, please review these tutorial updates.

elena-kolevska · 2023-01-18T10:16:17Z

This looks great to me, I just think that the t-digest page seems like a bit of an outlier. It doesn't follow the bikes use case and it has a lot of details about commands compared to the others. We have 4 more probabilistic data structures in RedisBloom that we're not mentioning, so as a user, I might wonder why are only Bloom and t-digest mentioned.

Also, it would be nice if we can create examples for the path-finding algorithms that use the same dataset as the rest of the tutorial, but I know that this can be tricky sometimes.

src/redis_stack/working_with_path_algorithms.md

LiorKogan · 2023-02-08T11:18:57Z

src/redis_stack/working_with_bloom_filter.md

+
+If you receive unhelpful queries from the clients to the database because no keys are matched in Redis, you can use a Bloom filter to filter such queries.
+
+These guidelines help you learn how to use a Bloom filter to reduce heavy calls to the relational database or memory.


I'm not sure if 'memory' should be used here. I assume the call wouldn't be heavy.

LiorKogan · 2023-02-08T11:19:24Z

src/redis_stack/working_with_bloom_filter.md

+
+A Bloom filter is a probabilistic data structure that enables you to check if an element is present in a set using a very small memory space of a fixed size. It can guarantee the absence of an element from a set by giving a Boolean response about its presence. So, when it responds that an element is not present in a set ('false`), you can be sure that indeed is the case. However, false positive matches are possible. Controllable tradeoffs between accuracy and memory consumption from a Bloom filter are possible via the `error_rate` argument of the `BF.RESERVE` command.
+
+If you receive unhelpful queries from the clients to the database because no keys are matched in Redis, you can use a Bloom filter to filter such queries.


Finding if a key exists in Redis is fast. We don't recommend creating a Bloom filter for this. (+ you also have the accurate information, so what add probabilistic on top of it).
Finding if a key exists in some external (disk-based) database, to avoid cache penetration for the external database, using Redis Bloom filter - does make sense.

LiorKogan · 2023-02-08T11:31:06Z

src/redis_stack/working_with_bloom_filter.md

+
+These guidelines help you learn how to use a Bloom filter to reduce heavy calls to the relational database or memory.
+
+## Avoiding cache penetration


Again, the assumption is that there is some heavy database (not Redis) in the system, and we want to use RedisBloom to avoid cache penetration for that external database (not for Redis itself).

It is important to explain this deployment here and the problem that we are trying to solve in order to make this use case understandable.

In this specific example each query is client's IP address and information about this IP address is stored in some external (presumably slow) database. There are many queries with IP addresses that do not exist in the external database, and we want to reduce the number of queries to the external database by detecting non-existing IP addresses using RedisBloom and hence reducing the number of accesses to the external DB.

LiorKogan · 2023-02-08T11:40:52Z

src/redis_stack/working_with_bloom_filter.md

+
+Because false-positive matches are possible with a Bloom filter (BF), you can use these options to better handle incoming requests.
+
+### Store all valid keys in a BF upfront


just to clarify - 'keys' here are IP addresses = keys of the external database.

LiorKogan · 2023-02-08T11:43:58Z

src/redis_stack/working_with_graphs.md

+You can use graphs for highly interconnected data, like relationships between people, organizations, groups, documents, or places they have access to, and so on.

-## Creating nodes
+Suppose you want to track which bikes users bought so you can suggest them based on the fact that their friends have also bought them. 


Change users to owners?

LiorKogan · 2023-02-08T11:45:18Z

src/redis_stack/working_with_graphs.md

+
 ```redis Create users
 // Let's create some user nodes
 GRAPH.QUERY bikes_graph 'CREATE (u:User { Name:"Andrea"})'


I believe we should change 'User' to 'Person'. That's the real entity type.

LiorKogan · 2023-02-08T11:45:43Z

src/redis_stack/working_with_graphs.md

+
+Model graph data:
+
+- A user makes a transaction.


Again, 'Person' instead of 'User'

LiorKogan · 2023-02-08T11:47:54Z

src/redis_stack/working_with_graphs.md

+
+## Use Bloom to check if username is free 
+
+Wonder how a Bloom filter can be used for your bike shop? For starters, you could keep a Bloom filter that stores all usernames of people who've already registered with your service. That way, when someone creates a new account, you can very quickly check if that username is free. If the answer is yes, you still have to go and check the main database for the precise result. But, if the answer is no, you can skip that call and continue with the registration. 


We shouldn't recommend using BF to check if something exist in Redis (in this case - if there is some node in RedisGraph). RedisGraph has the full information, so why use probabilistic data. Also, RedisGraph is stored in RAM so it should be fast enough for such qeries.

nermiller and others added 2 commits January 17, 2023 00:40

Updates tutorials, adds path algorithms and t-digest instructions

4f0801e

Merge branch 'RedisInsight:main' into main

4f90be7

nermiller changed the title ~~Adds new tutorials, updates the existing ones~~ Adds new tutorials, updates the existing Jan 17, 2023

nermiller added 6 commits January 27, 2023 01:01

Update working_with_bloom_filter.md

80ffdca

Update working_with_graphs.md

08cd8fe

Update working_with_bloom_filter.md

7b49ed6

Update working_with_bloom_filter.md

032552b

Update working_with_graphs.md

2779820

Update working_with_path_algorithms.md

fe0556c

nermiller commented Feb 7, 2023

View reviewed changes

src/redis_stack/working_with_path_algorithms.md Outdated Show resolved Hide resolved

Update src/redis_stack/working_with_path_algorithms.md

3bb968e

LiorKogan reviewed Feb 8, 2023

View reviewed changes

ViktarStarastsenka closed this Jan 26, 2024

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Comments

Adds new tutorials, updates the existing#11

Adds new tutorials, updates the existing#11
nermiller wants to merge 9 commits intoredis:mainfrom
nermiller:main

nermiller commented Jan 17, 2023

Uh oh!

nermiller commented Jan 17, 2023

Uh oh!

elena-kolevska commented Jan 18, 2023 •

edited

Loading

Uh oh!

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

LiorKogan Feb 8, 2023

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

4 participants


		If you receive unhelpful queries from the clients to the database because no keys are matched in Redis, you can use a Bloom filter to filter such queries.

		These guidelines help you learn how to use a Bloom filter to reduce heavy calls to the relational database or memory.


		A Bloom filter is a probabilistic data structure that enables you to check if an element is present in a set using a very small memory space of a fixed size. It can guarantee the absence of an element from a set by giving a Boolean response about its presence. So, when it responds that an element is not present in a set ('false`), you can be sure that indeed is the case. However, false positive matches are possible. Controllable tradeoffs between accuracy and memory consumption from a Bloom filter are possible via the `error_rate` argument of the `BF.RESERVE` command.

		If you receive unhelpful queries from the clients to the database because no keys are matched in Redis, you can use a Bloom filter to filter such queries.


		These guidelines help you learn how to use a Bloom filter to reduce heavy calls to the relational database or memory.

		## Avoiding cache penetration


		Because false-positive matches are possible with a Bloom filter (BF), you can use these options to better handle incoming requests.

		### Store all valid keys in a BF upfront


		## Use Bloom to check if username is free

		Wonder how a Bloom filter can be used for your bike shop? For starters, you could keep a Bloom filter that stores all usernames of people who've already registered with your service. That way, when someone creates a new account, you can very quickly check if that username is free. If the answer is yes, you still have to go and check the main database for the precise result. But, if the answer is no, you can skip that call and continue with the registration.

Comments

Conversation

nermiller commented Jan 17, 2023

Uh oh!

nermiller commented Jan 17, 2023

Uh oh!

elena-kolevska commented Jan 18, 2023 • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Uh oh!

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

4 participants

elena-kolevska commented Jan 18, 2023 •

edited

Loading