jermp / 2i_benchLinks
A C++ library to benchmark inverted indexes.
☆20Updated 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:
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- Efficient and effective query auto-completion in C++.☆55Updated last year
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 5 months ago
- ☆38Updated 5 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 3 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆19Updated 3 years ago
- A read-optimized learned index for unsorted data☆31Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 3 weeks ago
- simd enabled column imprints☆11Updated 7 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated last year
- BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)☆10Updated 5 years ago
- Layered Multiple Functional Aggregate Optimization☆18Updated 4 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆34Updated last month
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆56Updated 5 years ago