Alternatives and similar repositories for Similarity-Search-and-Join

Users that are interested in Similarity-Search-and-Join are comparing it to the libraries listed below

• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆26Updated 6 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆158Updated 7 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 10 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 2 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆10Updated 5 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• jcarreira / cirrus-kv
  High-performance key-value store
  ☆12Updated 6 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆21Updated 5 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆13Updated 4 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 8 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• SeSaMe-NUS / genie
  ☆81Updated 7 years ago
• olivierjeunen / dynamicindex
  C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…
  ☆16Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated 2 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆216Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated 2 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 2 months ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago