rossanoventurini / Variable-BMWLinks
☆12Updated 7 years ago
Alternatives and similar repositories for Variable-BMW
Users that are interested in Variable-BMW are comparing it to the libraries listed below
Sorting:
- Common Index File Format to to support interoperability between open-source IR engines☆33Updated 8 months ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆10Updated 3 weeks ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆61Updated 8 months ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆66Updated last week
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆20Updated 2 weeks ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- A Python interface to PISA☆35Updated 3 weeks ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆34Updated 3 months ago
- simd enabled column imprints☆11Updated 7 years ago
- 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
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 8 months ago
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated last year
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆27Updated 2 weeks ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Anytime Ranking for Impact-Ordered Indexes☆13Updated 8 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 8 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A Rust implementation of the Quad Wavelet Tree☆41Updated 3 weeks ago
- Python bindings for the fast integer compression library FastPFor.☆58Updated last year
- A C++ library to benchmark inverted indexes.☆20Updated 4 years ago
- Efficient and effective query auto-completion in C++.☆54Updated last year