more
This commit is contained in:
1 parent
13a7338748
commit
cd39a5dec6
74 files changed
+2699
No files matched your search
+40
@@ -0,0 +1,40 @@
|
||||
---
|
||||
title: "Binary fuse filters are a faster alternatives to Bloom filters: they allow you to check (probabilistically) that an element is part of a set."
|
||||
type: archive
|
||||
source: twitter
|
||||
source_url: "https://x.com/lemire/status/1869752213402157131"
|
||||
author: "Daniel Lemire"
|
||||
handle: lemire
|
||||
post_id: "1869752213402157131"
|
||||
date: 2024-12-19
|
||||
archived: 2026-08-29
|
||||
draft: false
|
||||
tags:
|
||||
- archive
|
||||
- twitter
|
||||
- lemire
|
||||
description: "Binary fuse filters are a faster alternatives to Bloom filters: they allow you to check (probabilistically) that an element is part of a set."
|
||||
in_reply_to: ""
|
||||
---
|
||||
|
||||
## Source
|
||||
|
||||
- URL: https://x.com/lemire/status/1869752213402157131
|
||||
- Author: Daniel Lemire (@lemire)
|
||||
- Posted: 2024-12-19 14:30:40
|
||||
|
||||
## Thread
|
||||
|
||||
**1/** **@lemire** ^1869752213402157131
|
||||
|
||||
Binary fuse filters are a faster alternatives to Bloom filters: they allow you to check (probabilistically) that an element is part of a set.
|
||||
|
||||
Oliver Schönrock has been running benchmarks on his C++ implementation of binary fuse filters... and he is getting 100x performance gains on his application.
|
||||
|
||||
(Link as a comment.)
|
||||
|
||||

|
||||
|
||||
**2/** **@lemire** ^1869752368772067376
|
||||
|
||||
https://github.com/oschonrock/binfuse
|
||||
@@ -0,0 +1,12 @@
|
||||
---
|
||||
title: lemire
|
||||
type: note
|
||||
draft: false
|
||||
description: Archived threads by lemire.
|
||||
tags:
|
||||
- archive
|
||||
- twitter
|
||||
- lemire
|
||||
---
|
||||
|
||||
- [[archive/threads/lemire/2024-12-19-binary-fuse-filters-are-a-faster-alternatives-to]]
|
||||
Reference in new issue
Block a user