Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
freels
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
61.
▲
by
freels
10y ago
I agree with you that it's not an original analogy, in fact I think you can safely say that most larger, performance-oriented systems end up looking more like an OS than not. There's a large overlap in the problems that need to be
62.
▲
by
freels
10y ago
Fair enough, though at that point, you're layering on additional complexity and getting further away from the goal of simplicity. (And to point 3, while this is true, using a log means this problem can be dealt with a lot later, and th
63.
▲
by
freels
10y ago
This is true, but comes at the cost of not being able to preserve linearity across arbitrary keys, and you are still limited by the throughput on updates to a single key.
64.
▲
by
freels
10y ago
I think this overstates the instability of strong leader-based consensus algorithms, or at least over-generalizes Raft's instability to apply to all consensus algorithms with a stronger leader. In Raft, it's possible for multiple
65.
▲
by
freels
10y ago
One thing that makes this easier is that FaunaDB does not support session transactions, rather you must express your transaction logic as a single Fauna query, which is executed atomically. Transactions can still involve arbitrary keys, how
66.
▲
by
freels
10y ago
To be clear, read-write transactions are applied in a consistent order derived from the transaction log. Read-only transactions can rely on the fact that read-write transactions are totally ordered, and execute without global coordination w
67.
▲
by
freels
10y ago
It's variable, and the client can provide it. By default, we use the greater of wall clock time or the highest timestamp transaction timestamp the node serving the query has seen.
68.
▲
by
freels
10y ago
Thanks, we realize the docs still have a long ways to go and are working to improve them as fast as we can. This is a good summary. We're definitely aware that the lack schema definition is a problem for certain use-cases, and solving
69.
▲
by
freels
10y ago
FaunaDB has a per-database replicated transaction log. Once a transaction has been globally committed to the log, it is applied to each local partition that covers part of the transaction. By this point, the transaction's order with re
70.
▲
by
freels
10y ago
A more apples-to-apples comparison with Cassandra would be FaunaDB transactions and Cassandra's atomic batch mutations, or its PAXOS-based lightweight transactions as opposed to single-cell writes tested in most Cassandra benchmarks. Y
71.
▲
by
freels
10y ago
FaunaDB's query language makes it straightforward to do it the first way. All queries are serializable, so any preconditions checked would gate transaction commit as you would expect, and read-modify-write style transactions work. edit
72.
▲
by
freels
11y ago
For the same reason you can't start making adhesive bandages and selling them as Band-Aids, even though many people call them that: Both are proper names for a specific regional brand of sparkling wine and grana, or hard cheese, respec
73.
▲
by
freels
11y ago
From what I understand, a lot of this caffeine is sold to soda makers as a byproduct of the decaffeination process used on coffee beans. Does this mean the end of soda as well?
74.
▲
by
freels
12y ago
For longer periods of outdoor use, a low-power built-in text interface would be useful. Especially if the battery lasts longer than my phone's.