An implementation of learned index structures for bloom filters.
☆23Sep 4, 2018Updated 7 years ago
Alternatives and similar repositories for DeepBloom
Users that are interested in DeepBloom are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆16Mar 16, 2021Updated 5 years ago
- ☆16May 24, 2022Updated 4 years ago
- Media Art with AI☆21Sep 9, 2019Updated 6 years ago
- ☆10Feb 20, 2021Updated 5 years ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆151Dec 20, 2018Updated 7 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Jan 8, 2018Updated 8 years ago
- This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).☆31Apr 26, 2018Updated 8 years ago
- ☆25Apr 4, 2024Updated 2 years ago
- A forward-secure append-only persistent authenticated data structure☆17Jul 5, 2016Updated 10 years ago
- A Distributed RDF Data Management System for Processing SPARQL Queries Over Distributed RDF Graphs☆14Dec 8, 2022Updated 3 years ago
- ☆13Feb 14, 2020Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 3 years ago
- Python implementation of Cuckoo Filter data structure☆27Dec 17, 2019Updated 6 years ago
- ☆13Aug 1, 2025Updated 11 months ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- The authenticated storage benchmark platform includes implementations like OpenEthereum's MPT, RainBlock's MPT, LMPTs, and LVMT.☆16Jul 6, 2023Updated 3 years ago
- ☆22Dec 19, 2024Updated last year
- A Benchmark for Learned Indexes☆311Apr 27, 2022Updated 4 years ago
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆18Sep 4, 2023Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 11 months ago
- prime search engine☆15Mar 22, 2018Updated 8 years ago
- Code accompanying the paper "Semi-Unsupervised Learning with Deep Generative Models: Clustering and Classifying using Ultra-Sparse Labels…☆13Jan 25, 2019Updated 7 years ago
- WiscKey is a highly SSD optimized key-value storage based on LevelDB.☆33Dec 25, 2021Updated 4 years ago
- Forgetful Bloom filters☆16Mar 8, 2019Updated 7 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Learned Index Structures☆54Oct 12, 2018Updated 7 years ago
- Roaring bitmaps in Haskell☆13Oct 16, 2018Updated 7 years ago
- webGame☆13Aug 20, 2012Updated 13 years ago
- ☆11Oct 25, 2023Updated 2 years ago
- Big Data and Machine Intelligence, Spring 2021.☆12Jul 2, 2021Updated 5 years ago
- A question answering research dataset of movie-related factoids☆10Mar 21, 2016Updated 10 years ago
- C语言，基于mark-sweep算法实现的垃圾回收机制☆12Dec 20, 2018Updated 7 years ago
- URL Feature extraction and Engineering aided with Classification via Neural Networks☆11Dec 11, 2021Updated 4 years ago
- finding set bits in large bitmaps☆15Nov 30, 2015Updated 10 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Tutorial with example on how to create a JavaScript game using Phaser.io and run it on GameShell using NWjs☆12Aug 10, 2018Updated 7 years ago
- Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary…☆21May 31, 2022Updated 4 years ago
- Selective Sampling-based Scalable Sparse Subspace Clustering (NeurIPS 19')☆13Jul 19, 2020Updated 6 years ago
- ☆16Feb 19, 2017Updated 9 years ago
- Code for the paper "Feature Grouping as a Stochastic Regularizer for High-Dimensional Structured Data" at ICML 2019.☆20Apr 22, 2019Updated 7 years ago
- A comparison between different integer set techniques☆15Apr 13, 2018Updated 8 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21May 9, 2021Updated 5 years ago