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
  ☆230Updated 2 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆44Updated 3 years ago
• wolfgarbe / WordSegmentationTM
  Fast Word Segmentation with Triangular Matrix
  ☆82Updated 3 years ago
• microsoft / ExaStore
  K-V storage engine with low memory cost and low write amplification
  ☆34Updated 2 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 2 years ago
• troshko111 / fast-fuzzy-matching
  BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance
  ☆19Updated 8 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.
  ☆42Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• phaistos-networks / Trinity
  Trinity IR Infrastructure
  ☆238Updated 5 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated last month
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆22Updated 4 years ago
• BitFunnel / BitFunnel
  A signature-based search engine
  ☆401Updated 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
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 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…
  ☆39Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• MicrosoftResearch / NaiadSamples
  Sample implementations using Naiad
  ☆40Updated 10 years ago
• LumoSQL / archive1-LumoSQL-on-github
  Initial work on SQLite and LMDB integration
  ☆79Updated 2 years ago
• mikhail-barg / huge-file-processor
  An utility to randomize and split really huge (100+ GB) text files
  ☆21Updated 8 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆78Updated 3 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 9 years ago