Alternatives and similar repositories for QBASHER

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

• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• microsoft / FishStore
  FishStore is a prototype fast ingestion and querying layer for flexible-schema data
  ☆227Updated last year
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆45Updated 3 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated this week
• wolfgarbe / WordSegmentationTM
  Fast Word Segmentation with Triangular Matrix
  ☆81Updated 3 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆16Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆238Updated 5 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆38Updated 10 months ago
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆75Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• cliqz-oss / keyvi
  Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…
  ☆177Updated 6 years ago
• troshko111 / fast-fuzzy-matching
  BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance
  ☆19Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• microsoft / ExaStore
  K-V storage engine with low memory cost and low write amplification
  ☆34Updated 2 years ago
• searchhub / preDict
  Lightning fast spell correction / fuzzy search library based on SymSpell by Commerce-Experts
  ☆81Updated 7 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• MicrosoftResearch / NaiadSamples
  Sample implementations using Naiad
  ☆39Updated 10 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 11 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago