diff options
| author | Eduardo Julian | 2019-12-24 23:05:30 -0400 |
|---|---|---|
| committer | Eduardo Julian | 2019-12-24 23:05:30 -0400 |
| commit | fa37f5d17184db1ed95949352e71542af8fb4ce1 (patch) | |
| tree | c75422049da941ea1f0e61d72b263cb38ed072e2 /documentation/research/Probabilistic data-structure.md | |
| parent | 2690a6ba8ff7998f8dbb778b93fa22976eadb4ac (diff) | |
Ported program generation, host environment and packaging machinery to stdlib.
Diffstat (limited to '')
| -rw-r--r-- | documentation/research/Probabilistic data-structure.md | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/documentation/research/Probabilistic data-structure.md b/documentation/research/Probabilistic data-structure.md index 2b4609c0e..f7c025de2 100644 --- a/documentation/research/Probabilistic data-structure.md +++ b/documentation/research/Probabilistic data-structure.md @@ -5,6 +5,7 @@ # Reference +1. [Xor Filters: Faster and Smaller Than Bloom Filters](https://lemire.me/blog/2019/12/19/xor-filters-faster-and-smaller-than-bloom-filters/) 1. [Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity](http://www.vldb.org/pvldb/vol11/p1041-breslow.pdf) 1. https://github.com/efficient/SuRF 1. https://medium.com/orbs-network/constructing-bloom-filters-without-false-positives-7aaf50b92f3b |