diff options
author | Eduardo Julian | 2021-08-11 02:38:59 -0400 |
---|---|---|
committer | Eduardo Julian | 2021-08-11 02:38:59 -0400 |
commit | a62ce3f9c2b605e0033f4772b0f64c4525de4d86 (patch) | |
tree | ecbabe8f110d82b2e6481cf7c0532d4bd4386570 /documentation/bookmark | |
parent | 464b6e8f5e6c62f58fa8c7ff61ab2ad215e98bd1 (diff) |
Relocated maybe and lazy from data to control.
Diffstat (limited to '')
-rw-r--r-- | documentation/bookmark/platform/php.md | 4 | ||||
-rw-r--r-- | documentation/bookmark/probabilistic_data_structure.md | 12 | ||||
-rw-r--r-- | documentation/bookmark/security/capability_based.md | 4 |
3 files changed, 16 insertions, 4 deletions
diff --git a/documentation/bookmark/platform/php.md b/documentation/bookmark/platform/php.md new file mode 100644 index 000000000..74fe1e7ac --- /dev/null +++ b/documentation/bookmark/platform/php.md @@ -0,0 +1,4 @@ +# Reference + +1. [PHP Internals Book](https://www.phpinternalsbook.com/) + diff --git a/documentation/bookmark/probabilistic_data_structure.md b/documentation/bookmark/probabilistic_data_structure.md index 10529136d..8e74baea7 100644 --- a/documentation/bookmark/probabilistic_data_structure.md +++ b/documentation/bookmark/probabilistic_data_structure.md @@ -6,23 +6,19 @@ # Reference 1. [Ribbon filter: practically smaller than Bloom and Xor](https://arxiv.org/abs/2103.02515) -1. [Teaching Bloom Filters new tricks](https://toao.com/blog/teaching-bloom-filters-new-tricks) 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 1. https://welcometotheoryland.wordpress.com/2017/10/19/what-is-a-hash-function-it-depends-on-whos-speaking/ 1. http://docs.pipelinedb.com/probabilistic.html 1. [Probabilistic Data Structures](https://www.youtube.com/watch?v=F7EhDBfsTA8) 1. http://www.i-programmer.info/programming/theory/4641-the-invertible-bloom-filter.html 1. https://github.com/seiflotfy/hyperbitbit 1. https://blog.yld.io/2017/04/19/hyperloglog-a-probabilistic-data-structure/#.WPtT_R_6zCI -1. http://www.partow.net/programming/bloomfilter/idx.html 1. https://github.com/pawandubey/cuckoo_filter 1. https://cloud.google.com/blog/big-data/2017/07/counting-uniques-faster-in-bigquery-with-hyperloglog 1. https://blog.dataweave.com/using-probabilistic-data-structures-to-build-real-time-monitoring-dashboards-25b17c968c08 1. https://bdupras.github.io/filter-tutorial/ -1. https://sagi.io/2017/07/bloom-filters-for-the-perplexed/ 1. https://www.somethingsimilar.com/2012/05/21/the-opposite-of-a-bloom-filter/ 1. https://github.com/splatlab/cqf 1. [LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting](https://arxiv.org/ftp/arxiv/papers/1612/1612.02284.pdf) @@ -32,3 +28,11 @@ 1. https://hackernoon.com/cuckoo-filter-vs-bloom-filter-from-a-gophers-perspective-94d5e6c53299 1. https://github.com/axiomhq/hyperminhash +## Bloom filter + +1. [Bloom Filters - Much, much more than a space efficient hashmap!](https://boyter.org/posts/bloom-filter/) +1. [Teaching Bloom Filters new tricks](https://toao.com/blog/teaching-bloom-filters-new-tricks) +1. http://www.partow.net/programming/bloomfilter/idx.html +1. https://sagi.io/2017/07/bloom-filters-for-the-perplexed/ +1. https://medium.com/orbs-network/constructing-bloom-filters-without-false-positives-7aaf50b92f3b + diff --git a/documentation/bookmark/security/capability_based.md b/documentation/bookmark/security/capability_based.md new file mode 100644 index 000000000..06e79850b --- /dev/null +++ b/documentation/bookmark/security/capability_based.md @@ -0,0 +1,4 @@ +# Reference + +1. [Introduction To Capability Based Security](http://www.skyhunter.com/marcs/capabilityIntro/index.html) + |