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 4 years ago
Alternatives and similar repositories for LDCF
Users that are interested in LDCF are comparing it to the libraries listed below
Sorting:
- 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
- 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 4 years ago
- A scalable distributed stream join system☆14Updated 2 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…☆21Updated 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
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆16Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆32Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆50Updated 2 years ago
- Range Optimized Adaptive Radix Tree☆23Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆47Updated 2 years ago
- An open-source FPTree implementation☆27Updated 3 years ago
- ☆9Updated 2 years ago
- Updatable Learned Index with Precise Positions☆57Updated 3 years ago
- Nap - NUMA-Aware Persistent Indexes☆41Updated 3 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆44Updated 2 years ago
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆17Updated last year
- A Distribution-driven Learned Index☆15Updated 2 years ago
- ☆28Updated 3 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
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago
- LB+-Tree implementation☆47Updated 4 years ago
- ☆17Updated 2 years ago
- ☆18Updated last year
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year
- Key-value store with new indexing☆37Updated 5 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆20Updated 2 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago