hpclab / fast-approximate-filtering
Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardini, Roberto Trani, and Rossano Venturini.
☆14Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for fast-approximate-filtering
- Library for Distributed Retrieval☆15Updated 10 years ago
- Official repository of RankEval: An Evaluation and Analysis Framework for Learning-to-Rank Solutions.☆88Updated 4 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.☆131Updated 5 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 8 years ago
- Efficient and effective query auto-completion in C++.☆51Updated last year
- Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"☆10Updated last year
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆24Updated 6 years ago
- ☆11Updated 7 years ago
- Field-aware Factorization Machines on CUDA☆30Updated 7 years ago
- Experimental search engine in C/C++17 - still in early development.☆26Updated last month
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 6 months ago
- A C++ library providing fast language model queries in compressed space.☆128Updated last year
- My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".☆48Updated last year
- Open-Source Information Retrieval Reproducibility Challenge☆50Updated 8 years ago
- A library of inverted index data structures☆147Updated last year
- A C++ library to benchmark inverted indexes.☆20Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of many similarity join algorithms.☆15Updated 10 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Efficiency/Effectiveness Trade-offs in Learning to Rank☆12Updated 6 years ago
- Implementation of QuadSketch algorithm☆11Updated last year
- A locality-sensitive hashing library☆45Updated 10 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 7 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- Standalone Neural Ranking Model (SNRM)