microsoft / QBASHER

Related projects ⓘ

Alternatives and complementary repositories for QBASHER

• google / refr
  A framework for building reranking models.
  ☆29Updated 9 years ago
• microsoft / SynthaCorpus
  Tools for generating synthetic document corpora
  ☆13Updated last year
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆26Updated last month
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• MicrosoftResearch / NaiadSamples
  Sample implementations using Naiad
  ☆38Updated 9 years ago
• microsoft / mwt-ds-explore-cpp
  Exploration Library in C++
  ☆15Updated last year
• microsoft / ExaStore
  K-V storage engine with low memory cost and low write amplification
  ☆34Updated last year
• 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
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 8 years ago
• jnorthrup / patl
  Roman Klyujkov's Practical Algorithm Template library
  ☆23Updated 2 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 9 months ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 9 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• microsoft / mwt-ds-explore-java
  Exploration Library in Java
  ☆12Updated last year
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆38Updated 9 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆51Updated last year
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆75Updated 2 years ago
• lintool / IR-Reproducibility
  Open-Source Information Retrieval Reproducibility Challenge
  ☆50Updated 8 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆42Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• troshko111 / fast-fuzzy-matching
  BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance
  ☆19Updated 7 years ago