CGCL-codes / Horae
Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary and elastic range while guaranteeing one-sided and controllable errors. More to the point, Horae provides a worst query time of O(log L), where L is the length of query range. Hoare leverages multi-layer stora…
☆18Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for Horae
- 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 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 3 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
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆14Updated 3 years ago
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆14Updated 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
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- ☆10Updated 5 months ago
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- ☆15Updated 2 months ago
- A SSD-based graph processing engine for billion-node graphs☆10Updated 9 years ago
- A Distribution-driven Learned Index☆12Updated last year
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year
- ☆19Updated 2 years ago
- NFL: Robust Learned Index via Distribution Transformation☆20Updated last year
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆28Updated 2 years ago
- ☆15Updated 3 years ago
- ☆24Updated 8 months ago
- ☆9Updated 9 months ago
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 2 years ago
- ☆10Updated 3 weeks ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆23Updated 2 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- A persistent learned index for non-volatile memory with high read/write performance.☆15Updated 2 years ago
- ☆15Updated 6 years ago
- ☆12Updated 2 months ago