ThirdAIResearch / Dessert
DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables
☆12Updated 7 months ago
Related projects: ⓘ
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆14Updated 3 weeks ago
- state-of-the-art search over vector embeddings and structured data (SIGMOD '24)☆44Updated 3 months ago
- Some microbenchmarks and design docs before commencement☆12Updated 3 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆19Updated 9 months ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆53Updated 3 weeks ago
- Algorithms for approximate nearest neighbor search with window filters☆23Updated 7 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆27Updated 3 months ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆15Updated 4 years ago
- WIP. Veloce is a low-code Ray-based parallelization library that makes machine learning computation novel, efficient, and heterogeneous.☆18Updated 2 years ago
- ☆115Updated 3 weeks ago
- Lightning In-Memory Object Store☆44Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated last year
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆16Updated last year
- Approximate nearest neighbor search in Python.☆34Updated 11 months ago
- ☆26Updated 2 weeks ago
- simd enabled column imprints☆11Updated 6 years ago
- A C++ library to benchmark inverted indexes.☆19Updated 4 years ago
- Code repository for the paper - "AdANNS: A Framework for Adaptive Semantic Search"☆57Updated 11 months ago
- MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…☆78Updated 3 months ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆44Updated 4 years ago
- ☆15Updated this week
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆104Updated 2 weeks ago
- If only std::set was a DBMS: collection of templated ACID in-memory exception-free thread-safe and concurrent containers in a header-only…☆32Updated last year
- Code repo for "An Empirical Evaluation of Columnar Storage Formats"☆43Updated 4 months ago
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆15Updated last year
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆41Updated last year
- This repository contains statistics about the AI Infrastructure products.☆18Updated 2 months ago
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 4 months ago
- ☆15Updated last year