> A distributed computing system, then, is naturally expressed as a set of relational stores with triggers.
1. This statement is too big of a leap; it doesn’t follow from the setup which only required an upsert operation and key/value storage. Nothing in the setup example requires relational algebra. Agree?
2. This seems like a hasty generalization. Is the author claiming that the toy example is representative of distributed systems? If so, what aspects?
IMO, the post started strong but fizzled; this is why I’m giving pointed feedback.
1. This statement is too big of a leap; it doesn’t follow from the setup which only required an upsert operation and key/value storage. Nothing in the setup example requires relational algebra. Agree?
2. This seems like a hasty generalization. Is the author claiming that the toy example is representative of distributed systems? If so, what aspects?
IMO, the post started strong but fizzled; this is why I’m giving pointed feedback.