Alternatives and similar repositories for losha:

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

• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆137Updated 8 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• lqhl / PowerWalk
  Personalized PageRank (PPR) on GraphLab PowerGraph
  ☆15Updated 8 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆83Updated 3 months ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆47Updated last year
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• fdbresearch / LMFAO
  Layered Multiple Functional Aggregate Optimization
  ☆18Updated 4 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆52Updated 4 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• mitdbg / AdaptDB
  ☆16Updated 8 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• bindscha / chaos
  Chaos: Scale-out Graph Processing from Secondary Storage
  ☆50Updated 9 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• cornelldbgroup / skinnerdb
  SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…
  ☆48Updated last year
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 5 years ago
• thu-pacman / GridGraph
  Out-of-core graph processing on a single machine.
  ☆129Updated 6 years ago
• TsinghuaDatabaseGroup / Dima
  simialrity join or search on spark core directly
  ☆27Updated 4 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆93Updated 5 years ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆31Updated this week
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago