☆14Feb 15, 2024Updated 2 years ago
Alternatives and similar repositories for endure
Users that are interested in endure are comparing it to the libraries listed below
Sorting:
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- ☆16Jul 24, 2023Updated 2 years ago
- learned cardinalities for databases☆16Apr 12, 2023Updated 2 years ago
- ☆39Jul 6, 2023Updated 2 years ago
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- lsm-tree with buffered merge☆12Jan 10, 2022Updated 4 years ago
- A Learned Index for Log-Structured Merge Trees☆47Sep 6, 2023Updated 2 years ago
- ☆21Mar 2, 2022Updated 4 years ago
- Code used for the Arvix report: The Case for Automatic Database Administration using Deep Reinforcement Learning☆25May 13, 2020Updated 5 years ago
- Factorize Sum Product Network☆30Nov 16, 2022Updated 3 years ago
- [MSST '24] Prophet: Optimizing LSM-Based Key-Value Store on ZNS SSDs with File Lifetime Prediction and Compaction Compensation.☆15Apr 20, 2024Updated last year
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- ☆23Jul 25, 2023Updated 2 years ago
- Scala framework for iterative and interactive cluster computing.☆13Sep 23, 2013Updated 12 years ago
- TLA+ specification of Fast Flexible Paxos☆17Oct 9, 2020Updated 5 years ago
- dragonboat multi group raft product ready example by pebbledb☆20Oct 30, 2023Updated 2 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆13Mar 31, 2022Updated 3 years ago
- The Ruby DataMining Gem, is a little collection of several Data-Mining-Algorithms☆15Jul 24, 2015Updated 10 years ago
- ☆10Aug 25, 2025Updated 6 months ago
- LLM for Index Recommendation☆17Updated this week
- CMDBAC - Carnegie Mellon Database Application Catalog☆36Oct 6, 2021Updated 4 years ago
- Blog of finesse☆13Jun 21, 2016Updated 9 years ago
- High Dimensional Approximate Nearest Neighbor☆11Sep 3, 2017Updated 8 years ago
- Code and data for the Clustering Uncertain Graphs paper☆10Nov 22, 2022Updated 3 years ago
- ☆14Jul 6, 2018Updated 7 years ago
- Prototype implementation and extended paper of SDPaxos☆16Nov 30, 2018Updated 7 years ago
- A Benchmark for Learned Indexes☆302Apr 27, 2022Updated 3 years ago
- ☆15Oct 22, 2021Updated 4 years ago
- ☆25Oct 31, 2020Updated 5 years ago
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Oct 31, 2023Updated 2 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆13Nov 21, 2021Updated 4 years ago
- ☆21Sep 20, 2023Updated 2 years ago
- Low level algorithms for persistent memory.☆16Feb 9, 2021Updated 5 years ago
- ☆16Aug 11, 2021Updated 4 years ago
- [SIGMOD’24] Source code for the paper: Making In-Memory Learned Indexes Efficient on Disk☆13Jun 28, 2024Updated last year
- Data-Centric What-If Analysis for Native Machine Learning Pipelines☆16Jun 14, 2023Updated 2 years ago
- Automatically exported from code.google.com/p/provable-data-possession☆14Oct 19, 2015Updated 10 years ago
- A Fast and Cost-Efficient Hashing Index Scheme for Cloud Storage Systems☆19Jul 9, 2017Updated 8 years ago
- Open source code of FAST' 24 paper, COLE: A Column-based Learned Storage for Blockchain Systems☆13Oct 23, 2024Updated last year