DOCSLIB.ORG

Dissecting the Performance of Strongly-Consistent Replication Protocols

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Dissecting the Performance of Strongly-Consistent Replication Protocols Dissecting the Performance of Strongly-Consistent Replication Protocols Ailidani Ailijiang∗ Aleksey Charapko† Murat Demirbas† Microsoft University at Buffalo, SUNY University at Buffalo, SUNY [email protected] [email protected] [email protected] ABSTRACT 1 INTRODUCTION Many distributed databases employ consensus protocols to Coordination services and protocols play a key role in mod- ensure that data is replicated in a strongly-consistent man- ern distributed systems and databases. Many distributed ner on multiple machines despite failures and concurrency. databases and datastores [4, 7–10, 12, 13, 16, 18, 23, 24, 31, 40] Unfortunately, these protocols show widely varying per- use consensus to ensure that data is replicated in a strongly- formance under different network, workload, and deploy- consistent manner on multiple machines despite failures and ment conditions, and no previous study offers a comprehen- concurrency. sive dissection and comparison of their performance. To fill Fault-tolerant distributed consensus problem is addressed this gap, we study single-leader, multi-leader, hierarchical by the Paxos [25] protocol and its numerous variations and multi-leader, and leaderless (opportunistic leader) consen- extensions [1, 19–21, 26, 30, 33–35]. The performance of sus protocols, and present a comprehensive evaluation of these protocols become important for the overall perfor- their performance in local area networks (LANs) and wide mance of the distributed databases. These protocols show area networks (WANs). We take a two-pronged systematic widely varying performance under different conditions: net- approach. We present an analytic modeling of the protocols work (latency and bandwidth), workload (command interfer- using queuing theory and show simulations under varying ence and locality), deployment size and topology (LAN/WAN, controlled parameters. To cross-validate the analytic model, quorum sizes), and failures (leader and replica crash and re- we also present empirical results from our prototyping and covery). Unfortunately, there has been no study that offers a evaluation framework, Paxi. We distill our findings to simple comprehensive comparison across consensus protocols, and throughput and latency formulas over the most significant that dissects and explains their performance. parameters. These formulas enable the developers to decide which category of protocols would be most suitable under given deployment conditions. 1.1 Contributions ACM Reference Format: We present a comprehensive evaluation of consensus proto- Ailidani Ailijiang, Aleksey Charapko, and Murat Demirbas. 2019. cols in local area networks (LANs) and wide area networks Dissecting the Performance of Strongly-Consistent Replication Pro- (WANs) and investigate many single-leader, multi-leader, hi- tocols. In 2019 International Conference on Management of Data (SIG- erarchical multi-leader and leaderless (opportunistic leader) MOD ’19), June 30-July 5, 2019, Amsterdam, Netherlands. ACM, New consensus protocols. We take a two-pronged systematic ap- York, NY, USA, 15 pages. https://doi.org/10.1145/3299869.3319893 proach and study the performance of these protocols both analytically and empirically. ∗Work completed at University at Buffalo, SUNY. †Also with Microsoft, Redmond, WA. For the analytic part, we devise a queuing theory based model to study the protocols controlling for workload and Permission to make digital or hard copies of all or part of this work for deployment characteristics and present high-fidelity sim- personal or classroom use is granted without fee provided that copies are not ulations of the protocols. Our model captures parameters made or distributed for profit or commercial advantage and that copies bear impacting throughput, such as inter-node latencies, node this notice and the full citation on the first page. Copyrights for components processing speed, network bandwidth, and workload char- of this work owned by others than ACM must be honored. Abstracting with acteristics. We made the Python implementations of our credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request analytical models available as opensource. permissions from [email protected]. For our empirical study, we developed Paxi, a prototyp- SIGMOD ’19, June 30-July 5, 2019, Amsterdam, Netherlands ing and evaluation framework for consensus and replication © 2019 Association for Computing Machinery. protocols. Paxi provides a leveled playground for protocol ACM ISBN 978-1-4503-5643-5/19/06...$15.00 evaluation and comparison. The protocols are implemented https://doi.org/10.1145/3299869.3319893 using common building blocks for networking, message han- Phase 1 Phase 2 dling, quorums, etc., and the developer only needs to fill Ack Ack in two modules for describing the distributed coordination protocol. Paxi includes benchmarking support to evaluate Propose Accept the protocols in terms of their performance, availability, scal- Quorum ability, and consistency. We implemented Paxi in Go [17] Reject Quorum programming language and made it available as opensource at https://github.com/ailidani/paxi. Reject The analytical model and the Paxi experimental frame- work are complementary. The Paxi experiments cross-validate Figure 1: State transitions for two-phase coordination the analytical model. And the analytical model allows ex- ploring varying deployment conditions that are difficult to increasing the number of leaders (which helps for throughput arrange and control using the experimental framework. and latency) may cause an increase on conflicts (which hurts 1.2 Results throughput and latency). EPaxos [30] protocol suffers from this problem. Multi-leader protocols that learn and adapt to Armed with both the simulation results from the analyti- locality, such as WPaxos [1] and WanKeeper [2], are less cal model and the experimental results obtained from the susceptible to this problem. Paxi platform implementations, we distill the performance Finally, the deployment parameters, distance to the leader results into simple throughput and latency formulas and and distance from leader to the quorum number of nodes, present these in Section 6. These formulas provide a simple also have a big effect on the latency in WAN deployments. unified theory of strongly-consistent replication in terms of Note that these deployment parameters shadow the protocol throughput —Formula 3: L/(1 + cº¹Q + L − 2º— and latency parameters, the number or leaders and the quorum size. In —Formula 7:¹1+cº∗¹¹1−lº∗¹DL +DQ º+l ∗DQ º. As such, these WANs, other factors also affect latency. The asymmetric formulas enable developers to perform back-of-the-envelope distances between datacenters, the access pattern locality, performance forecasting. In Section 6 we discuss these re- and unbalanced quorum distances complicate forecasting sults in detail and provide a flowchart to serve as a guideline the performance WAN deployments. to identify which consensus protocols would be suitable for a given deployment environment. Here we highlight some 1.3 Outline of the rest of the paper significant corollaries from these formulas. In Section 2 we briefly introduce the protocols we study. L number of leaders Protocol parameters We discuss our analytical model in Section 3 and our proto- Q quorum size typing/evaluation framework in Section 4. We present the c conflict probability Workload parameters evaluation in Section 5, discussion of the findings in Section 6, l locality and conclude the paper in Section 7. D latency to leader Deployment parameters L DQ latency to quorum 2 PROTOCOLS Considering protocol parameters, an effective protocol- Many coordination and replication protocols share a similar level revision for improving throughput and latency is to state transition pattern as shown in Figure 1. These protocols increase the number of leaders in the protocol, while trying typically operate in two phases. In the phase-1, some node to avoid an increase on the number of conflicts. Increasing establishes itself as a leader by announcing itself to other the number of leaders is also good for availability: In Paxos, nodes and gaining common consent. During this stage, an failure of the single leader leads to unavailability until a new incumbent leader also acquires information related to any leader is elected, but in multi-leader protocols most requests prior unfinished commands in order to recover them in the do not experience any disruption in availability, as the failed next phase. The phase-2 is responsible for replicating the leader is not in their critical path. Another protocol revision state/commands from the leader to the nodes. that helps to improve throughput and latency is to reduce Q, Leveraging this two phase pattern, we give brief descrip- the quorum size, provided that fault-tolerance requirements tions of the protocols in our study below. These protocols are still met. provide strong consistency guarantees for data replication As workload parameters are concerned, reducing conflict in distributed databases. probability and increasing locality (in the presence of mul- Paxos. The Paxos consensus protocol [25] is typically em- tiple leaders) are beneficial. However, there is an interplay ployed for realizing a fault-tolerant replicated state machine between the number of leaders and probability of conflicts: (RSM), where each node executes the same commands in the self-appoint
Load more

Recommended publications
  • Nosql Databases: Yearning for Disambiguation
    NOSQL DATABASES: YEARNING FOR DISAMBIGUATION Chaimae Asaad Alqualsadi, Rabat IT Center, ENSIAS, University Mohammed V in Rabat and TicLab, International University of Rabat, Morocco [email protected] Karim Baïna Alqualsadi, Rabat IT Center, ENSIAS, University Mohammed V in Rabat, Morocco [email protected] Mounir Ghogho TicLab, International University of Rabat Morocco [email protected] March 17, 2020 ABSTRACT The demanding requirements of the new Big Data intensive era raised the need for flexible storage systems capable of handling huge volumes of unstructured data and of tackling the challenges that arXiv:2003.04074v2 [cs.DB] 16 Mar 2020 traditional databases were facing. NoSQL Databases, in their heterogeneity, are a powerful and diverse set of databases tailored to specific industrial and business needs. However, the lack of the- oretical background creates a lack of consensus even among experts about many NoSQL concepts, leading to ambiguity and confusion. In this paper, we present a survey of NoSQL databases and their classification by data model type. We also conduct a benchmark in order to compare different NoSQL databases and distinguish their characteristics. Additionally, we present the major areas of ambiguity and confusion around NoSQL databases and their related concepts, and attempt to disambiguate them. Keywords NoSQL Databases · NoSQL data models · NoSQL characteristics · NoSQL Classification A PREPRINT -MARCH 17, 2020 1 Introduction The proliferation of data sources ranging from social media and Internet of Things (IoT) to industrially generated data (e.g. transactions) has led to a growing demand for data intensive cloud based applications and has created new challenges for big-data-era databases.
    [Show full text]
  • Object Migration in a Distributed, Heterogeneous SQL Database Network
    Linköping University | Department of Computer and Information Science Master’s thesis, 30 ECTS | Computer Engineering (Datateknik) 2018 | LIU-IDA/LITH-EX-A--18/008--SE Object Migration in a Distributed, Heterogeneous SQL Database Network Datamigrering i ett heterogent nätverk av SQL-databaser Joakim Ericsson Supervisor : Tomas Szabo Examiner : Olaf Hartig Linköpings universitet SE–581 83 Linköping +46 13 28 10 00 , www.liu.se Upphovsrätt Detta dokument hålls tillgängligt på Internet – eller dess framtida ersättare – under 25 år från publiceringsdatum under förutsättning att inga extraordinära omständigheter uppstår. Tillgång till dokumentet innebär tillstånd för var och en att läsa, ladda ner, skriva ut enstaka kopior för enskilt bruk och att använda det oförändrat för ickekommersiell forskning och för undervisning. Överföring av upphovsrätten vid en senare tidpunkt kan inte upphäva detta tillstånd. All annan användning av dokumentet kräver upphovsmannens medgivande. För att garantera äktheten, säkerheten och tillgängligheten finns lösningar av teknisk och administrativ art. Upphovsmannens ideella rätt innefattar rätt att bli nämnd som upphovsman i den omfattning som god sed kräver vid användning av dokumentet på ovan beskrivna sätt samt skydd mot att dokumentet ändras eller presenteras i sådan form eller i sådant sammanhang som är kränkande för upphovsmannens litterära eller konstnärliga anseende eller egenart. För ytterligare information om Linköping University Electronic Press se förlagets hemsida http://www.ep.liu.se/. Copyright The publishers will keep this document online on the Internet – or its possible replacement – for a period of 25 years starting from the date of publication barring exceptional circumstances. The online availability of the document implies permanent permission for anyone to read, to download, or to print out single copies for his/hers own use and to use it unchanged for non-commercial research and educational purpose.
    [Show full text]
  • Database Software Market: Billy Fitzsimmons +1 312 364 5112
    Equity Research Technology, Media, & Communications | Enterprise and Cloud Infrastructure March 22, 2019 Industry Report Jason Ader +1 617 235 7519 [email protected] Database Software Market: Billy Fitzsimmons +1 312 364 5112 The Long-Awaited Shake-up [email protected] Naji +1 212 245 6508 [email protected] Please refer to important disclosures on pages 70 and 71. Analyst certification is on page 70. William Blair or an affiliate does and seeks to do business with companies covered in its research reports. As a result, investors should be aware that the firm may have a conflict of interest that could affect the objectivity of this report. This report is not intended to provide personal investment advice. The opinions and recommendations here- in do not take into account individual client circumstances, objectives, or needs and are not intended as recommen- dations of particular securities, financial instruments, or strategies to particular clients. The recipient of this report must make its own independent decisions regarding any securities or financial instruments mentioned herein. William Blair Contents Key Findings ......................................................................................................................3 Introduction .......................................................................................................................5 Database Market History ...................................................................................................7 Market Definitions
    [Show full text]
  • Top Newsql Databases and Features Classification
    International Journal of Database Management Systems ( IJDMS ) Vol.10, No.2, April 2018 TOP NEW SQL DATABASES AND FEATURES CLASSIFICATION Ahmed Almassabi 1, Omar Bawazeer and Salahadin Adam 2 1Department of Computer Science, Najran University, Najran, Saudi Arabia 2Department of Information and Computer Science, King Fahad University of Petroleum and Mineral, Dhahran, Saudi Arabia ABSTRACT Versatility of NewSQL databases is to achieve low latency constrains as well as to reduce cost commodity nodes. Out work emphasize on how big data is addressed through top NewSQL databases considering their features. This NewSQL databases paper conveys some of the top NewSQL databases [54] features collection considering high demand and usage. First part, around 11 NewSQL databases have been investigated for eliciting, comparing and examining their features so that they might assist to observe high hierarchy of NewSQL databases and to reveal their similarities and their differences. Our taxonomy involves four types categories in terms of how NewSQL databases handle, and process big data considering technologies are offered or supported. Advantages and disadvantages are conveyed in this survey for each of NewSQL databases. At second part, we register our findings based on several categories and aspects: first, by our first taxonomy which sees features characteristics are either functional or non-functional. A second taxonomy moved into another aspect regarding data integrity and data manipulation; we found data features classified based on supervised, semi-supervised, or unsupervised. Third taxonomy was about how diverse each single NewSQL database can deal with different types of databases. Surprisingly, Not only do NewSQL databases process regular (raw) data, but also they are stringent enough to afford diverse type of data such as historical and vertical distributed system, real-time, streaming, and timestamp databases.
    [Show full text]
  • Using Stored Procedures Effectively in a Distributed Postgresql Database
    Using stored procedures effectively in a distributed PostgreSQL database Bryn Llewellyn Developer Advocate, Yugabyte Inc. © 2019 All rights reserved. 1 What is YugabyteDB? © 2019 All rights reserved. 2 YugaByte DB Distributed SQL PostgreSQL Compatible, 100% Open Source (Apache 2.0) Massive Scale Millions of IOPS in Throughput, TBs per Node High Performance Low Latency Queries Cloud Native Fault Tolerant, Multi-Cloud & Kubernetes Ready © 2019 All rights reserved. 3 Functional Architecture YugaByte SQL (YSQL) PostgreSQL-Compatible Distributed SQL API DOCDB Spanner-Inspired Distributed Document Store Cloud Neutral: No Specialized Hardware Needed © 2019 All rights reserved. 4 Questions? Download download.yugabyte.com Join Slack Discussions yugabyte.com/slack Star on GitHub github.com/YugaByte/yugabyte-db © 2019 All rights reserved. 5 Q: Why use stored procedures? © 2019 All rights reserved. 6 • Large software systems must be built from modules • Hide implementation detail behind API • Software engineering’s most famous principle • The RDBMS is a module • Tables and SQLs that manipulate them are the implementation details • Stored procedures express the API • Result: happiness • Developers and end-users of applications built this way are happy with their correctness, maintainability, security, and performance © 2019 All rights reserved. 7 A: Use stored procedures to encapsulate the RDBMS’s functionality behind an impenetrable hard shell © 2019 All rights reserved. 8 Hard Shell Schematic © 2019 All rights reserved. 9 Public APP DATABASE © 2019 All rights reserved. 10 Public APP DATABASE © 2019 All rights reserved. 11 APP DATABASE © 2019 All rights reserved. 12 Data APP DATABASE © 2019 All rights reserved. 13 Data Code . APP DATABASE © 2019 All rights reserved.
    [Show full text]
  • Cockroachdb: the Resilient Geo-Distributed SQL Database
    Industry 3: Cloud and Distributed Databases SIGMOD ’20, June 14–19, 2020, Portland, OR, USA CockroachDB: The Resilient Geo-Distributed SQL Database Rebecca Taft, Irfan Sharif, Andrei Matei, Nathan VanBenschoten, Jordan Lewis, Tobias Grieger, Kai Niemi, Andy Woods, Anne Birzin, Raphael Poss, Paul Bardea, Amruta Ranade, Ben Darnell, Bram Gruneir, Justin Jaffray, Lucy Zhang, and Peter Mattis [email protected] Cockroach Labs, Inc. ABSTRACT We live in an increasingly interconnected world, with many organizations operating across countries or even con- tinents. To serve their global user base, organizations are replacing their legacy DBMSs with cloud-based systems ca- pable of scaling OLTP workloads to millions of users. CockroachDB is a scalable SQL DBMS that was built from the ground up to support these global OLTP workloads while maintaining high availability and strong consistency. Just like its namesake, CockroachDB is resilient to disasters through replication and automatic recovery mechanisms. This paper presents the design of CockroachDB and its novel transaction model that supports consistent geo-distrib- Figure 1: A global CockroachDB cluster uted transactions on commodity hardware. We describe how CockroachDB replicates and distributes data to achieve fault ACM, New York, NY, USA, 17 pages. https://doi.org/10.1145/3318464. tolerance and high performance, as well as how its distributed 3386134 SQL layer automatically scales with the size of the database cluster while providing the standard SQL interface that users 1 INTRODUCTION expect. Finally, we present a comprehensive performance Modern transaction processing workloads are increasingly evaluation and share a couple of case studies of CockroachDB geo-distributed. This trend is fueled by the desire of global users.
    [Show full text]
  • Newsql Principles, Systems and Current Trends
    NewSQL Principles, Systems and Current Trends Patrick Valduriez Ricardo Jimenez-Peris Outline • Motivations • Principles and techniques • Taxonomy of NewSQL systems • Current trends Motivations Why NoSQL/NewSQL? • Trends • Big data • Unstructured data • Data interconnection • Hyperlinks, tags, blogs, etc. • Very high scalability • Data size, data rates, concurrent users, etc. • Limits of SQL systems (in fact RDBMSs) • Need for skilled DBA, tuning and well-defined schemas • Full SQL complex • Hard to make updates scalable • Parallel RDBMS use a shared-disk for OLTP, which is hard to scale BigData 2019 © P. Valduriez and R. Jimenez-Peris, 2019 4 Scalability • Ideal: linear scale-up • Sustained performance for a linear increase of ideal database size and load Perf. • By proportional increase of components Components & charge BigData 2019 © P. Valduriez and R. Jimenez-Peris, 2019 5 Vertical vs Horizontal Scaleup • Typically in a shared-nothing computer cluster Switch Switch Switch Pn Pn Pn Pn Scale-up P2 P2 P2 P2 P1 P1 P1 P1 Scale-out BigData 2019 © P. Valduriez and R. Jimenez-Peris, 2019 6 Query Parallelism • Inter-query • Different queries on the same Q1 … Qn data R • For concurrent queries • Inter-operation Op3 • Different operations of the same query on different data Op1 Op2 • For complex queries R S • Intra-operation • The same operation on Op … Op different data • For large queries R1 Rn BigData 2019 © P. Valduriez and R. Jimenez-Peris, 2019 7 The CAP Theorem • Polemical topic • "A database can't provide consistency AND availability during a network partition" • Argument used by NoSQL to justify their lack of ACID properties • Nothing to do with scalability • Two different points of view • Relational databases • Consistency is essential • ACID transactions • Distributed systems • Service availability is essential • Inconsistency tolerated by the user, e.g.
    [Show full text]
  • Recent Trends in Data Persistence and Analysis
    SQL Strikes Back Recent Trends in Data Persistence and Analysis Codemesh 2014 November 4, 2014 Dean Wampler, Ph.D [email protected] ©Typesafe 2014 – All Rights Reserved Tuesday, November 4, 14 All photos are copyright (C) 2008 - 2014, Dean Wampler. All Rights Reserved. Photo: Before dawn above the Western USA [email protected] polyglotprogramming.com/talks @deanwampler ©Typesafe 2014 – All Rights Reserved 2 Tuesday, November 4, 14 Typesafe provides products and services for building Reactive, Big Data applications typesafe.com/reactive-big-data ©Typesafe 2014 – All Rights Reserved 3 Tuesday, November 4, 14 For @coderoshi... Cat meme! ©Typesafe 2014 – All Rights Reserved 4 Tuesday, November 4, 14 If you were at Eric Raymond’s (@coderoshi’s) talk... My cat Oberon. Three Trends ©Typesafe 2014 – All Rights Reserved 5 Tuesday, November 4, 14 Three trends to organizer our thinking… Photo: Dusk over the American Midwest, in Winter Data Size ⬆ ©Typesafe 2014 – All Rights Reserved 6 Tuesday, November 4, 14 Data volumes are obviously growing… rapidly. Facebook now has over 600PB (Petabytes) of data in Hadoop clusters! Formal Schemas ⬇ ©Typesafe 2014 – All Rights Reserved 7 Tuesday, November 4, 14 There is less emphasis on “formal” schemas and domain models, i.e., both relaonal models of data and OO models, because data schemas and sources change rapidly, and we need to integrate so many disparate sources of data. So, using relavely-agnos^c so_ware, e.g., collec^ons of things where the so_ware is more agnos^c about the structure of the data and the domain, tends to be faster to develop, test, and deploy.
    [Show full text]
  • Tidb As an HTAP Database
    TiDB as an HTAP Database 主讲人：PingCap CEO 刘奇 About me • CEO and co-founder of PingCAP • Open source hacker • Infrastructure engineer • Founder of TiDB/TiKV/Codis • Infrastructure software engineer • Wandoulabs/JD Why a new database? Brief History RDBMS NoSQL NewSQL ● Standalone RDBMS 1970s 2010 2015 Present ● NoSQL ● Middleware & Proxy Redis Google Spanner MySQL HBase Google F1 ● NewSQL PostgreSQL Cassandra TiDB Oracle MongoDB DB2 ... ... NewSQL Database ● Horizontal Scalability ● ACID Transaction ● High Availability ● SQL at Scale OLTP & OLAP OLTP OLAP ETL 8am 2pm 6pm 2am Database Where is my data? ERP Is the data out-of-date? Data Warehouse CRM Why two separate systems ● Huge data size ● Complex query logic ● Latency VS Throughput ● Point query VS Full range scan ● Transaction & lsolation level OLAP + OLTP = HTAP Hybrid Transactional / Analytical Processing ● ACID Transcation ● Real-time analysis ● SQL HTAP How do we build the new database What is TiDB ● Scalability as the first class feature ● SQL is necessary ● Compatible with MySQL, in most cases ● OLTP + OLAP = HTAP (Hybrid Transactional/Analytical Processing) ● 24/7 availability, even in case of datacenter outages ● Open source, of course Architecture Stateless SQL Layer Metadata / Timestamp request TiDB ... TiDB ... TiDB Placement Driver (PD) Raft Raft Raft TiKV ... TiKV TiKV TiKV Control flow: Balance / Failover Distributed Storage Layer TiKV - Overview • Region: a set of continuous key-value pairs • Data is organized/stored/replicated by Regions • Highly layered TiKV Key Space RPC (gRPC) Node A Transaction 256MB MVCC [ start_key, Raft end_key) RocksDB (-∞, +∞) Raft Raft Sorted Map Node B Node C Raft TiKV - Multi-Raft Multiple raft groups in the cluster, one group for each region.
    [Show full text]
  • Distributed Sql Database for Retail
    DistributeD sQL Database for retaiL Over the past decade, retailers have seen dramatic shifts in consumer buying behavior as shoppers move online to research products, read consumer reviews, compare prices, and purchase. Faced with competition from digital-native compa- nies and e-commerce startups, incumbent businesses are building competencies in areas such as just-in-time inventory, warehouse automation, omnichannel shopping, and personalized customer experience. Technology innovation in retail is driven by the need to create a competitive advantage by delivering always avail- able, differentiated services more quickly while reducing costs and business risks. “Retail organizations are Microservices and application modernization initiatives promise to deliver agility, building business-critical scalability, and resilience. Modern applications need systems of record that deliver resilience and scale without compromising performance. YugabyteDB is an open microservices such as source, cloud native, distributed database that uniquely combines enterprise-grade shopping carts, shopping relational database capabilities with the horizontal scalability and resilience of cloud lists, product catalogs, native architectures. Retail organizations are building business-critical microser- pricing, promotions, vices such as shopping carts, shopping lists, product catalogs, pricing, promotions, and payment systems and payment systems using YugabyteDB as the system of record. using YugabyteDB as the system of record. Accelerate Reduce Cost Achieve Compliance Time to Market Spend up to 80% less on Comply with privacy Deliver high-value technology while achiev- regulations, sovereignty applications ing operational efficien- laws, and industry stan- more quickly. cies with no lock-in. dards while mitigating risk. Cloud Native Database for Demanding Applications YugabyteDB is a perfect fit for transactional applications that demand resilience, scalability, and consistently high performance.
    [Show full text]
  • Distributed Transactions Without Atomic Clocks Sometimes, It’S All Just About Good Timing
    Distributed Transactions Without Atomic Clocks Sometimes, it’s all just about good timing Karthik Ranganathan, co-founder & CTO © 2019 All rights reserved. 1 Introduction © 2019 All rights reserved. 2 Designing the Perfect Distributed SQL Database Skyrocketing adoption of PostgreSQL for cloud-native applications Google Spanner The first horizontally scalable, strongly consistent, relational database service PostgreSQL is not highly available or horizontally scalable Spanner does not have the RDBMS feature set © 2019 All rights reserved. 3 Design Goals for YugabyteDB Transactional, distributed SQL database designed for resilience and scale PostgreSQL Google Spanner YugabyteDB ● 100% open source SQL Ecosystem ✓ ✘ ✓ ● PostgreSQL compatible Massively adopted New SQL flavor Reuse PostgreSQL ● Enterprise-grade RDBMS ✓ ✘ ✓ ○ Day 2 operational simplicity RDBMS Features Advanced Basic Advanced ○ Secure deployments Complex cloud-native Complex and cloud-native ● Public, private, hybrid clouds Highly Available ✘ ✓ ✓ ● High performance Horizontal Scale ✘ ✓ ✓ Distributed Txns ✘ ✓ ✓ Data Replication Async Sync Sync + Async © 2019 All rights reserved. 4 YugabyteDB Reuses PostgreSQL Query Layer © 2019 All rights reserved. 5 Transactions are fundamental to SQL… But they require time synchronization between nodes. Why? Let’s look at single-row transactions before answering this © 2019 All rights reserved. 6 Single-Row Transactions: Raft Consensus © 2019 All rights reserved. 7 Distributing Data For Horizontal Scalability ● Assume 3-nodes across zones ● User tables sharded into tablets ● How to distribute data across ● Tablet = group of rows nodes? ● Sharding is transparent to user tablet 1’ © 2019 All rights reserved. 8 Tablets Use Raft-Based Replication A: Tablet Peer 1. Start leader election B: Tablet Peer C: Tablet Peer Tablet data User queries Raft Algorithm for replicating data: per-row linearizability 2.
    [Show full text]
  • Principles of Distributed Database Systems: Spotlight on Newsql
    Principles of Distributed Database Systems: spotlight on NewSQL Patrick Valduriez Outline • Distributed database systems • NoSQL • Polystores • Spotlight on NewSQL • Taxonomy of NewSQL systems • Current trends Principles of Distributed Database Systems Tamer Özsu & Patrick Valduriez The Story of the Book Relational databases. 1991 “In the following 10 years, centralized DBMSs would be an antique curiosity and most organizations would move towards distributed DBMSs.” M. Stonebraker (1988) Advanced transaction models, 1999 query optimization, object data management, parallel DBMSs. 2011 Data replication, database clusters, web data integration, P2P, cloud. 2020 Blockchain, big data, data streaming, graph data analytics, NoSQL, NewSQL, polystores. SBBD 2020 © P. Valduriez 2020 4 Distributed Database - User View 1991 SBBD 2020 © P. Valduriez 2020 5 Distributed Database - User View 2020 SBBD 2020 © P. Valduriez 2020 6 Distributed DBMS – Reality User Query DBMS User Application Software DBMS Software DBMS Communication Software Subsystem User DBMS User Application Software Query DBMS Software User Query SBBD 2020 © P. Valduriez 2020 7 Definitions • A distributed database (DDB) is a collection of multiple, logically interrelated databases distributed over a computer network • WAN, LAN, cluster interconnect • A distributed database system (distributed DBMS) is the software that manages the DDB and provides an access mechanism that makes this distribution transparent to the users SBBD 2020 © P. Valduriez 2020 8 Promises of Distributed DBMSs • Transparent management of distributed, fragmented, and replicated data • Declarative query language (SQL) • Improved reliability/availability through replication and distributed transactions • Strong ACID consistency • Failover and online recovery • Improved performance • Proximity of data to its points of use • Data-based parallelism • Query optimization • Easier and more economical system expansion • Elasticity in the cloud SBBD 2020 © P.
    [Show full text]