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☆38Updated 9 months ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 9 months ago
- simd enabled column imprints☆11Updated 7 years ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆74Updated last week
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 4 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Updated 2 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Python bindings for the fast integer compression library FastPFor.☆60Updated last year
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- A Python interface to PISA☆36Updated 3 weeks ago
- A library of inverted index data structures☆150Updated 2 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 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
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆31Updated last week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- ☆38Updated 5 years ago
- Quick ADC☆26Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 3 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated 3 weeks ago
- A C++ library providing fast language model queries in compressed space.☆131Updated 2 years ago