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:
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- ☆16Updated 4 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
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- ☆150Updated 2 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- ☆39Updated 5 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
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 7 years ago
- ☆30Updated 6 years ago
- High Performance Learned Index on Persistent Memory☆49Updated 2 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- ☆27Updated 3 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- Fast Cardinality Estimation of Multi-Join Queries Using Sketches☆16Updated last year
- ☆16Updated last year
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 8 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆23Updated 9 months ago
- Updatable Learned Index with Precise Positions☆62Updated 4 years ago
- ☆57Updated last year
- 知乎文章附带代码☆15Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆20Updated last year
- ☆125Updated 3 years ago
- ☆60Updated 2 years ago
- ☆99Updated 5 years ago
- The recursive model index, a learned index structure☆229Updated 3 months ago