From 38ae15309d7486dab61a2ca5ca4d6989290bcc60 Mon Sep 17 00:00:00 2001 From: generall Date: Tue, 20 Aug 2024 22:44:10 +0200 Subject: [PATCH] interate crab --- qdrant-landing/content/articles/immutable-data-structures.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/qdrant-landing/content/articles/immutable-data-structures.md b/qdrant-landing/content/articles/immutable-data-structures.md index e596d2c53..f6fce9f72 100644 --- a/qdrant-landing/content/articles/immutable-data-structures.md +++ b/qdrant-landing/content/articles/immutable-data-structures.md @@ -128,7 +128,7 @@ Indeed, every read operation from disk is order of magnitude slower than reading In order to achieve this, we can use a so-called minimal perfect hash function (MPHF). This a special type of hash function is constructed specifically for a given set of keys, and it guarantees no collisions while using minimal amount of buckets. -In Qdrant, we decided to use *fingerprint-based minimal perfect hash function* implemented in the [ph create](https://crates.io/crates/ph) by [Piotr Beling](https://dl.acm.org/doi/10.1145/3596453). +In Qdrant, we decided to use *fingerprint-based minimal perfect hash function* implemented in the [ph create 🦀](https://crates.io/crates/ph) by [Piotr Beling](https://dl.acm.org/doi/10.1145/3596453). According to our benchmarks, using the perfect hash function does introduce some overhead in terms of hashing time, but it significantly reduces the time for the whole operation: | Volume | `ph::Function` | `std::hash::Hash` | `HashMap::get`|