CGCL-codes / DCF
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 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for DCF
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆14Updated 3 years ago
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Updated 2 years ago
- A scalable distributed stream join system☆14Updated last year
- Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary…☆18Updated 2 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆20Updated 3 years ago
- ☆15Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- A fast approximate membership query data structure☆10Updated 3 months ago
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- ☆15Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- ☆50Updated 5 years ago
- ☆51Updated 5 months ago
- ☆17Updated last year
- Range Optimized Adaptive Radix Tree☆22Updated last year
- NVM Evaluation Testbed☆28Updated 6 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- LB+-Tree implementation☆47Updated 3 years ago
- An implementation of learned index structures for bloom filters.☆23Updated 6 years ago
- ☆24Updated 2 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆15Updated 5 years ago
- An open-source FPTree implementation☆26Updated 2 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆20Updated last year
- ☆28Updated 3 years ago
- ☆37Updated 4 years ago
- A Fast and Cost-Efficient Hashing Index Scheme for Cloud Storage Systems☆18Updated 7 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 5 years ago