DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables
☆18Feb 21, 2024Updated 2 years ago
Alternatives and similar repositories for Dessert
Users that are interested in Dessert are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆14Jan 20, 2025Updated last year
- ☆15Oct 19, 2026Updated last month
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Dec 9, 2023Updated 2 years ago
- Algorithms for approximate nearest neighbor search with window filters☆47Feb 5, 2024Updated 2 years ago
- A list of multi-vector retrieval resources☆18May 29, 2024Updated 2 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- ☆18Oct 1, 2026Updated last month
- Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph☆13Jul 31, 2025Updated last year
- ☆16Mar 16, 2021Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 11 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆31Nov 4, 2024Updated 2 years ago
- ☆10May 15, 2018Updated 8 years ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆71Oct 21, 2025Updated last year
- [SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆20Nov 9, 2025Updated last year
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆22Feb 6, 2020Updated 6 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of yo…☆22May 6, 2026Updated 6 months ago
- 📚 Awesome papers and technical blogs on vector DB (database), semantic-based vector search or approximate nearest neighbor search (ANN S…☆116Dec 2, 2025Updated 11 months ago
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆95Jun 16, 2020Updated 6 years ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆66Sep 16, 2024Updated 2 years ago
- Source code for Pivot Selection Algorithms in Metric Spaces: An Experimental Evaluation. VLDBJ 2021.☆15Jul 27, 2021Updated 5 years ago
- Artifacts for VBASE: Unifying Online Vector Similarity Search and Relational Queries via Relaxed Monotonicity☆49Jul 10, 2023Updated 3 years ago
- Large Scale Search Index☆32May 3, 2023Updated 3 years ago
- ☆12Jan 20, 2026Updated 10 months ago
- Block-based Approximate Nearest Neighbor☆35Nov 1, 2021Updated 5 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆36Jan 22, 2025Updated last year
- Papers relevant with graph and GPU☆12Jan 1, 2026Updated 10 months ago
- Implementation of SANTOS: Relationship-based Semantic Table Union Search.☆14Nov 21, 2023Updated 3 years ago
- An OpenCode plugin that shows visual diffs in your editor after file edits.☆12Feb 14, 2026Updated 9 months ago
- Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.☆90Jan 12, 2026Updated 10 months ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆72Apr 29, 2025Updated last year
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Jan 20, 2021Updated 5 years ago
- ☆11Sep 15, 2024Updated 2 years ago
- Code for paper: Unified Text-to-Image Generation and Retrieval☆15Jul 19, 2026Updated 4 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆16Sep 8, 2026Updated 2 months ago
- ☆10Nov 11, 2022Updated 4 years ago
- Implement rtree range queries and nearest neighbour queries☆24Nov 10, 2017Updated 9 years ago
- Code repository for the paper - "AdANNS: A Framework for Adaptive Semantic Search"☆69Oct 10, 2023Updated 3 years ago
- D3L dataset discovery framework - an implementation of the ICDE 2020 paper with the same name: https://arxiv.org/pdf/2011.10427.pdf☆21Nov 18, 2021Updated 5 years ago
- ☆11Feb 9, 2024Updated 2 years ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆193Jul 2, 2026Updated 4 months ago
Are these results useful?