January/February 2018 issue of acmqueue

The January/February issue of acmqueue is out now


  Download PDF version of this article PDF

ITEM not available


Originally published in Queue vol. 12, no. 3
see this item in the ACM Digital Library



Graham Cormode - Data Sketching
The approximate approach is often faster and more efficient.

Heinrich Hartmann - Statistics for Engineers
Applying statistical techniques to operations data

Pat Helland - Immutability Changes Everything
We need it, we can afford it, and the time is now.

R. V. Guha, Dan Brickley, Steve MacBeth - Schema.org: Evolution of Structured Data on the Web
Big data makes common schemas even more necessary.


(newest first)

Siddhartha | Sat, 08 Jul 2017 11:56:41 UTC

Had a quick read, arrived at the same query as Michael did? If we are misunderstanding something, I guess the author should note it as a point thats misunderstood and give better examples.

Michael Yeaney | Wed, 14 May 2014 16:34:50 UTC

"...the ordering is enforced by delaying the application of a write until all causally previous operations have been applied."

This assumes that _all_ causally-related writes will arrive at some point, which may not be the case (network loss without re-try, for example), and also assumes (I think) that all causally-related activities happen within the same datacenter (for example, what if "Bob" is replying via the Europe datacenter, but "Alice" is observing and replying via the US datacenter).

Again...quick read, but these things jumped out at me - I may have misinterpreted something along the way.

Hello | Wed, 23 Apr 2014 08:12:59 UTC

Isn't the same reason why "transactions" exist ?

Leave this field empty

Post a Comment:

© 2018 ACM, Inc. All Rights Reserved.