Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dima_vm
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
by
dima_vm
4y ago
Don't tie the clove hitch one-handed when working with auto-breaking belay device, that caused fatalities. Use both hands to tie the full knot first, and then clip it in at once: https://www.youtube.com/watch?v=s9np7B1Z
32.
▲
by
dima_vm
4y ago
Not sure what you mean by "power queries", but Google Sheets support SQL queries. Would be easier to see on an example.
33.
▲
by
dima_vm
4y ago
If we need slotted counters, we're pretty close to the boundary of "right tool for the job", and we need to consider using a time-series database. For one use-case it might be ok, although if we expect more counters in the fu
34.
▲
by
dima_vm
6y ago
You miss the critical difference -- nowadays people don't store aggregates, they just scan sharded data very fast. That simplifies a lot of things, because you don't need to keep two databases in sync (raw and aggregated).
35.
▲
by
dima_vm
6y ago
> 10M events per second Disclaimer: I work at VictoriaMetrics open source. VictoriaMetrics ingest rates are around 300k / per second / PER CORE. So theoretically you should be fine with just a single n1-standard-32 or *.8xlarge
36.
▲
by
dima_vm
6y ago
I'm neutral on RxJava, but honestly don't know how to handle backpressure without it. Would be glad to learn.
37.
▲
by
dima_vm
6y ago
Yes, time-dependence and only numbers allows to use a lot of tricks that cannot be done with generic data. For example, double delta compression, or Gorilla for floating point numbers. For more, take a look at our open source VictoriaMetric
38.
▲
by
dima_vm
7y ago
We at VictoriaMetrics recognized importance of splitting up storage and query nodes as well. We went even further -- separated insert nodes from storage nodes. So for cluster version we have 3 types of nodes: * vminsert (stateless) *