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:
- ☆17Updated 2 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 8 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆37Updated 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
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Updated 4 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- dLSM: An LSM-Based Index for RDMA-Enabled Memory Disaggregation☆36Updated 2 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆43Updated 3 years ago
- A scalable distributed stream join system☆14Updated 3 years ago
- An open-source FPTree implementation☆27Updated 3 years ago
- A Learned Index for Log-Structured Merge Trees☆47Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆49Updated 2 years ago
- Updatable Learned Index with Precise Positions☆62Updated 4 years ago
- ☆99Updated 5 years ago
- Nap - NUMA-Aware Persistent Indexes☆41Updated 4 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 5 years ago
- A cross-modal vector index with fast construction on heterogeneous CPU-GPU environment. Published on DaMoN@SIGMOD 2025.☆16Updated 6 months ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆78Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆54Updated 3 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Updated 2 years ago
- ☆30Updated 4 years ago
- Interactive Benchmarking of Persistent Memory Indexes☆15Updated 3 years ago
- This project aims at building a scalable transactional stream processing engine on modern hardware. It allows ACID transactions to be run…☆140Updated 9 months ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆59Updated 4 years ago
- Range Optimized Adaptive Radix Tree☆24Updated 3 years ago
- Plush: A Write-Optimized Persistent Log-Structured Hash-Table☆18Updated 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 4 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 9 months ago
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 6 years ago