Alternatives and similar repositories for QBASHER:

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

• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 6 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆26Updated 5 months ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 9 years ago
• microsoft / SynthaCorpus
  Tools for generating synthetic document corpora
  ☆13Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• microsoft / FastRDFStore
  The MSR FastRDFStore Package is designed for creating an in-memory index of RDF triples, implemented as a WCF service in C#, and consists…
  ☆38Updated last year
• kzn / fsa
  Deterministic Acyclic Finite State Automaton implementation for morphological analysis
  ☆18Updated 4 years ago
• microsoft / ExaStore
  K-V storage engine with low memory cost and low write amplification
  ☆34Updated last year
• troshko111 / fast-fuzzy-matching
  BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance
  ☆19Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago
• MicrosoftResearch / SHS
  The Scalable Hyperlink Store
  ☆15Updated 11 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• microsoft / irmetrics-r
  R library for common information retrieval metrics
  ☆13Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆45Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 10 months ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆148Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago
• wolfgarbe / LinSpell
  Fast approximate strings search & spelling correction
  ☆58Updated 3 years ago
• microsoft / msmarco
  website for MS Marco
  ☆28Updated 3 weeks ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆32Updated 6 months 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
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆74Updated 3 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago