Alternatives
Products that do what tsink does
Embedded Time-Series Database for Rust
- 1TE
Sep 2025 · github.com
- 23L
2024 · github.com
- 3IA
2014 · github.com
- 4SA
2019 · github.com
- 5VA
2019 · github.com
- 6HO
Hey HN, we want to share HelixDB (https://github.com/HelixDB/helix-db/), a project a college friend and I are working on. It’s a new database that natively intertwines graph and vector types, without sacrificing performance. It’s written in Rust and our initial focus is on supporting RAG. Here’s a video runthrough: https://screen.studio/share/szgQu3yq. Why a hybrid? Vector databases are useful for similarity queries, while graph databases are useful for relationship queries. Each stores data in a way that’s best for its main type of query (e.g.…
2025 · github.com
- 7SR
2024 · github.com
- 8DE
tl;dr we built an embeddable stream processing engine in Rust using apache DataFusion, check us out at https://github.com/probably-nothing-labs/denormalized Hey HN, We’d like to showcase a very early version of our embeddable stream processing engine called Denormalized. The rise of DuckDB has abundantly made it clear that even for many workloads of Terabyte scale, a single node system outshines the distributed query engines of previous generation such as Spark, Snowflake etc in terms of both performance and cost. Now a lot of workloads DuckDB is used for were normally…
2024 · github.com
- 9SO
2024 · github.com
- 10TA
I built a SQLite VFS in Rust that serves cold queries directly from S3 with sub-second performance, and often much faster. It’s called turbolite. It is experimental, buggy, and may corrupt data. I would not trust it with anything important yet. I wanted to explore whether object storage has gotten fast enough to support embedded databases over cloud storage. Filesystems reward tiny random reads and in-place mutation. S3 rewards fewer requests, bigger transfers, immutable objects, and aggressively parallel operations where bandwidth is often the real constraint. This was explicitly inspired…
Mar 2026 · github.com
- 11PI
2018 · pushdata.io
- 12MT
2019 · github.com
- 13VW
2020 · github.com
- 14AE
2020 · github.com
- 15

- 16

- 17AF
2024 · github.com
- 18TW
Using wasm-bindgen, and the tween-rs crate
2024 · rustween.mtassoumt.uk
- 19PL
2022 · github.com
- 20IM
Hello! I got quite some feedback on a web server I'm building, so I'm rewriting the server to be faster and easier to use. I (and maybe some other contributors?) have optimized the web server performance, especially for static file serving and reverse proxying (the last use case I optimized for very recently). I also picked a different configuration format and specification, what I believe is easier to write. Automatic TLS is also enabled by default out of the box, you don't need to even enable it manually, like it was in the original server I was building. Yesterday, I released the first…
Oct 2025 · ferron.sh
- 21IG
Rerun 0.21 comes with a new graph viewer that's written in Rust and runs in the browser via wasm. It's powered by a new force based layout engine that is a port of much of d3-force to Rust. (The release also contains some other cool stuff like undo/redo implemented on top of a timeseries DB.) We built this with applications in robotics and spatial computing in mind but would love to hear feedback from folks that would see this as useful in other domains as well.
2024 · rerun.io
- 22MR
Hey HN! We’ve just open-sourced model2vec-rs, a Rust crate for loading and running Model2Vec static embedding models with zero Python dependency. This allows you to embed text at (very) high throughput; for example, in a Rust-based microservice or CLI tool. This can be used for semantic search, retrieval, RAG, or any other text embedding usecase. Main Features: - Rust-native inference: Load any Model2Vec model from Hugging Face or your local path with StaticModel::from_pretrained(...). - Tiny footprint: The crate itself is only ~1.7 mb, with embedding models between 7 and 30 mb. Performance:…
2025 · github.com
- 23TS
2020 · github.com
- 24AW
2018 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →