jermp / 2i_benchLinks
A C++ library to benchmark inverted indexes.
☆21Updated 5 years ago
Alternatives and similar repositories for 2i_bench
Users that are interested in 2i_bench are comparing it to the libraries listed below
Sorting:
- Efficient and effective query auto-completion in C++.☆57Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 10 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- ☆39Updated 5 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated 2 years ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Updated 6 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 7 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆59Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)☆10Updated 5 years ago
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆27Updated 7 years ago
- ☆20Updated 3 years ago
- similarity join and search algorithms for edit distance and jaccard☆19Updated 7 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21Updated 4 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 9 months ago
- ☆13Updated 8 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- ☆16Updated 4 years ago