Alternatives and similar repositories for Variable-BMW

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

• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• 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
  ☆37Updated 9 months ago
• pisa-engine / ciff
  The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative
  ☆10Updated last month
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆28Updated last month
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆27Updated 8 months ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• 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
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆59Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• terrierteam / pyterrier_pisa
  A Python interface to PISA
  ☆36Updated last week
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated last month
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 8 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 4 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆13Updated 8 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆9Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆45Updated last week
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• thomasahle / tinyknn
  A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF
  ☆17Updated 2 years ago
• nlescoua / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆16Updated 5 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 3 months ago