From 4167849041d7635a0fc2e81fc2bebae3fa0bb3d9 Mon Sep 17 00:00:00 2001 From: Eduardo Julian Date: Sun, 27 Feb 2022 04:53:04 -0400 Subject: Fixed directive extensions for Lux/Lua. --- documentation/bookmark/business/negotiation.md | 4 ++ .../bookmark/data_structure/probabilistic.md | 42 ++++++++++++++++++ documentation/bookmark/database.md | 4 ++ .../bookmark/probabilistic_data_structure.md | 41 ----------------- documentation/bookmark/tool/insight.md | 4 ++ documentation/bookmark/transducer_stream_pipe.md | 51 +++++++++++----------- 6 files changed, 80 insertions(+), 66 deletions(-) create mode 100644 documentation/bookmark/business/negotiation.md create mode 100644 documentation/bookmark/data_structure/probabilistic.md delete mode 100644 documentation/bookmark/probabilistic_data_structure.md create mode 100644 documentation/bookmark/tool/insight.md (limited to 'documentation') diff --git a/documentation/bookmark/business/negotiation.md b/documentation/bookmark/business/negotiation.md new file mode 100644 index 000000000..636bcbbfe --- /dev/null +++ b/documentation/bookmark/business/negotiation.md @@ -0,0 +1,4 @@ +# Reference + +0. [Rethinking Negotiation: A smarter way to split the pie](https://hbr.org/2021/11/rethinking-negotiation) + diff --git a/documentation/bookmark/data_structure/probabilistic.md b/documentation/bookmark/data_structure/probabilistic.md new file mode 100644 index 000000000..5831523c6 --- /dev/null +++ b/documentation/bookmark/data_structure/probabilistic.md @@ -0,0 +1,42 @@ +# 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. [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 + diff --git a/documentation/bookmark/database.md b/documentation/bookmark/database.md index f061b7604..b2fb5591e 100644 --- a/documentation/bookmark/database.md +++ b/documentation/bookmark/database.md @@ -186,6 +186,10 @@ 0. https://www.aerospike.com/ 0. https://sirix.io/ +## Relational + +0. [dqlite: Embeddable, replicated and fault tolerant SQL engine.](https://github.com/canonical/dqlite) + ## Immutable 0. [immudb: OPEN SOURCE IMMUTABLE DATABASE](https://codenotary.com/technologies/immudb/) diff --git a/documentation/bookmark/probabilistic_data_structure.md b/documentation/bookmark/probabilistic_data_structure.md deleted file mode 100644 index 32f31bf24..000000000 --- a/documentation/bookmark/probabilistic_data_structure.md +++ /dev/null @@ -1,41 +0,0 @@ -# Hash function - -0. http://fastcompression.blogspot.com/2019/03/presenting-xxh3.html -0. http://cyan4973.github.io/xxHash/ - -# Reference - -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. [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 - diff --git a/documentation/bookmark/tool/insight.md b/documentation/bookmark/tool/insight.md new file mode 100644 index 000000000..614f41b5c --- /dev/null +++ b/documentation/bookmark/tool/insight.md @@ -0,0 +1,4 @@ +# Exemplar + +0. [C++ Insights - See your source code with the eyes of a compiler.](https://github.com/andreasfertig/cppinsights) + diff --git a/documentation/bookmark/transducer_stream_pipe.md b/documentation/bookmark/transducer_stream_pipe.md index 5ba3f040a..cb8aae481 100644 --- a/documentation/bookmark/transducer_stream_pipe.md +++ b/documentation/bookmark/transducer_stream_pipe.md @@ -1,28 +1,29 @@ # Reference -1. [zug](https://sinusoid.es/zug/) -1. https://dev.to/greencoder/build-your-own-transducer-and-impress-your-cat---part-1-mhp -1. https://functional.works-hub.com/learn/reducers-and-transducers-introductory-d0cff -1. http://beerendlauwers.be/posts/2015-12-09-transducers.html -1. https://clojure.org/reference/transducers -1. http://sickaf.xyz/2017/07/transducers -1. http://hypirion.com/musings/haskell-transducers -1. https://github.com/hyPiRion/haskell-transducers -1. https://github.com/cgrand/xforms -1. https://deque.blog/2017/07/28/implementing-clojure-like-transducers-in-idris-part-1/ -1. http://jlongster.com/Transducers.js--A-JavaScript-Library-for-Transformation-of-Data -1. https://labs.uswitch.com/transducers-from-the-ground-up-the-essence/amp/ -1. https://bendyworks.com/blog/transducers-clojures-next-big-idea -1. http://conscientiousprogrammer.com/blog/2014/08/07/understanding-cloure-transducers-through-types/ -1. [Lighting Talk - How to Write a Fast, Reducible Collection - Ghadi Shayban](https://www.youtube.com/watch?v=FjKnlzQfAPc) -1. [Lazy v. Yield: Incremental, Linear Pretty-printing](https://www.cs.indiana.edu/~sabry/papers/yield-pp.pdf) -1. https://labs.uswitch.com/transducers-from-the-ground-up-the-practice/ -1. [Continuations and Transducer Composition](http://matt.might.net/papers/might2006transducers.pdf) -1. https://deque.blog/2017/11/13/free-monads-from-basics-up-to-implementing-composable-and-effectful-stream-processing/ -1. https://www.tweag.io/posts/2018-06-21-linear-streams.html -1. [Common Lisp Study Group An Intro to SERIES](https://www.youtube.com/watch?v=uRLgZCV4bOM) -1. [Appendix A. Series](https://www.cs.cmu.edu/Groups/AI/html/cltl/clm/node347.html) -1. [YOW! Lambda Jam 2018 - Simon Belak - Transducing for fun and profit](https://www.youtube.com/watch?v=H0sSbTWxTsM) -1. https://nextjournal.com/zampino/fold -1. [Fusing Effectful Comprehensions*](https://www.microsoft.com/en-us/research/wp-content/uploads/2016/10/fusing_effectful_comprehensions.pdf) +0. [Complete Guide to Transducers](https://nwcalvank.dev/transducers/) +0. [zug](https://sinusoid.es/zug/) +0. https://dev.to/greencoder/build-your-own-transducer-and-impress-your-cat---part-1-mhp +0. https://functional.works-hub.com/learn/reducers-and-transducers-introductory-d0cff +0. http://beerendlauwers.be/posts/2015-12-09-transducers.html +0. https://clojure.org/reference/transducers +0. http://sickaf.xyz/2017/07/transducers +0. http://hypirion.com/musings/haskell-transducers +0. https://github.com/hyPiRion/haskell-transducers +0. https://github.com/cgrand/xforms +0. https://deque.blog/2017/07/28/implementing-clojure-like-transducers-in-idris-part-1/ +0. http://jlongster.com/Transducers.js--A-JavaScript-Library-for-Transformation-of-Data +0. https://labs.uswitch.com/transducers-from-the-ground-up-the-essence/amp/ +0. https://bendyworks.com/blog/transducers-clojures-next-big-idea +0. http://conscientiousprogrammer.com/blog/2014/08/07/understanding-cloure-transducers-through-types/ +0. [Lighting Talk - How to Write a Fast, Reducible Collection - Ghadi Shayban](https://www.youtube.com/watch?v=FjKnlzQfAPc) +0. [Lazy v. Yield: Incremental, Linear Pretty-printing](https://www.cs.indiana.edu/~sabry/papers/yield-pp.pdf) +0. https://labs.uswitch.com/transducers-from-the-ground-up-the-practice/ +0. [Continuations and Transducer Composition](http://matt.might.net/papers/might2006transducers.pdf) +0. https://deque.blog/2017/11/13/free-monads-from-basics-up-to-implementing-composable-and-effectful-stream-processing/ +0. https://www.tweag.io/posts/2018-06-21-linear-streams.html +0. [Common Lisp Study Group An Intro to SERIES](https://www.youtube.com/watch?v=uRLgZCV4bOM) +0. [Appendix A. Series](https://www.cs.cmu.edu/Groups/AI/html/cltl/clm/node347.html) +0. [YOW! Lambda Jam 2018 - Simon Belak - Transducing for fun and profit](https://www.youtube.com/watch?v=H0sSbTWxTsM) +0. https://nextjournal.com/zampino/fold +0. [Fusing Effectful Comprehensions*](https://www.microsoft.com/en-us/research/wp-content/uploads/2016/10/fusing_effectful_comprehensions.pdf) -- cgit v1.2.3