Show HN: Design to Code with good performance
https://youtube.com/playlist?list=PL3vzYfOMUcIkd_1CzICEkH1IR...
absolute7
Re:Show HN: Design to Code with good performance
on Saturday April 04, 2026 @08:52AM (#47638642)
Thanks.
Re:Show HN: Design to Code with good performance
on Saturday April 04, 2026 @04:03AM (#47636945)
Thanks.
Show HN: Figma Alternative Free – [In Progress]
I am building free Figma alternative with focus on performance. Sharing for early feedback.https://www.absl.design/home.html
Show HN: ZDS – Zig Data Structures
https://github.com/asheshvidyut/zds
A collection of high-performance data structures for Zig.
Latest Benchmarks Show 10x Faster Prefix Queries vs. Etcd
Hi HN,I wanted to share an exciting update about Treds, the high-performance prefix search server I introduced earlier. After running a new series of benchmarks, the results continue to confirm Treds' edge over etcd for prefix-based queries:Latest Benchmark Highlights: 10x Faster Prefix Queries: Treds consistently outperforms etcd in scenarios with 100k+ keys sharing a...
Re:Show HN: Fast prefix search server in Golang
on Sunday September 22, 2024 @12:35AM (#41614651)
How it is different from Redis?
Keys at root level having a common prefix can be queried optimally
SCANKEYS/SCANKVS/KEYS/KVS commands returns the results in sorted order
Unlike Redis SCAN(opens in a new tab), Treds SCAN always returns count number of data if data is there
Unlike Redis ZRANGEBYLEX(opens in a new tab), Treds ZRANGELEX always returns data irrespective of score, basically data across different scores are returned
It has Sorted Maps instead of Sorted Sets. So we can create a Sorted Key/Value pair with associated with a score
New command - DELPREFIX - Deletes all keys having a common prefix and returns number of keys deleted
Currently, it only has Key/Value store, Sorted Maps store, List store, Set store and Hash store and only supports strings/number as values
Show HN: Fast prefix search server in Golang
Treds – Sorted Datastructure Server
Ask HN: Optimised scan which returns keys having common prefix in sorted order
Hi Everybody,I found it hard to get keys in Redis with common prefix in sorted order.So, I am working on implementing a modified data structure using which we can get sorted keys with a common prefix very fast. The command takes a start index and count as well. Here's how fast it is - I have put 10 ^ 7 keys in Redis and the new tcp server built on top of the data structure which I have...
Re:Memorizing the First 100 Perfect Squares
on Tuesday September 10, 2024 @11:11AM (#41501576)
This is cool