showcase-songs-search
usearch
| showcase-songs-search | usearch | |
|---|---|---|
| 2 | 21 | |
| 153 | 1,691 | |
| 0.7% | 8.9% | |
| 4.7 | 9.8 | |
| 9 days ago | 7 days ago | |
| JavaScript | C++ | |
| Apache License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
showcase-songs-search
-
Show HN: I scraped 25M Shopify products to build a search engine
I'm biased, but I'd recommend exploring Typesense for search.
It's an open source alternative to Algolia + Pinecone and e-commerce is a very common use-case.
Here's a live demo with 32M songs: https://songs-search.typesense.org/
Disclaimer: I work on Typesense.
-
👋Would anyone be interested in working together on a Rust client library for Typesense (OSS alternative to Algolia / ElasticSearch)?
Here’s the bench used for the songs dataset benchmark. It uses k6 for a load testing tool: https://github.com/typesense/showcase-songs-search/tree/master/scripts/benchmarking
usearch
-
I'm writing a new vector search SQLite Extension
Might have a look at this library:
https://github.com/unum-cloud/usearch
It does HNSW and there is a SQLite related project, though not quite the same thing.
- USearch SQLite Extensions for Vector and Text Search
-
Ask HN: What is the state of art approximate k-NN search algorithm today?
Another worth mentioning in this thread is usearch, though not a separate algorithm, based on HNSW with a bunch of optimizations https://github.com/unum-cloud/usearch
-
Vector Databases: A Technical Primer [pdf]
I've used usearch successfully for a small project: https://github.com/unum-cloud/usearch/
- 90x Faster Than Pgvector – Lantern's HNSW Index Creation Time
-
Python, C, Assembly – Faster Cosine Similarity
The hardest (still missing) part of efficient cosine computation distance computation is picking a good epsilon for the `sqrt` calculation and avoiding "division by zero" problems.
We have an open issue about it in USearch and a related one in SimSIMD itself, so if you have any suggestions, please share your insights - they would impact millions of devices using the library (directly on servers and mobile, and through projects like ClickHouse and some of the Google repos): https://github.com/unum-cloud/usearch/issues/320
-
Show HN: I scraped 25M Shopify products to build a search engine
As you scale, you may benefit from these two projects I maintain, and the Big Tech uses :)
https://github.com/unum-cloud/usearch - for faster search
https://github.com/unum-cloud/uform - for cheaper multi-lingual multi-modal embeddings
- [P] unum-cloud/usearch: Fastest Open-Source Similarity Search engine for Vectors in Python, JavaScript, C++, C, Rust, Java, Objective-C, Swift, C#, GoLang, and Wolfram 🔍
- USearch: SIMD-accelerated Vector Search Structure for 10 Programming Languages
-
Stringzilla: Fastest string sort, search, split, and shuffle using SIMD
> It doesn't appear to query CPUID
Yes, I'm actually looking for a good way to do it for other projects as well. I've looked into a couple more libs, and here is the best I've come up with so far: https://github.com/unum-cloud/usearch/blob/f942b6f334b31716f...
> Your substring routines have multiplicative worst case
Yes, that is true. It's a very simple stupid trick, just happens to work well for me :)
> It seems quite likely that your confirmation step
We have a different library internally at Unum, that avoids this shortcoming. It has a few thousand lines of C++ templates with SIMD intrinsics... and it's definitely more efficient, but the margins aren't always high. So I kept the pure C version with inlined functions as minimal and simple as possible.
> It would actually be possible to hook Stringzilla up to `memchr`'s benchmark suite if you were interested. :-)
Yes, that would be a fun thing to do! I haven't had time to look into `memchr` yet, but would expect great perf from your lib as well. For me the State of the Art is Intel HyperScan. Probably the most advanced SIMD library overall, not just for strings. I was very impressed with their perf ~5 years ago. But the repo is 200 K LOC... So get ready to invest a weekend :)
That said, I'm a bit slammed with work right now, including open-source. Hoping to ship a new major release in UCall this week, and a minor one in USearch :)