-
annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Yes you can do this for equality predicates if your row groups are sorted . This blog post (that I didn't write) might add more color. You can't do this for any kind of text searching. If you need to do this with file based storage I'd recommend using a vector based text search and utilize a ANN index library like Annoy.
-
JetBrains
Tell us how you use coding tools. You may win a prize! Are you a developer or a data analyst? Share your thoughts about your coding tools in our short survey and get a chance to win prizes!
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a more popular project.
Related posts
-
Vector Databases 101
-
I'm an undergraduate data science intern and trying to run kmodes clustering. Did this elbow method to figure out how many clusters to use, but I don't really see an "elbow". Tips on number of clusters?
-
Calculating document similarity in a special domain
-
Billion-Scale Approximate Nearest Neighbor Search [pdf]
-
[R] Unlimiformer: Long-Range Transformers with Unlimited Length Input