jschafer

3 ms·

1. 1.▲
   by jschafer 1y ago

   Yes exactly, I was really excited when I found out that you do not need a FFT to do speech processing. If you look at the code of (phone/voice) codecs GSM/Speex/Opus you can see that you can estimate the spectral envelope (or
2. 2.▲
   by jschafer 2y ago

   SQLite only knows nested loop joins and the bloom filter can just tell us "no need to do a join, there is definitely no matching entry". If it has a false positive all the time (the worst case) then the performance is the same as
3. 3.▲
   by jschafer 2y ago

   I do not know if it is still the case, but the last time I looked into the source code SQLite did hash all strings to the exact same value. So the bloom filter optimization does not work there. It had to do with the different ways strings c
4. 4.▲
   by jschafer 2y ago

   Note that the measurements in the paper were made before they fixed a bug where they confused bits and bytes. So SQLite only used 1/8 of the reserved bloom filter space, thus increasing the false positive rate significantly: https:&#x