CGCL-codes / LDCFLinks
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 4 years ago
Alternatives and similar repositories for LDCF
Users that are interested in LDCF are comparing it to the libraries listed below
Sorting:
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆33Updated 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 3 years ago
- ☆18Updated 2 years ago
- Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary…☆21Updated 3 years ago
- A scalable distributed stream join system☆14Updated 2 years ago
- A relational Multi-Party Computation framework for analytics in untrusted clouds☆30Updated 11 months ago
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Updated 4 years ago
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Updated 4 years ago
- An open-source FPTree implementation☆27Updated 3 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
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆21Updated 3 years ago
- Updatable Learned Index with Precise Positions☆59Updated 3 years ago
- FusionFS: Fusing I/O Operations using CISCOps in Firmware File Systems, FAST '22☆19Updated 3 years ago
- Optimizing data-intensive systems in disaggregated data centers☆13Updated 3 years ago
- ☆18Updated 2 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆44Updated 2 years ago
- dLSM: An LSM-Based Index for RDMA-Enabled Memory Disaggregation☆34Updated last year
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆36Updated last month
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆76Updated 3 years ago
- A Learned Index for Log-Structured Merge Trees☆45Updated last year
- High Performance Learned Index on Persistent Memory☆48Updated 2 years ago
- This is the implementation repository of our OSDI'23 paper: SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory.☆62Updated 9 months ago
- Nap - NUMA-Aware Persistent Indexes☆41Updated 4 years ago
- ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems☆78Updated 2 years ago
- A Distribution-driven Learned Index☆15Updated 2 years ago
- A persistent learned index for non-volatile memory with high read/write performance.☆18Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆118Updated 4 years ago
- Blaze: Fast Graph Processing on Fast SSDs (SC'22)☆10Updated 2 years ago