and-gue / NeaTSLinks
☆11Updated 2 months ago
Alternatives and similar repositories for NeaTS
Users that are interested in NeaTS are comparing it to the libraries listed below
Sorting:
- An Edge-CLoud pYthon Platform for Simulated runtime Environments☆30Updated last week
- ☆25Updated 4 years ago
- Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…☆25Updated last year
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆19Updated 4 years ago
- A Benchmark for Learned Indexes☆290Updated 3 years ago
- ☆71Updated 2 years ago
- Updatable Learned Index with Precise Positions☆60Updated 3 years ago
- Cardinality Estimation Benchmark☆83Updated 2 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆12Updated 9 months ago
- A new cardinality estimation scheme for join query estimation☆41Updated 9 months ago
- Neural Relation Understanding: neural cardinality estimators for tabular data☆105Updated 4 years ago
- PostBOUND is a framework for studying query optimization algorithms for (relational) database systems.☆15Updated this week
- GBBS: Graph Based Benchmark Suite☆212Updated last month
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- ☆17Updated 2 years ago
- A new CardEst Benchmark to Bridge AI and DBMS☆131Updated 2 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆17Updated 3 years ago
- SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…☆50Updated last year
- Implementation of DeepDB: Learn from Data, not from Queries!☆103Updated 2 years ago
- ☆22Updated 2 years ago
- ☆24Updated 3 months ago
- Official code of "PLEX: Towards Practical Learned Indexing" (aka TrieSpline)☆14Updated 3 years ago
- A Database System for Research and Fast Prototyping☆106Updated last month
- Source code for QuickSel (SIGMOD 2020)☆19Updated 2 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆24Updated 10 months ago
- This is for SIGMOD submission "Learning-based Progressive Cardinality Estimation for End-to-end Query Execution"☆20Updated 2 years ago
- Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)☆124Updated 6 years ago
- learned cardinalities for databases☆16Updated 2 years ago
- ☆23Updated 5 years ago