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 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for DCF
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 5 years ago
- 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 2 years ago
- 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
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Updated 3 years ago
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆14Updated 2 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆12Updated last year
- ☆15Updated 3 years ago
- ☆15Updated 7 years ago
- ☆37Updated 4 years ago
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- Range Optimized Adaptive Radix Tree☆22Updated last year
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 3 years ago
- Benchmarking framework for index structures on persistent memory☆87Updated last year
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 2 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- ☆24Updated 2 years ago
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago
- ☆27Updated 2 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆23Updated 2 years ago
- LB+-Tree implementation☆47Updated 3 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆28Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- ☆52Updated 6 months ago
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 7 years ago