CGCL-codes / SimoisLinks
Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data distribution. Simois can support the completeness of the join results, and greatly outperforms the existing stream join systems in terms of system throughput and the average processing latency.
☆13Updated 3 years ago
Alternatives and similar repositories for Simois
Users that are interested in Simois are comparing it to the libraries listed below
Sorting:
- A scalable distributed stream join system☆14Updated 2 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
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- ☆16Updated 4 months ago
- A Multicore, NUMA Optimised Data Stream Processing System☆39Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆33Updated 3 years ago
- Simulation code for the LHD cache replacement policy as published in NSDI 2018.☆25Updated 7 years ago
- ☆24Updated last year
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 8 years ago
- ☆15Updated 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
- SC 2021, "LogECMem: Coupling Erasure-Coded In-Memory Key-Value Stores with Parity Logging"☆12Updated 4 years ago
- ☆33Updated last week
- LITS: An Optimized Learned Index for Strings☆10Updated last month
- ACM SoCC 2019, "Coupling Decentralized Key-Value Stores with Erasure Coding"☆15Updated 4 years ago
- ☆16Updated 3 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated 2 years ago
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆14Updated 4 years ago
- ☆11Updated 5 years ago
- Fast Cardinality Estimation of Multi-Join Queries Using Sketches☆16Updated last year
- Passive Disaggregated Persistent Memory at USENIX ATC 2020.☆52Updated 4 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆76Updated 3 years ago
- ☆16Updated last year
- Updatable Learned Index with Precise Positions☆59Updated 3 years ago
- Repository for FAST'23 paper GL-Cache: Group-level Learning for Efficient and High-Performance Caching☆51Updated 2 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆59Updated 4 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 3 years ago
- The design and algorithms used in LeCaR are described in this USENIX HotStorage'18 paper and talk slides: https://www.usenix.org/conferen…☆26Updated 5 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago