rossanoventurini / Variable-BMW

Related projects ⓘ

Alternatives and complementary repositories for Variable-BMW

• 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
  ☆31Updated last month
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• andrewtrotman / JASSv2
  Experimental search engine in C/C++17 - still in early development.
  ☆26Updated last month
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆16Updated 2 weeks ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 8 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…
  ☆43Updated 3 weeks ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 6 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 7 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• CosimoRulli / emvb
  Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024
  ☆55Updated last month
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• amallia / gpu-integers-compression
  GPU-Accelerated Faster Decoding of Integer Lists
  ☆13Updated 5 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 11 months ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆57Updated last year