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
- A scalable distributed stream join system☆14Updated last year
- 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
- 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 6 years ago
- ☆15Updated 3 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆28Updated 2 years ago
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- This is a source code for LSH-APG (PVLDB 2023)☆24Updated 2 months ago
- A persistent learned index for non-volatile memory with high read/write performance.☆15Updated 2 years ago
- A Distribution-driven Learned Index☆12Updated last year
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆11Updated 2 years ago
- ☆10Updated 5 months ago
- ☆41Updated 2 months ago
- ☆14Updated 2 weeks ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆42Updated last year
- High Performance Learned Index on Persistent Memory☆46Updated last year
- A Learned Index for Log-Structured Merge Trees☆47Updated last year
- ☆10Updated 2 weeks ago
- ☆17Updated last year
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆18Updated last week
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆16Updated last year
- This is for SIGMOD submission "Learning-based Progressive Cardinality Estimation for End-to-end Query Execution"☆17Updated last year
- A relational Multi-Party Computation framework for analytics in untrusted clouds☆23Updated 2 months ago
- ☆16Updated 2 years ago
- ☆15Updated 7 years ago
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆17Updated 8 months ago
- Range Optimized Adaptive Radix Tree☆22Updated last year
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year