はてなブックマーク

Feral Concurrency Control: An Empirical Investigation of Modern Application Integrity Peter Bailis, Alan Fekete†, Michael J. Franklin, Ali Ghodsi, Joseph M. Hellerstein, Ion Stoica UC Berkeley and †University of Sydney ABSTRACT The rise of data-intensive “Web 2.0” Internet services has led to a range of popular new programming frameworks that collectively embody the latest incarnation of the visio

Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond When Does Consistency Require Coordination? 12 Nov 2014 My coauthors and I recently published a paper (that will appear at VLDB 2015) answering one of my longest standing research questions: when does consistency require coordination? It’s well known that many “strong” properties like “ACID” serial

I build data-intensive systems. I am the CEO and Founder of Sisu Data. Before Sisu, I was an assistant professor of CS at Stanford, where I founded the DAWN project. PhD Students and Postdocs Edward Gan (PhD 2020, software engineer at Databricks) Kexin Rong (PhD 2021, faculty at Georgia Tech; w/ Phil Levis) Kai Sheng Tai (PhD 2021, research scientist at Facebook AI; w/ Greg Valiant) Cody Coleman (

Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond Linearizability versus Serializability 24 Sep 2014 Linearizability and serializability are both important properties about interleavings of operations in databases and distributed systems, and it’s easy to get them confused. This post gives a short, simple, and hopefully practical overview of the d

Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond Non-blocking Transactional Atomicity 28 May 2013 tl;dr: You can perform non-blocking multi-object atomic reads and writes across arbitrary data partitions via some simple multi-versioning and by storing metadata regarding related items. N.B. This is a long post, but it’s comprehensive. Reading the

Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond HAT, not CAP: Introducing Highly Available Transactions 05 Feb 2013 tl;dr: Highly Available Transactions show it’s possible to achieve many of the transactional guarantees of today’s databases without sacrificing high availability and low latency. CAP and ACID Distributed systems designers face har

RC: read committed, RR: repeatable read, S: serializability, SI: snapshot isolation, CS: cursor stability, CR: consistent read Instead of providing serializability, many these databases provide one of several weaker variants,2 often when marketing material and documentation claim otherwise.3 There is no fundamental reason why a database shouldn’t support serializability—we have the algorithms, and

Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond Doing Redundant Work to Speed Up Distributed Queries 20 Sep 2012 tl;dr: In distributed data stores, redundant operations can dramatically drop tail latency at the expense of increased system load; different Dynamo-style stores handle this trade-off differently, and there’s room for improvement. Upd