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:
- ☆12Updated 9 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
- ☆16Updated 4 months ago
- ☆25Updated 3 weeks ago
- ☆18Updated 4 months 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 relational Multi-Party Computation framework for analytics in untrusted clouds☆30Updated 11 months ago
- A SSD-based graph processing engine for billion-node graphs☆11Updated 10 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
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆12Updated 3 years ago
- Updatable Learned Index with Precise Positions☆59Updated 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
- This project aims at building a scalable transactional stream processing engine on modern hardware. It allows ACID transactions to be run…☆142Updated 3 months ago
- ☆48Updated 2 months ago
- A scalable distributed stream join system☆14Updated 2 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 3 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
- LITS: An Optimized Learned Index for Strings☆10Updated last month
- 📚 Awesome papers and technical blogs on vector DB (database), semantic-based vector search or approximate nearest neighbor search (ANN S…☆99Updated 2 months ago
- ☆20Updated last year
- ☆45Updated 2 years ago
- ☆11Updated last year
- A Benchmark for Learned Indexes☆287Updated 3 years ago
- ☆16Updated 4 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆52Updated 2 years ago
- ☆17Updated 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
- The source code for PM-LSH (PVLDB 2020)☆11Updated 8 months ago
- ☆69Updated 11 months ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆148Updated 6 years ago