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:
- 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
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 6 years 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
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Updated 4 years ago
- Linked Stream Benchmark☆12Updated 2 years ago
- A relational Multi-Party Computation framework for analytics in untrusted clouds☆35Updated last year
- ☆13Updated last year
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆13Updated 3 years ago
- A Benchmark for Learned Indexes☆300Updated 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 4 years ago
- A scalable distributed stream join system☆14Updated 3 years ago
- ☆16Updated 10 months ago
- Apache GeaFlow: A Streaming Graph Computing Engine.☆763Updated last week
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆32Updated 2 months ago
- ☆25Updated 6 months 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
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆150Updated 7 years ago
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆17Updated 5 years ago
- ☆16Updated 4 years ago
- ☆34Updated last year
- A lightweight library for the RaBitQ algorithm and its applications in vector search.☆123Updated this week
- 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
- Updatable Learned Index with Precise Positions☆62Updated 4 years ago
- ☆20Updated last year
- MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…☆102Updated 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
- ☆14Updated last year
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆176Updated 8 months ago
- ☆19Updated 10 months ago