agavra

9 ms·

1.
Lessons in Latency(bitsxpages.com)
1 points by agavra 13d ago|0 comments
2.
Divide and Compact: Segment-Oriented Compaction in SlateDB(slatedb.io)
10 points by agavra 2mo ago|0 comments
3.
SlateDB: An Object-Native LSM for Online Systems(slatedb.io)
15 points by agavra 3mo ago|0 comments
4.
The Mathematics of Multi-Tenancy(bitsxpages.com)
6 points by agavra 4mo ago|0 comments
5.
Protocols for transactional usage of object storage(bitsxpages.com)
5 points by agavra 4mo ago|0 comments
6.
by agavra 4mo ago
If you do want a native CLI in-terminal for this, try out github.com/agavra/tuicr
7.
Faster Timeseries Aggregations(opendata.dev)
10 points by agavra 4mo ago|0 comments
8.
by agavra 5mo ago
Save you the read, here's the interesting part: For $90/mo, we ran a benchmark pushing ~30 MiB/s of metrics data via Buffer. Using public pricing calculators, the equivalent Kafka service cost roughly $1,300/month for ma
9.
How metrics are stored and queried(bitsxpages.com)
7 points by agavra 5mo ago|0 comments
10.
by agavra 5mo ago
This is the biggest gap in the 0.2.1 release. We have a pretty naive query execution engine because we've spent most of the time on core data structures and ingestion. I have some prototypes of vectorized compute that takes that same q
11.
by agavra 5mo ago
also super cool to see you on here valyala! we took a bunch of inspiration from your work at VM. kudos to all you've done :)
12.
by agavra 5mo ago
The other solution is to aggressively size your disk cache and keep effectively the full working set on disk, using object storage just as a durability layer. Then the main benefit is operational simplicity because you have a true shared-no
13.
by agavra 5mo ago
anecdotally I've heard confirmations of the challenge of running VictoriaMetrics clusters at scale. they're way better than Cortex/Thanos and they've built a pretty awesome product but still are a pretty significant oper
14.
by agavra 5mo ago
Good point, a tl;dr is probably worthwhile. It's definitely not quite turn key just yet but we've been dogfooding it in production against a moderate metrics use case (~30k samples/s) and have it hooked up to grafana (you jus
15.
The Broken Economics of Databases(bitsxpages.com)
8 points by agavra 6mo ago|0 comments
16.
Yuzudraw(yuzudraw.com)
4 points by agavra 6mo ago|0 comments
17.
Show HN: Yuzudraw – visual editor for ASCII diagrams with token-efficient DSL(github.com)
1 points by agavra 6mo ago|0 comments
18.
by agavra 7mo ago
Checkout https://github.com/agavra/tuicr - it's built exactly for this purpose (reviewing code in your terminal and then adding comments and exporting it to an agent to fix).
19.
by agavra 7mo ago
I just built a version of this a month ago that also allows you to add review comments so you can export them back to an Agent to fix: https://github.com/agavra/tuicr Great work on deff, would love to brainstorm here :
20.
by agavra 7mo ago
the compression algorithm you select for your data is quite dependent on the dataset you have. the equations in this blog post don't help you choose which compression to use, but rather "how much" and when to compress. I woul
21.
The mathematics of compression in database systems(bitsxpages.com)
61 points by agavra 7mo ago|16 comments
22.
Understanding LSM trees via read, write, and space amplification(bitsxpages.com)
3 points by agavra 8mo ago|0 comments
23.
Tuicr – Terminal UI for Code Review(tuicr.dev)
2 points by agavra 8mo ago|0 comments
24.
by agavra 8mo ago
This is spot on, I understand very little about how terminal rendering works and was able to build github.com/agavra/tuicr (Terminal UI for Code Review) in an evening. The initial TUI design was done via Claude.
25.
by agavra 8mo ago
RocksDB actually does something somewhat similar with its prefix compression. It prefix-compresses texts and then "resets"the prefix compression every N records so it stores a mapping of reset point -> offset so you can skip ac
26.
by agavra 8mo ago
this is pretty different but reminds me of https://en.wikipedia.org/wiki/Bitcask - if you're storing it all in memory why not just use a hash index?
27.
by agavra 8mo ago
So cool to see this make the front page of hacker news! I'm the author, I'll be online here throughout the weekend to answer any questions you might have :) excited for the next post which is in the works about LSM trees.
28.
by agavra 8mo ago
We haven't even started to discuss Object Storage, but it ends up looking very very similar if you're building data systems that use that instead of raw filesystems (not so much for physics reasons, but because of the way object s
29.
by agavra 8mo ago
Thanks! I use https://monodraw.helftone.com/ which is my favorite one-time-purchase software of all time. I definitely agree the buttons on the top left are unnecessary but ... it's cute and it makes me happy so I can&
30.
Show HN: Tuicr – Review Claude Code diffs like a PR from your terminal(github.com)
2 points by agavra 8mo ago|0 comments

More ›