and-gue / NeaTSLinks
☆12Updated 6 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 (and emulated) runtime environments☆34Updated this week
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21Updated 4 years ago
- A Benchmark for Learned Indexes☆300Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 11 months ago
- Official code of "PLEX: Towards Practical Learned Indexing", aka TrieSpline (AIDB @VLDB'21)☆15Updated 3 years ago
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆22Updated 2 years ago
- The source code for PM-LSH (PVLDB 2020)☆13Updated last year
- A Database System for Research and Fast Prototyping☆113Updated 2 months ago
- Updatable Learned Index with Precise Positions☆62Updated 4 years ago
- Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…☆26Updated 2 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆19Updated 3 years ago
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated 2 years ago
- ☆12Updated last year
- A Multicore, NUMA Optimised Data Stream Processing System☆40Updated 3 years ago
- Graphs analytics on collections of views!☆37Updated 2 years ago
- ☆43Updated 4 years ago
- ☆18Updated 2 years ago
- The recursive model index, a learned index structure☆229Updated 3 months ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- ☆21Updated last year
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆27Updated last year
- Implementation of DeepDB: Learn from Data, not from Queries!☆103Updated 3 years ago
- A new cardinality estimation scheme for join query estimation☆42Updated last year
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆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
- ☆16Updated 10 months ago
- A benchmark for serverless analytic databases.☆25Updated 2 weeks ago
- ☆11Updated 3 years ago
- Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)☆127Updated 6 years ago