aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGravatar Runxi Yu2026-03-11 19:10:00 +0800
committerGravatar Runxi Yu2026-03-11 19:10:00 +0800
commit6be60560864cdd58d571cafa0eeee134c9ae4f70 (patch)
treebedf44faf345cc9a7783e8df3b74462a13ec037f
parentinternal/commitquery: Unexport priority queue (diff)
signatureNo signature
research: Maybe drop mmap in packfile_bloom
-rw-r--r--research/packfile_bloom.txt11
1 files changed, 11 insertions, 0 deletions
diff --git a/research/packfile_bloom.txt b/research/packfile_bloom.txt
index 7a3aae02..2b695ad8 100644
--- a/research/packfile_bloom.txt
+++ b/research/packfile_bloom.txt
@@ -128,3 +128,14 @@ relevant object format hash algorithm could be used to fill up the bloom
filters, rendering some buckets useless. In the worst case, if they somehow
fill all filters, this proposal's optimizations become useless, but would not
be a significant DoS vector.
+
+TODOs
+-----
+
+* Consider dropping mmap (page read vs cachline read)
+* How should B and K be chosen?
+* How does creation/insert work? Note that packfiles and `.idx`es are immutable.
+* What are the sizes?
+* What are the false positive rates?
+* Is there a way to make this SIMD friendly?
+* How are benchmarks?