/explore
|
You are here 
|
eli.thegreenplace.net | ||
| | | | |
backdrifting.net
[AI summary] The author explains what Bloom Filters are, their limitations, various applications like pre-caching, and the mathematical theory behind using them as constant-space probabilistic data structures. |
|
| | | | | ||
| | | | |
blog.acolyer.org
Meta-learning neural bloom filters Rae et al., ICML'19 Bloom filters are wonderful things, enabling us to quickly ask whether a given set could possibly contain a certain value. They produce this answer while using minimal space and offering O(1) inserts and lookups. It's no wonder Bloom filters and their derivatives (the family of approximate set... |
|
| | | | | ||
| | | | |
www.jamesridgway.co.uk
Querying large datasets can often be challenging, especially when performance is a key concern. Achieving performance at scale often comes with an element of trade-off in how a system is designed to achieve the desired functionality and performance at scale. A bloom filter is one example of a probabilistic data |
|
| | | | | ||
| | | | |
128bit.io
One of the things that really gets me excited about my new job is being able to use new technology. Sure, sometimes new technology is risky but I see groups befitting more then failing due to usingnewer technology. As always when talking about new technology, NoSQL seems to come up because there are a good number of people switching parts (or all) of theirapplication to use NoSQL databases to get by limits or to help withscalability issues. |
|
| | | |||
