CGCL-codes / HoraeLinks
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…
☆21Updated 3 years ago
Alternatives and similar repositories for Horae
Users that are interested in Horae are comparing it to the libraries listed below
Sorting:
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 6 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
- 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
- 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 4 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
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- Updatable Learned Index with Precise Positions☆59Updated 3 years ago
- A Distribution-driven Learned Index☆15Updated 2 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆52Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆32Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆21Updated last year
- ☆16Updated 3 months ago
- High Performance Learned Index on Persistent Memory☆47Updated 2 years ago
- A Learned Index for Log-Structured Merge Trees☆45Updated last year
- ☆39Updated 4 years ago
- ☆44Updated 2 years ago
- ☆22Updated 2 years ago
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆18Updated last year
- This is the source code of the method proposed in paper: Subspace Collision: An Efficient and Accurate Framework for High-dimensional App…☆22Updated 4 months ago
- [SIGMOD’24] Source code for the paper: Making In-Memory Learned Indexes Efficient on Disk☆10Updated last year
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆11Updated 3 years ago
- A persistent learned index for non-volatile memory with high read/write performance.☆17Updated 3 years ago
- ☆17Updated last year
- ☆20Updated last year
- ☆25Updated 3 months ago
- This is for SIGMOD submission "Learning-based Progressive Cardinality Estimation for End-to-end Query Execution"☆18Updated 2 years ago
- ☆11Updated last year