Alternatives and similar repositories for NeaTS

Users that are interested in NeaTS are comparing it to the libraries listed below

• eclypse-org / eclypse
  An Edge-CLoud pYthon Platform for Simulated runtime Environments
  ☆31Updated this week
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 8 months ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• EU-TEACHING / teaching
  ☆39Updated 2 years ago
• epfl-dias / proteus
  Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…
  ☆25Updated 2 years ago
• stoianmihail / PLEX
  Official code of "PLEX: Towards Practical Learned Indexing" (aka TrieSpline)
  ☆15Updated 3 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆291Updated 3 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• gvinciguerra / Learned-indexes-effectiveness
  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
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆62Updated 3 years ago
• BU-DiSC / pvldb-pdfa-resources
  ☆17Updated 2 years ago
• wuziniu / FactorJoin
  A new cardinality estimation scheme for join query estimation
  ☆43Updated 10 months ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆214Updated 2 months ago
• DominikHorn / hashing-benchmark
  benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
  ☆16Updated 2 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆25Updated 11 months ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 10 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• DIR-LAB / VCSR
  Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].
  ☆12Updated 3 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 7 years ago
• DataManagementLab / deepdb-public
  Implementation of DeepDB: Learn from Data, not from Queries!
  ☆103Updated 2 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆33Updated 6 months ago
• wuziniu / FSPN
  Factorize Sum Product Network
  ☆31Updated 2 years ago
• Xtra-Computing / briskstream
  A Multicore, NUMA Optimised Data Stream Processing System
  ☆39Updated 2 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆18Updated 3 years ago
• learnedsystems / CEB
  Cardinality Estimation Benchmark
  ☆83Updated 2 years ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆13Updated 11 months ago