Alternatives and similar repositories for kd_GeRaF

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

• Sable / HorsePower
  Optimizing database queries with array programming
  ☆18Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆68Updated 8 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 4 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 10 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 4 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆63Updated 8 years ago
• Mytherin / RembranDB
  Sample database with LLVM execution engine.
  ☆11Updated 8 years ago
• ictlyh / SourceCodeAnalysis
  Source code analysis of Impala, PostgreSQL, Citus and Postgres-XL
  ☆13Updated 8 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆62Updated 4 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆9Updated 5 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆137Updated 8 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago