scispace - formally typeset
Search or ask a question
Topic

Spanner

About: Spanner is a research topic. Over the lifetime, 2217 publications have been published within this topic receiving 14591 citations.


Papers
More filters
Proceedings ArticleDOI
08 Oct 2012
TL;DR: 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, critical to supporting external consistency and a variety of powerful features.
Abstract: Spanner is Google's scalable, multi-version, globally-distributed, and synchronously-replicated database. It is the first system to distribute data at global scale and support externally-consistent distributed transactions. This paper 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 read-only transactions, and atomic schema changes, across all of Spanner.

1,366 citations

Journal ArticleDOI
TL;DR: 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.

493 citations

Book
01 Jan 2007
TL;DR: In this paper, the authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem, and present several basic principles and results that are used throughout the book.
Abstract: Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions.

444 citations

Proceedings ArticleDOI
Cooper Brian F1
30 Jun 2013
TL;DR: The design and implementation of Spanner is discussed, as well as some of the lessons it has learned along the way, and some open challenges in building scalable distributed storage systems are discussed.
Abstract: Spanner is Google's scalable, multi-version, globally-distributed, and synchronously-replicated database. It provides strong transactional semantics, consistent replication, and high performance reads and writes for a variety of Google's applications. I'll discuss the design and implementation of Spanner, as well as some of the lessons we have learned along the way. I'll also discuss some open challenges that we still see in building scalable distributed storage systems.

263 citations

Journal ArticleDOI
01 Aug 2013
TL;DR: F1 is a distributed relational database system built at Google to support the AdWords business that combines high availability, the scalability of NoSQL systems like Bigtable and the consistency and usability of traditional SQL databases.
Abstract: F1 is a distributed relational database system built at Google to support the AdWords business. F1 is a hybrid database that combines high availability, the scalability of NoSQL systems like Bigtable, and the consistency and usability of traditional SQL databases. F1 is built on Spanner, which provides synchronous cross-datacenter replication and strong consistency. Synchronous replication implies higher commit latency, but we mitigate that latency by using a hierarchical schema model with structured data types and through smart application design. F1 also includes a fully functional distributed SQL query engine and automatic change tracking and publishing.

261 citations


Network Information
Related Topics (5)
Approximation algorithm
23.9K papers, 654.3K citations
74% related
Shortest path problem
16.6K papers, 312.8K citations
72% related
Time complexity
36K papers, 879.5K citations
72% related
Chordal graph
12.8K papers, 314.2K citations
72% related
Indifference graph
10.8K papers, 287.9K citations
71% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202323
202250
202139
202053
201984
2018140