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:
- ☆16Updated 4 years ago
- ☆57Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 8 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- ☆30Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆49Updated 2 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- The recursive model index, a learned index structure☆229Updated 3 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 6 months ago
- ☆150Updated 2 years ago
- An open-source FPTree implementation☆27Updated 3 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- A Benchmark for Learned Indexes☆300Updated 3 years ago
- ☆125Updated 3 years ago
- 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
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Updatable Learned Index with Precise Positions☆63Updated 4 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆23Updated 9 months ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 7 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆78Updated 3 years ago
- ☆27Updated 3 years ago
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆20Updated last year
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 5 years ago
- LB+-Tree implementation☆49Updated 4 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago