Analysis updated 2026-07-18 · repo last pushed 2018-12-15
Check whether a user ID likely exists before running a more expensive database lookup
Have a cache quickly decide if an item is worth retrieving without a full query
Experiment with learned data structures as a faster alternative to hash-based Bloom filters
Process large training datasets with Apache Spark to build a membership-prediction model
| ngaut/deepbloom-1 | abhishek-kumar09/pmd | ahus1/cdt | |
|---|---|---|---|
| Language | Java | Java | Java |
| Last pushed | 2018-12-15 | 2020-11-15 | 2024-11-05 |
| Maintenance | Dormant | Dormant | Stale |
| Setup difficulty | hard | moderate | moderate |
| Complexity | 4/5 | 3/5 | 3/5 |
| Audience | developer | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Requires Apache Spark and upfront model training time before it delivers speed benefits.
DeepBloom uses a trained machine learning model instead of a traditional Bloom filter to quickly and efficiently check whether an item exists in a dataset.
Mainly Java. The stack also includes Java, Apache Spark.
Dormant — no commits in 2+ years (last push 2018-12-15).
Setup difficulty is rated hard, with roughly 1day+ to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.