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
- A scalable distributed stream join system☆14Updated last year
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 6 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
- 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
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆28Updated 2 years ago
- Range Optimized Adaptive Radix Tree☆22Updated last year
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆42Updated last year
- An open-source FPTree implementation☆26Updated 2 years ago
- ☆28Updated 3 years ago
- A persistent learned index for non-volatile memory with high read/write performance.☆15Updated 2 years ago
- 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
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆20Updated last year
- ☆15Updated 3 years ago
- ☆17Updated last year
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆16Updated last year
- ☆47Updated 4 years ago
- Nap - NUMA-Aware Persistent Indexes☆41Updated 3 years ago
- FusionFS: Fusing I/O Operations using CISCOps in Firmware File Systems, FAST '22☆19Updated 2 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- A fast approximate membership query data structure☆10Updated 3 months ago
- This is the source code for our (Tobias Ziegler, Jacob Nelson-Slivon, Carsten Binnig and Viktor Leis) published paper at SIGMOD’23: Desig…☆21Updated last month
- A Distribution-driven Learned Index☆12Updated last year
- ☆35Updated last year
- ☆15Updated last year
- An RDMA skew-aware key-value store, which implements the Scale-Out ccNUMA design, to exploit skew in order to increase performance of dat…☆17Updated 3 years ago