![Oracle Drags Its Feet in the JavaScript Trademark Dispute](https://cdn.sanity.io/images/cgdhsj6q/production/919c3b22c24f93884c548d60cbb338e819ff2435-1024x1024.webp?w=400&fit=max&auto=format)
Security News
Oracle Drags Its Feet in the JavaScript Trademark Dispute
Oracle seeks to dismiss fraud claims in the JavaScript trademark dispute, delaying the case and avoiding questions about its right to the name.
github.com/chenny7/cuckoofilter
Well-tuned, production-ready cuckoo filter that performs best in class for low false positive rates (at around 0.01%). For details, see full evaluation.
Cuckoo filter is a Bloom filter replacement for approximated set-membership queries. While Bloom filters are well-known space-efficient data structures to serve queries like "if item x is in a set?", they do not support deletion. Their variances to enable deletion (like counting Bloom filters) usually require much more space.
Cuckoo filters provide the flexibility to add and remove items dynamically. A cuckoo filter is based on cuckoo hashing (and therefore named as cuckoo filter). It is essentially a cuckoo hash table storing each key's fingerprint. Cuckoo hash tables can be highly compact, thus a cuckoo filter could use less space than conventional Bloom filters, for applications that require low false positive rates (< 3%).
"Cuckoo Filter: Better Than Bloom" by Bin Fan, Dave Andersen and Michael Kaminsky
The paper cited above leaves several parameters to choose. In this implementation
1 and 2 are suggested to be the optimum by the authors. The choice of 3 comes down to the desired false positive rate. Given a target false positive rate of r
and a bucket size b
, they suggest choosing the fingerprint size f
using
f >= log2(2b/r) bits
With the 16 bit fingerprint size in this repository, you can expect r ~= 0.0001
.
Other implementations use 8 bit, which correspond to a false positive rate of r ~= 0.03
.
import (
"fmt"
cuckoo "github.com/panmari/cuckoofilter"
)
func Example() {
cf := cuckoo.NewFilter(1000)
cf.Insert([]byte("pizza"))
cf.Insert([]byte("tacos"))
cf.Insert([]byte("tacos")) // Re-insertion is possible.
fmt.Println(cf.Lookup([]byte("pizza")))
fmt.Println(cf.Lookup([]byte("missing")))
cf.Reset()
fmt.Println(cf.Lookup([]byte("pizza")))
// Output:
// true
// false
// false
}
For more examples, see the example tests.
FAQs
Unknown package
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Oracle seeks to dismiss fraud claims in the JavaScript trademark dispute, delaying the case and avoiding questions about its right to the name.
Security News
The Linux Foundation is warning open source developers that compliance with global sanctions is mandatory, highlighting legal risks and restrictions on contributions.
Security News
Maven Central now validates Sigstore signatures, making it easier for developers to verify the provenance of Java packages.