microsoft / QBASHERLinks
Inverted file indexing and retrieval optimized for short texts. Supports auto-suggest and query segment classification.
☆34Updated 2 years ago
Alternatives and similar repositories for QBASHER
Users that are interested in QBASHER are comparing it to the libraries listed below
Sorting:
- A framework for building reranking models.☆28Updated 10 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Tools for generating synthetic document corpora☆13Updated 2 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 8 months ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆74Updated 3 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Deterministic Acyclic Finite State Automaton implementation for morphological analysis☆18Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆117Updated last year
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Sample implementation of a proposed C++ hashing framework☆29Updated 9 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- 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
- EliasFanoCompression: quasi-succinct compression of sorted integers in C#☆45Updated 3 years ago
- Fast decoder for VByte-compressed integers☆123Updated last year
- Sample implementations using Naiad☆39Updated 10 years ago
- Open-Source Information Retrieval Reproducibility Challenge☆50Updated 9 years ago
- A flexible tree-based index structure to support edit distance search on strings☆11Updated 7 years ago
- The Scalable Hyperlink Store☆15Updated 11 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆24Updated 8 years ago
- A high performance search engine☆106Updated 8 years ago