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:
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- High Performance Learned Index on Persistent Memory☆48Updated 2 years ago
- ☆149Updated 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
- An open-source FPTree implementation☆27Updated 3 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆118Updated 4 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆33Updated 3 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- 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
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- ☆121Updated 3 years ago
- BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)☆10Updated 5 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 9 months ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- ☆29Updated 2 years ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆148Updated 6 years ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆164Updated 4 years ago
- The recursive model index, a learned index structure☆223Updated 3 years ago
- LB+-Tree implementation☆49Updated 4 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Key-value store with new indexing☆37Updated 5 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆21Updated 2 years ago