Alternatives and similar repositories for Variable-BMW

Users that are interested in Variable-BMW are comparing it to the libraries listed below

• 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
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆38Updated 10 months ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…
  ☆78Updated 2 weeks ago
• terrierteam / pyterrier_pisa
  A Python interface to PISA
  ☆36Updated last month
• CosimoRulli / emvb
  Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024
  ☆63Updated 10 months ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated this week
• hpclab / fast-approximate-filtering
  Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…
  ☆14Updated 5 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆31Updated this week
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆34Updated last month
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 5 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆162Updated 4 years ago
• amallia / gpu-integers-compression
  GPU-Accelerated Faster Decoding of Integer Lists
  ☆13Updated 5 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 5 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆25Updated 6 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆9Updated 5 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 5 months ago
• cwida / PDX
  ⚡ Faster similarity search with PDX: A vertical data layout for vectors
  ☆50Updated last week
• leifos / simiir
  A toolkit for simulating interactive information retrieval
  ☆21Updated 6 years ago
• hamed-zamani / snrm
  Standalone Neural Ranking Model (SNRM)
  ☆76Updated 6 years ago
• JMMackenzie / CC-News-Tools
  Tools relating to the CC-News-En Collection
  ☆20Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago