SING is an in-memory index that uses the GPU's parallelization opportunities (as well as SIMD, multi-core and multi-socket), in order to accelerate similarity search.
-
Updated
Sep 25, 2022 - C
SING is an in-memory index that uses the GPU's parallelization opportunities (as well as SIMD, multi-core and multi-socket), in order to accelerate similarity search.
Repository for the paper "Odyssey: A Journey in the Land of Distributed Data Series Similarity Search", Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas and Botao Peng, PVLDB 2023
The Similarity Search Tree is an efficient method for indexing high dimensional feature vectors. The main objective of this data structure is to obtain the nearest neighbors given a certain query vector in a reasonable amount of time. In this project, the k-NN algorithm was adapted for supporting image retrieval.
utils to use word embedding models like word2vec vectors in a PostgreSQL database
Similar images search for PostgreSQL
Up to 200x Faster Dot Products & Similarity Metrics — for Python, Rust, C, JS, and Swift, supporting f64, f32, f16 real & complex, i8, and bit vectors using SIMD for both AVX2, AVX-512, NEON, SVE, & SVE2 📐
Add a description, image, and links to the similarity-search topic page so that developers can more easily learn about it.
To associate your repository with the similarity-search topic, visit your repo's landing page and select "manage topics."