CGCL-codes / DCFLinks
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…
☆39Updated 7 years ago
Alternatives and similar repositories for DCF
Users that are interested in DCF are comparing it to the libraries listed below
Sorting:
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- ☆16Updated 4 years ago
- ☆54Updated last year
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆30Updated 3 years ago
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 6 years ago
- BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)☆10Updated 5 years ago
- ☆122Updated 3 years ago
- ☆149Updated 2 years ago
- ☆38Updated 5 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- ☆27Updated 3 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 months ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆21Updated 6 months ago
- ☆30Updated 6 years ago
- ☆15Updated 8 years ago
- 知乎文章附带代码☆15Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆51Updated 4 years ago
- ☆53Updated 10 months ago
- A read-optimized learned index for unsorted data☆31Updated 2 years ago