Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
irfansharif
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
12 ms
·
31.
▲
CockroachDB 19.2
(cockroachlabs.com)
141 points
by
irfansharif
7y ago
|
60 comments
32.
▲
by
irfansharif
7y ago
I'll repeat what was mentioned elsewhere. The GC pauses in Go are in the order of microseconds. We've done a ton of work keeping our memory usage under tight bounds and keeping a close eye on exactly how the go GC processes interp
33.
▲
by
irfansharif
7y ago
Agreed, we should be talking about the "timestamp cache" in more detail generally. While I'm here, looking at [1] helped me confirm how everything is kosher despite being in-memory. The timestamp cache pessimistically maintai
34.
▲
by
irfansharif
7y ago
> I see now that it only applies in the after phase of transactions without a failure. Yep. > Would that scanning, analogous to RAID "resilvering" subject to write-intent ranges to limit the keyspace regions scanned, usefull
35.
▲
by
irfansharif
7y ago
> If I understood correctly, the extra round trip on the reader only occurs with left-over intents, which are the product of an earlier failure. Left over intents are also visible for an ongoing txn, before those intents are resolved. Bu
36.
▲
by
irfansharif
7y ago
> Though I understand it differently, as reader just waits until all writes and "txn COMMITTED" record arrive at it's node. Actually, welp, I believe this is closer to the truth in implementation. But consider how read per
37.
▲
by
irfansharif
7y ago
> Am I understanding correctly that readers' performance will degrade by the same amount? Not quite. The "slow path" talked about is only applicable when the coordinator node is unavailable (presumably a rare event). If it
38.
▲
by
irfansharif
7y ago
So if I'm reading this right, the master process can lose writes (if there's permanent failure). So taking your 2PC scheme above with the 'settled' flag, you can respond to the client that the txn has been committed once
39.
▲
by
irfansharif
7y ago
The "criticism" as it pertains to CockroachDB and off-the-shelf 2PC is less so about 2PC in isolation and more so about layering 2PC on top of consensus groups used to persist records. When any given txn does the "prepare&quo
40.
▲
by
irfansharif
7y ago
> Although we’ve come to refer to the BSL as eventually open-source since it converts to an OSI-approved license at the conversion date, due to the grant restriction, it is formally not an open-source license. They're very clear in
41.
▲
Falling in love with Rust
(dtrace.org)
440 points
by
irfansharif
8y ago
|
150 comments
42.
▲
by
irfansharif
8y ago
From Go's 1.0 compatibility guarantee[0]: > It is intended that programs written to the Go 1 specification will continue to compile and run correctly, unchanged, over the lifetime of that specification. [...] Go programs that work t
43.
▲
by
irfansharif
9y ago
For those in the area, the CockroachDB folk are hosting a meetup demoing some of the new 2.0 niceties: https://twitter.com/CockroachDB/status/978701442050592768?s=...
44.
▲
The Art and Science of Image Discovery at Netflix
(medium.com)
2 points
by
irfansharif
9y ago
|
0 comments
45.
▲
by
irfansharif
9y ago
File system.
46.
▲
by
irfansharif
9y ago
RocksDB is also an LSM structured KV store.
47.
▲
A Few Useful Things to Know about Machine Learning [pdf]
(homes.cs.washington.edu)
2 points
by
irfansharif
9y ago
|
0 comments
48.
▲
Protocol aware recovery for consensus-based storage
(blog.acolyer.org)
46 points
by
irfansharif
9y ago
|
1 comments
49.
▲
by
irfansharif
9y ago
No? Apologies if I'm not able to communicate as clearly. The RTT would be to the furthest replica within `n` replicas ordered by proximity to the query origin, where `n` is the number it would take to have a majority within the specifi
50.
▲
by
irfansharif
9y ago
Given the flexibility of where the range raft leader could be, CRDB makes an active effort to colocate it near to where the requests originate from (which is some part of what the CDN parallel was alluding to with low RTT for multi-region d
51.
▲
by
irfansharif
9y ago
At the key-value level, CockroachDB starts off with a single, empty range (a set of sorted, contiguous data from your cluster). As you put data in, this single range eventually reaches a threshold size (64MB by default). When that happens,
52.
▲
by
irfansharif
9y ago
I doubt this particular article was intended to address how CRDB handles writes cross-region, synchronous replication, etc. You'll find articles touching on varying aspects of what you're looking for if you dig through some of the
53.
▲
by
irfansharif
9y ago
As a plug for another arbitrary-precision, floating-point decimal library in Go, there's https://github.com/cockroachdb/apd .
54.
▲
Handling Contention with CockroachDB
(medium.com)
3 points
by
irfansharif
9y ago
|
0 comments
55.
▲
How good should we expect decisions to be?
(danluu.com)
8 points
by
irfansharif
9y ago
|
0 comments
56.
▲
by
irfansharif
9y ago
Not sure I quite understand the premise that there is a strict delineation between programmers who are "prepared to accept more complex syntax and semantics for <...>" and otherwise. I can think of a lot of cases where I
57.
▲
Systems Software Research Is Irrelevant – Rob Pike (2000)
(cm.bell-labs.com)
3 points
by
irfansharif
9y ago
|
0 comments
58.
▲
Capsule Neural Networks: CV Systems with Spatial Reasoning
(wired.com)
2 points
by
irfansharif
9y ago
|
1 comments
59.
▲
Queueing Theory, in Practice
(speakerdeck.com)
4 points
by
irfansharif
9y ago
|
0 comments
60.
▲
by
irfansharif
9y ago
The accompanying RFC, Parallel SQL Statement Execution: https://github.com/cockroachdb/cockroach/blob/0da3da734ce6bf...
More ›