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
• 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 10 years ago
• 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
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• graphflow / graphflow-columnar-techniques
  ☆26Updated 3 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
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated last year
• 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
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated last month
• sfu-db / BOExplain
  Explaining Inference Queries with Bayesian Optimization
  ☆10Updated 4 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆61Updated 6 years ago
• daqcri / deeper-lite
  deep entity resolution lite version
  ☆11Updated 5 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆54Updated 4 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• ldbc / ldbc_snb_bi
  Reference implementations for the LDBC Social Network Benchmark's Business Intelligence (BI) workload
  ☆43Updated 2 months ago
• MorphStore / Engine
  ☆14Updated last year
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 10 years ago
• cornelldbgroup / skinnerdb
  SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…
  ☆49Updated last year
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆257Updated 6 years ago
• lijinf2 / gqr
  ☆16Updated 5 years ago
• fdbresearch / LMFAO
  Layered Multiple Functional Aggregate Optimization
  ☆18Updated 4 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 2 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆83Updated 6 months ago
• HazyResearch / dimmwitted
  ☆10Updated 9 years ago
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆29Updated 3 years ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆24Updated last year