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:
- ☆16Updated 10 months ago
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Updated 3 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆21Updated 4 years ago
- This project aims at building a scalable transactional stream processing engine on modern hardware. It allows ACID transactions to be run…☆140Updated 9 months ago
- ☆13Updated last year
- A scalable distributed stream join system☆14Updated 3 years ago
- ☆25Updated 6 months ago
- 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
- A Multicore, NUMA Optimised Data Stream Processing System☆40Updated 3 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 5 years ago
- 📚 Awesome papers and technical blogs on vector DB (database), semantic-based vector search or approximate nearest neighbor search (ANN S…☆109Updated 2 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆27Updated last year
- 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
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 8 years ago
- simialrity join or search on spark core directly☆28Updated 5 years ago
- ☆79Updated last year
- 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
- Updatable Learned Index with Precise Positions☆62Updated 4 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆176Updated 8 months ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago
- M2Bench: A Database Benchmark for Multi-Model Analytic Workloads☆22Updated 2 months ago
- A computation-centric distributed graph processing system.☆331Updated 4 years ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆150Updated 7 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 9 months ago
- A lightweight library for the RaBitQ algorithm and its applications in vector search.☆123Updated last week
- A SSD-based graph processing engine for billion-node graphs☆12Updated 11 years ago
- ☆16Updated 4 years ago
- A Benchmark for Learned Indexes☆300Updated 3 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆13Updated 3 years ago