Alternatives and similar repositories for sigir16-topkcomplete

Users that are interested in sigir16-topkcomplete are comparing it to the libraries listed below

• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 8 months ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆148Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 2 years ago
• hpclab / fast-approximate-filtering
  Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…
  ☆14Updated 5 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 3 months ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆54Updated last year
• searchivarius / AccurateLuceneBM25
  Improving the effectiveness Lucene's BM25 (and testing it using Yahoo! Answers and Stack Overflow collections)
  ☆16Updated 3 years ago
• cythnn / cythnn
  ☆16Updated 9 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆93Updated 6 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• markovi / LiDR
  Library for Distributed Retrieval
  ☆15Updated 11 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• rmit-ir / LTR_Cascade
  Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"
  ☆10Updated 2 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆130Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• jnorthrup / patl
  Roman Klyujkov's Practical Algorithm Template library
  ☆23Updated 2 years ago