CGCL-codes / LDCF
LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree structure and reduces the worst insertion and membership testing times from O(N) to O(1).
☆14Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for LDCF
- 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
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 5 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
- 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
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆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
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 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
- Range Optimized Adaptive Radix Tree☆22Updated last year
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆28Updated 2 years ago
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- ☆10Updated 5 months ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- A Distribution-driven Learned Index☆12Updated last year
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆42Updated last year
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year
- 2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…☆24Updated 5 years ago
- LB+-Tree implementation☆47Updated 3 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 3 years ago
- Nap - NUMA-Aware Persistent Indexes☆41Updated 3 years ago
- A persistent learned index for non-volatile memory with high read/write performance.☆15Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆87Updated last year
- ☆28Updated 3 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 2 years ago
- This is the implementation repository of our FAST'23 paper: FUSEE: A Fully Memory-Disaggregated Key-Value Store.☆53Updated last year
- NFL: Robust Learned Index via Distribution Transformation☆20Updated last year
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆73Updated 2 years ago
- ☆25Updated 2 years ago