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
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆15Mar 24, 2021Updated 5 years ago
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Jul 1, 2022Updated 3 years ago
- A scalable distributed stream join system☆14Nov 16, 2022Updated 3 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆21Aug 14, 2021Updated 4 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- 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
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆23Jul 1, 2022Updated 3 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 10 years ago
- 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 compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆90Dec 16, 2020Updated 5 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Aug 3, 2023Updated 2 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 fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆24May 18, 2017Updated 9 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 10 months ago
- Compressed double-array tries for static string dictionaries☆12May 9, 2019Updated 7 years ago
- ☆19May 26, 2023Updated 3 years ago
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- ☆13Jan 21, 2022Updated 4 years ago
- ☆16Mar 16, 2021Updated 5 years ago
- lsm-tree with buffered merge☆12Jan 10, 2022Updated 4 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Python Module: Google Safe Browsing Lookup v4☆11Dec 4, 2018Updated 7 years ago
- ☆20Nov 7, 2023Updated 2 years ago
- 图神经网络导论☆12Nov 28, 2021Updated 4 years ago
- A data structure for efficient nearest-neighbor queries.☆72May 10, 2024Updated 2 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- ☆19Mar 13, 2016Updated 10 years ago
- Fast Approximate Membership Filters (C++)☆286Aug 29, 2025Updated 10 months ago
- priority queue for golang☆19Oct 28, 2014Updated 11 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.
- [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
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆36Jan 14, 2026Updated 5 months ago
- similarity join and search algorithms for edit distance and jaccard☆19Dec 17, 2017Updated 8 years ago
- A C++ library for summarizing data streams☆23Jul 26, 2019Updated 6 years ago
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Nov 17, 2019Updated 6 years ago