diff options
Diffstat (limited to 'documentation/bookmark/data_structure')
| -rw-r--r-- | documentation/bookmark/data_structure/persistent.md | 4 | ||||
| -rw-r--r-- | documentation/bookmark/data_structure/probabilistic.md | 43 |
2 files changed, 0 insertions, 47 deletions
diff --git a/documentation/bookmark/data_structure/persistent.md b/documentation/bookmark/data_structure/persistent.md deleted file mode 100644 index abb205b80..000000000 --- a/documentation/bookmark/data_structure/persistent.md +++ /dev/null @@ -1,4 +0,0 @@ -# Reference - -0. [A Hash Map for Graph Processing Workloads & a Methodology for Transactional Data Structures - CppCon](https://www.youtube.com/watch?v=aeC8yCwQJ-E) - diff --git a/documentation/bookmark/data_structure/probabilistic.md b/documentation/bookmark/data_structure/probabilistic.md deleted file mode 100644 index dd769409d..000000000 --- a/documentation/bookmark/data_structure/probabilistic.md +++ /dev/null @@ -1,43 +0,0 @@ -# Hash function - -0. http://fastcompression.blogspot.com/2019/03/presenting-xxh3.html -0. http://cyan4973.github.io/xxHash/ - -# Reference - -0. [Ribbon Filter](http://rocksdb.org/blog/2021/12/29/ribbon-filter.html) -0. [Binary Fuse Filters: Fast and Smaller Than Xor Filters](https://arxiv.org/abs/2201.01174) -0. [Ribbon filter: practically smaller than Bloom and Xor](https://arxiv.org/abs/2103.02515) -0. [Xor Filters: Faster and Smaller Than Bloom Filters](https://lemire.me/blog/2019/12/19/xor-filters-faster-and-smaller-than-bloom-filters/) -0. [Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity](http://www.vldb.org/pvldb/vol11/p1041-breslow.pdf) -0. https://github.com/efficient/SuRF -0. https://welcometotheoryland.wordpress.com/2017/10/19/what-is-a-hash-function-it-depends-on-whos-speaking/ -0. http://docs.pipelinedb.com/probabilistic.html -0. [Probabilistic Data Structures](https://www.youtube.com/watch?v=F7EhDBfsTA8) -0. http://www.i-programmer.info/programming/theory/4641-the-invertible-bloom-filter.html -0. https://github.com/seiflotfy/hyperbitbit -0. https://blog.yld.io/2017/04/19/hyperloglog-a-probabilistic-data-structure/#.WPtT_R_6zCI -0. https://github.com/pawandubey/cuckoo_filter -0. https://cloud.google.com/blog/big-data/2017/07/counting-uniques-faster-in-bigquery-with-hyperloglog -0. https://blog.dataweave.com/using-probabilistic-data-structures-to-build-real-time-monitoring-dashboards-25b17c968c08 -0. https://bdupras.github.io/filter-tutorial/ -0. https://www.somethingsimilar.com/2012/05/21/the-opposite-of-a-bloom-filter/ -0. https://github.com/splatlab/cqf -0. [LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting](https://arxiv.org/ftp/arxiv/papers/1612/1612.02284.pdf) -0. https://blog.acolyer.org/2017/08/08/a-general-purpose-counting-filter-making-every-bit-count/ -0. [Ode on a Random Urn (Functional Pearl)](https://www.youtube.com/watch?v=O37FMxLxm78) -0. http://smalldatum.blogspot.com/2018/09/bloom-filter-and-cuckoo-filter.html -0. https://hackernoon.com/cuckoo-filter-vs-bloom-filter-from-a-gophers-perspective-94d5e6c53299 -0. https://github.com/axiomhq/hyperminhash - -## Bloom filter - -0. [Sliding Bloom Filter](https://programming.guide/sliding-bloom-filter.html) -0. [Word-aligned Bloom filters](https://lemire.me/blog/2021/10/03/word-aligned-bloom-filters/) -0. [Bloom Filters by Example](https://llimllib.github.io/bloomfilter-tutorial/) -0. [Bloom Filters - Much, much more than a space efficient hashmap!](https://boyter.org/posts/bloom-filter/) -0. [Teaching Bloom Filters new tricks](https://toao.com/blog/teaching-bloom-filters-new-tricks) -0. http://www.partow.net/programming/bloomfilter/idx.html -0. https://sagi.io/2017/07/bloom-filters-for-the-perplexed/ -0. https://medium.com/orbs-network/constructing-bloom-filters-without-false-positives-7aaf50b92f3b - |