Spanner: Google’s Globally Distributed Database
James C. Corbett,Jeffrey Dean,Michael James Boyer Epstein,Andrew Fikes,Christopher Frost,J. J. Furman,Sanjay Ghemawat,Andrey Gubarev,Christopher Heiser,Peter Hochschild,Wilson C. Hsieh,Sebastian Kanthak,Eugene Kogan,Hongyi Li,Alexander Lloyd,Sergey Melnik,David Mwaura,David Nagle,Sean Quinlan,Rajesh Rao,Lindsay Rolig,Yasushi Saito,Michal Piotr Szymaniak,Chris Jorgen Taylor,Ruth Wang,Dale Woodford +25 more
Reads0
Chats0
TLDR
Spanner as mentioned in this paper is Google's scalable, multiversion, globally distributed, and synchronously replicated database, which is the first system to distribute data at global scale and support externally-consistent distributed transactions.Abstract:
Spanner is Google’s scalable, multiversion, globally distributed, and synchronously replicated database. It is the first system to distribute data at global scale and support externally-consistent distributed transactions. This article describes how Spanner is structured, its feature set, the rationale underlying various design decisions, and a novel time API that exposes clock uncertainty. This API and its implementation are critical to supporting external consistency and a variety of powerful features: nonblocking reads in the past, lock-free snapshot transactions, and atomic schema changes, across all of Spanner.read more
Citations
More filters
Posted Content
LinSBFT: Linear-Communication One-Step BFT Protocol for Public Blockchains.
TL;DR: LinSBFT involves only a single round of voting instead of two in PBFT, which reduces both communication overhead and confirmation time, and employs the \emph{proof-of-stake} scheme to reward all participants.
Journal ArticleDOI
Distributed and parallel construction method for equi-width histogram in cloud database
Proceedings ArticleDOI
Propeller: A Profile Guided, Relinking Optimizer for Warehouse-Scale Applications
Han Shen,Krzysztof Pszeniczny,Rahman Lavaee,Snehasish Kumar,Sriraman Tallam,Xinliang David Li +5 more
TL;DR: Propeller as mentioned in this paper proposes a relinking optimizer for warehouse scale work-loads, which uses basic block sections to enable a new approach to post link optimizers without disassembly.
Proceedings ArticleDOI
SULTAN: a composite data consistency approach for SaaS multi-cloud deployment
TL;DR: SULTAN decouples the SaaS services from the cloud data stores, enabling services to adapt and migrate freely among clouds without any SAAS code modifications.
Posted Content
Joint Data Purchasing and Data Placement in a Geo-Distributed Data Market
TL;DR: A provably optimal algorithm is given for the case of a data market made up of a single data center, and a near-optimal, polynomial-time algorithm is proposed for a geo-distributed data market.
References
More filters
Journal ArticleDOI
The Google file system
TL;DR: This paper presents file system interface extensions designed to support distributed applications, discusses many aspects of the design, and reports measurements from both micro-benchmarks and real world use.
Journal ArticleDOI
Linearizability: a correctness condition for concurrent objects
TL;DR: This paper defines linearizability, compares it to other correctness conditions, presents and demonstrates a method for proving the correctness of implementations, and shows how to reason about concurrent objects, given they are linearizable.
Journal ArticleDOI
Bigtable: A Distributed Storage System for Structured Data
Fay W. Chang,Jeffrey Dean,Sanjay Ghemawat,Wilson C. Hsieh,Deborah A. Wallach,Michael Burrows,Tushar Deepak Chandra,Andrew Fikes,Robert E. Gruber +8 more
TL;DR: The simple data model provided by Bigtable is described, which gives clients dynamic control over data layout and format, and the design and implementation of Bigtable are described.
Journal ArticleDOI
The part-time parliament
TL;DR: The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.
Journal ArticleDOI
MapReduce: a flexible data processing tool
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: MapReduce advantages over parallel databases include storage-system independence and fine-grain fault tolerance for large jobs.