From 64a90342a74a8ba3f32df6e9ddc70f7b9c60fdf1 Mon Sep 17 00:00:00 2001 From: Pratik Date: Sun, 25 Aug 2024 02:49:28 +0530 Subject: [PATCH] Fix ref --- .../pre-owned-car-platform-with-valkey-part-2/index.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/content/posts/pre-owned-car-platform-with-valkey-part-2/index.md b/content/posts/pre-owned-car-platform-with-valkey-part-2/index.md index 97a7b8e..e29ffb3 100644 --- a/content/posts/pre-owned-car-platform-with-valkey-part-2/index.md +++ b/content/posts/pre-owned-car-platform-with-valkey-part-2/index.md @@ -259,7 +259,7 @@ user-nexon-cars-in-mumbai => model=121&city=1 ## ValKey -We'll discuss how to efficiently store and retrieve car data in-memory, aiming to minimize round trips to ValKey while optimizing space usage. +We'll discuss how to efficiently store and retrieve car data in-memory, aiming to minimize round trips to ValKey[^1] while optimizing space usage. ### Why Use a Hash Set? @@ -292,12 +292,12 @@ Sorted sets offer efficient data retrieval and filtering in ValKey, making them #### Efficient Filtering with Set Theory -While we could use sorting (`SORT` command) on lists or sets to retrieve elements, it's an expensive operation with a time complexity of O(N+M\*log(M)), where: +While we could use sorting (`SORT` command)[^2] on lists or sets to retrieve elements, it's an expensive operation with a time complexity of O(N+M\*log(M)), where: - N is the number of elements in the list/set to sort - M is the number of returned elements -Sorted sets allow us to efficiently filter and retrieve data based on attributes using set theory operations: +Sorted sets allow us to efficiently filter and retrieve data based on attributes using set theory[^4] operations: - Retrieve cars with prices between 100K INR and 500K INR: ```