Alternatives and similar repositories for QBASHER

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

• microsoft / FishStore
  FishStore is a prototype fast ingestion and querying layer for flexible-schema data
  ☆232Updated 2 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆46Updated 4 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 2 months ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• microsoft / ExaStore
  K-V storage engine with low memory cost and low write amplification
  ☆35Updated 2 years ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆239Updated 6 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• wolfgarbe / WordSegmentationTM
  Fast Word Segmentation with Triangular Matrix
  ☆84Updated 4 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 2 weeks ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆22Updated 5 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• microsoft / StorScore
  A test framework to evaluate SSDs and HDDs
  ☆83Updated 2 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
• viyadb / viyadb
  ViyaDB in-memory columnar analytical data store
  ☆115Updated 6 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆39Updated last year
• MicrosoftResearch / NaiadSamples
  Sample implementations using Naiad
  ☆40Updated 10 years ago
• BitFunnel / BitFunnel
  A signature-based search engine
  ☆403Updated 3 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
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆43Updated 9 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆22Updated 4 years ago
• MonetDB / MonetDBLite-C
  MonetDB as a shared library with a C API
  ☆32Updated 3 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago