Alternatives and similar repositories for losha

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

• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 10 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆158Updated 7 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆141Updated 8 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆214Updated 5 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆56Updated 5 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated 2 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆209Updated 4 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆84Updated 9 months ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 6 months ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• cornelldbgroup / skinnerdb
  SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…
  ☆50Updated last year
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆261Updated 7 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 4 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆26Updated 6 years ago
• microsoft / MSVBASE
  MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…
  ☆97Updated 10 months ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆65Updated 6 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆35Updated 3 months ago
• gbagan / gmark
  ☆43Updated 2 years ago