Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic data sets. DCF supports item insertion/deletion/query, and can flexibly adjust its capacity. A DCF reduces the memory space of the state-of-the-art Dynamic Bloom Filter significantly by 75% as well as greatly impr…
☆38Nov 16, 2017Updated 8 years ago
Alternatives and similar repositories for DCF
Users that are interested in DCF are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Jun 22, 2019Updated 7 years ago
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Apr 13, 2021Updated 5 years ago
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Apr 13, 2021Updated 5 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
- Edit-distance-based similar string joiner and clusterer☆18Jul 2, 2015Updated 11 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.
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Feb 23, 2023Updated 3 years ago
- RDMA Large File Transfer：A Large-scale File and Folder Transfer Framework. By using two components, RDMA Channel and RDMA Verbs.☆14Jan 9, 2020Updated 6 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Aug 3, 2023Updated 2 years ago
- A fast approximate membership query data structure☆12Jul 16, 2024Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 11 months ago
- ☆19May 26, 2023Updated 3 years ago
- ☆13Jan 21, 2022Updated 4 years ago
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- ☆20Nov 7, 2023Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- ☆16Mar 16, 2021Updated 5 years ago
- lsm-tree with buffered merge☆12Jan 10, 2022Updated 4 years ago
- 图神经网络导论☆12Nov 28, 2021Updated 4 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆24May 18, 2017Updated 9 years ago
- ☆19Mar 13, 2016Updated 10 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- similarity join and search algorithms for edit distance and jaccard☆19Dec 17, 2017Updated 8 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- ☆10Dec 7, 2022Updated 3 years ago
- [MSST '24] Prophet: Optimizing LSM-Based Key-Value Store on ZNS SSDs with File Lifetime Prediction and Compaction Compensation.☆15Apr 20, 2024Updated 2 years ago
- This is the open-source site for XFDetector (ASPLOS'20)☆11Mar 5, 2021Updated 5 years ago
- ☆15Feb 15, 2024Updated 2 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Jul 8, 2026Updated last week
- C++ heterogeneous and lock-free containers☆13Sep 5, 2018Updated 7 years ago
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Nov 17, 2019Updated 6 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆40Jul 20, 2018Updated 8 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Dec 15, 2021Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A C++ library for summarizing data streams☆23Jul 26, 2019Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Jun 3, 2021Updated 5 years ago
- ☆13Nov 15, 2017Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆35Apr 7, 2025Updated last year
- Lecture on SIMD units☆11Feb 28, 2017Updated 9 years ago
- ☆11Oct 25, 2023Updated 2 years ago
- Space Saving algorithm implementation (StreamSummary) in Java, used to solve heavy hitters / topk items.☆33Aug 24, 2016Updated 9 years ago