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 8 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.☆14Updated 2 years ago
- ☆16Updated 4 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
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆49Updated 2 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- ☆150Updated 2 years ago
- ☆27Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- ☆30Updated 3 years ago
- ☆125Updated 3 years ago
- An open-source FPTree implementation☆27Updated 3 years ago
- Key Value Store based on LevelDB☆117Updated 4 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆167Updated 4 years ago
- ☆60Updated 2 years ago
- Simple baselines for "Learned Indexes"☆159Updated 8 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- ☆53Updated last year
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 8 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- ☆19Updated 9 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆78Updated 3 years ago
- ☆30Updated 6 years ago