VincentShenbw / similarityjoin

Related projects: ⓘ

• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆56Updated 4 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆24Updated 5 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆11Updated 8 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• ipsarros / DolphinnPy
  High-dimensional approximate nearest neighbor in python
  ☆11Updated 6 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆19Updated 9 months ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 6 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆19Updated 4 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• stakok / lmspn
  Language Modeling with Sum-Product Networks
  ☆20Updated 10 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 8 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 2 years ago
• angeloskath / supervised-lda
  A flexible variational inference LDA library.
  ☆22Updated 5 years ago
• HazyResearch / dimmwitted
  ☆10Updated 8 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 6 years ago
• ot / entity2vec
  Semantic embeddings of entities
  ☆68Updated 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 9 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆51Updated 11 months ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆24Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆57Updated 2 years ago
• microsoft / QBASHER
  Inverted file indexing and retrieval optimized for short texts. Supports auto-suggest and query segment classification.
  ☆33Updated last year
• salviati / slash
  A locality-sensitive hashing library
  ☆45Updated 10 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago