Alternatives and similar repositories for NeaTS

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

• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 7 months 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?"
  ☆19Updated 4 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆24Updated 11 months ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆12Updated 10 months 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
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year
• BU-DiSC / pvldb-pdfa-resources
  ☆17Updated 2 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• karimaechihabi / lernaean-hydra
  This is the Lernaean Hydra Archive (LHA) for Similarity Search.
  ☆22Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago
• stoianmihail / PLEX
  Official code of "PLEX: Towards Practical Learned Indexing" (aka TrieSpline)
  ☆14Updated 3 years ago
• EU-TEACHING / teaching
  ☆39Updated last year
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆290Updated 3 years ago
• IDEBench / IDEBench-public
  ☆23Updated 5 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆17Updated 3 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 5 months ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• Jiacheng-WU / lipp
  Updatable Learned Index with Precise Positions
  ☆60Updated 3 years ago
• wuziniu / FactorJoin
  A new cardinality estimation scheme for join query estimation
  ☆41Updated 10 months ago
• Xtra-Computing / briskstream
  A Multicore, NUMA Optimised Data Stream Processing System
  ☆39Updated 2 years ago
• naru-project / naru
  Neural Relation Understanding: neural cardinality estimators for tabular data
  ☆104Updated 4 years ago
• DataManagementLab / deepdb-public
  Implementation of DeepDB: Learn from Data, not from Queries!
  ☆103Updated 2 years ago
• intellistream / AllianceDB
  ☆16Updated 6 months ago
• RapidsAtHKUST / RapidMatch
  Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…
  ☆33Updated 3 years ago
• JonyYu / ATimeSeriesDataset
  ☆11Updated 5 years ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆108Updated last month
• wuziniu / FSPN
  Factorize Sum Product Network
  ☆31Updated 2 years ago
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆38Updated last year