Low Overhead Concurrency Control for Partitioned Main Memory Databases. Evan P. C. Jones Daniel J. Abadi Samuel Madden"
|
|
- Allan Shelton
- 5 years ago
- Views:
Transcription
1 Low Overhead Concurrency Control for Partitioned Main Memory Databases Evan P. C. Jones Daniel J. Abadi Samuel Madden"
2 Banks" Payment Processing" Airline Reservations" E-Commerce" Web 2.0"
3 Problem:" Millions of transactions per second"
4 Problem:" Millions of transactions per second"
5 Problem:" Millions of transactions per second" =! $$$$!
6 Alternative: H-Store Project" Redesign specifically for OLTP" Prototype: ~0X throughput" Idea: Remove un-needed features" Source: Stonebraker et. al, The End of an Architectural Era, VLDB "
7 H-Store: High Throughput OLTP" Redesign DB specifically for OLTP" Prototype: ~0X throughput" Main memory database" Concurrency control consumes ~30-40% of CPU time"
8 *!)# *!"# Q=02 I02 *$%++.+7# 87',+# $!)# $!"# (!)# 0Q=W2 0C=I2,)--("-,)'.("-,/$'0("- I`=L2 concurrency control! 30-40% (!"#!)# &22+% 3/"/-+% 0I=2!"# CPU Cycle Breakdown for Shore on TPC-C New Order! Source: Harizopoulos, Abadi, Madden and Stonebraker," OLTP Under the Looking Glass, SIGMOD 2008"
9 *!)# *!"# Q=02 I02 *$%++.+7# 87',+# $!)# $!"# (!)# 0Q=W2 0C=I2,)--("-,)'.("-,/$'0("- I`=L2 concurrency control! 30-40% (!"#!)# &22+% 3/"/-+% 0I=2!"# CPU Cycle Breakdown for Shore on TPC-C New Order! Source: Harizopoulos, Abadi, Madden and Stonebraker," OLTP Under the Looking Glass, SIGMOD 2008"
10 Speculative Concurrency Control" Eliminate fine-grained access tracking (locks or read/write sets)" Eliminate undo logs (where possible)" Up to 2X faster than locking for appropriate workloads!
11 Why Support Concurrency?" Use idle resources:" " disk stalls" " user stalls" main memory" stored procedures" Physical resources:" " multiple CPUs" " multiple disks" partition per core" Long running txns:" donʼt do them"
12 H-Store: Single thread engine" Assumptions:! Database divided into partitions" Transactions access one partition (mostly)" Mapping procedures to partitions is given" Total data fits in memory of N machines" Partitions are replicated on 2 machines"
13 System Overview" Clients H-Store Client Library Client Library Client Library
14 Single Partition Transaction" Client
15 Single Partition Transaction" Client 2
16 Single Partition Transaction" Client execute 2
17 Single Partition Transaction" Client execute 2 3
18 Single Partition Transaction" Client 4 execute 2 3
19 Single Partition Transaction" Client 4 execute 2 3 execute
20 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library
21 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 2
22 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 2 3
23 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
24 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
25 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
26 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
27 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
28 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
29 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
30 Single Partition Transaction" Clients H-Store Client Library Client Library Client Library 4 2 3
31 Not Perfectly Partionable?" Example: users and groups" Many applications are mostly partitionable" e.g. TPC-C: % multi-partition transactions"
32 Distributed Transactions" Need two-phase commit (consensus)" Simple solution:" block until the transaction finishes" Introduces network stall (bad)"
33 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library
34 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library 2 2
35 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library 2 2
36 Blocking Multi-Partition" Client 2 P P
37 Blocking Multi-Partition" Client 2 P 3 P
38 Blocking Multi-Partition" Client 2 P execute 3 P
39 Blocking Multi-Partition" Client 2 P execute 3 4 P
40 Blocking Multi-Partition" Client 2 5 P execute 3 4 P
41 Blocking Multi-Partition" Client 2 5 P execute 3 4 P
42 Blocking Multi-Partition" Client P execute 3 4 P
43 Blocking Multi-Partition" Client P execute execute 3 4 P
44 Blocking Multi-Partition" Client P execute execute 3 4 P network stall
45 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library
46 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library
47 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library
48 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library
49 Blocking Multi-Partition" Clients H-Store Client Library Client Library Client Library
50 Two-Phase Locking" + Execute non-conflicting txns during stall" + No need to order in advance! Locking overhead" Deadlocks" Optimization: turn off locks and undo logging when no multi-partition transactions"
51 Speculative CC" While waiting for commit/abort, speculatively execute other transactions" + No locks; no read/write sets" Need global transaction order" Cascading aborts"
52 Speculative Multi-Partition" Client 2 5 P execute 3 4 P
53 Speculative Multi-Partition" Client 2 5 P execute execute 3 4 P
54 Speculative Multi-Partition" Client 2 5 P execute execute 3 4 P
55 Speculative Multi-Partition" Client 2 5 P execute execute 3 4 P
56 Speculative Multi-Partition" Client P execute execute 3 4 P
57 Speculative Multi-Partition" Client P execute execute 3 4 P
58 Speculation Limitation" Transactions with multiple rounds of work: need network stall" Example:". Read x on partition, y on partition 2" 2. Update x = f(x, y); y = f(x, y)"
59 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
60 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library 2 2 3
61 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
62 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
63 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
64 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
65 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
66 Speculative Multi-Partition" Clients H-Store Client Library Client Library Client Library
67 Microbenchmark" Two partitions of a single table" (id INTEGER PRIMARY KEY, value INTEGER) Client Load Generator
68 Microbenchmark" Single partition transaction:" " read/write keys on one partition" Multi-partition transaction:" " access half keys from each partition" single partition work = multi-partition work" No deadlocks, no aborts, no conflicts"
69 Throughput (transactions/s)" 30000" 25000" 20000" Speculation" 5000" Locking" 0000" 5000" Blocking" Locking 40% Conflicts" 0" 0" 20" 40" 60" 80" 00" % Multi-Partition"
70 30000 Transactions/second Speculation Blocking Locking % 20% 40% 60% 80% 00% Multi-Partition Transactions
71 TPC-C Based" ~% multi-partition transactions" More complex locking" Many conflicts" Some deadlocks" Some aborts"
72 Throughput (transactions/s)" 30000" 25000" Speculation" 20000" Blocking" 5000" 0000" Locking" 5000" 0" 2" 4" 6" 8" 0" 2" 4" 6" 8" 20" Warehouses"
73 Transactions/second Speculation Blocking Locking Warehouses
74 Speculative CC"! better for mostly partitionable apps on main memory DBs! Up to 2X throughput" No locking overhead" No deadlocks"
75 Speculation 0% aborts Speculation % aborts Speculation 3% aborts Speculation 5% aborts Speculation 0% aborts Blocking 0% aborts Locking 0% aborts Transactions/second % 20% 40% 60% 80% 00% Multi-Partition Transactions
76 Locking 0% conflict Locking 20% conflict Locking 60% conflict Locking 00% conflict Speculation Blocking Transactions/second % 20% 40% 60% 80% 00% Multi-Partition Transactions
77 Speculation Blocking Locking Transactions/second % 20% 40% 60% 80% 00% Multi-Partition Transactions
78 Model Blocking Model Speculate Model Locking Measured Blocking Measured Speculate Measured Locking Transactions/second % 20% 40% 60% 80% 00% Multi-Partition Transactions
79 Speculation Blocking Locking Transactions/second % 20% 40% 60% 80% 00% Multi-Partition Transactions
80 Speculation Local Speculation Blocking Locking Optimistic Transactions/second % 20% 40% 60% 80% 00% Multi-Partition Transactions
81 Transactions/second Speculation Blocking Locking Optimistic Warehouses
Low Overhead Concurrency Control for Partitioned Main Memory Databases
Low Overhead Concurrency Control for Partitioned Main Memory Databases Evan Jones, Daniel Abadi, Samuel Madden, June 2010, SIGMOD CS 848 May, 2016 Michael Abebe Background Motivations Database partitioning
More informationConcurrency Control In Distributed Main Memory Database Systems. Justin A. DeBrabant
In Distributed Main Memory Database Systems Justin A. DeBrabant debrabant@cs.brown.edu Concurrency control Goal: maintain consistent state of data ensure query results are correct The Gold Standard: ACID
More informationSTEPS Towards Cache-Resident Transaction Processing
STEPS Towards Cache-Resident Transaction Processing Stavros Harizopoulos joint work with Anastassia Ailamaki VLDB 2004 Carnegie ellon CPI OLTP workloads on modern CPUs 6 4 2 L2-I stalls L2-D stalls L1-I
More informationAn Evaluation of Distributed Concurrency Control. Harding, Aken, Pavlo and Stonebraker Presented by: Thamir Qadah For CS590-BDS
An Evaluation of Distributed Concurrency Control Harding, Aken, Pavlo and Stonebraker Presented by: Thamir Qadah For CS590-BDS 1 Outline Motivation System Architecture Implemented Distributed CC protocols
More informationLast Class Carnegie Mellon Univ. Dept. of Computer Science /615 - DB Applications
Last Class Carnegie Mellon Univ. Dept. of Computer Science 15-415/615 - DB Applications C. Faloutsos A. Pavlo Lecture#23: Concurrency Control Part 3 (R&G ch. 17) Lock Granularities Locking in B+Trees The
More informationSCHISM: A WORKLOAD-DRIVEN APPROACH TO DATABASE REPLICATION AND PARTITIONING
SCHISM: A WORKLOAD-DRIVEN APPROACH TO DATABASE REPLICATION AND PARTITIONING ZEYNEP KORKMAZ CS742 - PARALLEL AND DISTRIBUTED DATABASE SYSTEMS UNIVERSITY OF WATERLOO OUTLINE. Background 2. What is Schism?
More informationThe End of an Architectural Era (It's Time for a Complete Rewrite)
The End of an Architectural Era (It's Time for a Complete Rewrite) Michael Stonebraker Samuel Madden Daniel Abadi Stavros Harizopoulos Nabil Hachem Pat Helland Paper presentation: Craig Hawkins craig_hawkins@brown.edu
More informationJanus. Consolidating Concurrency Control and Consensus for Commits under Conflicts. Shuai Mu, Lamont Nelson, Wyatt Lloyd, Jinyang Li
Janus Consolidating Concurrency Control and Consensus for Commits under Conflicts Shuai Mu, Lamont Nelson, Wyatt Lloyd, Jinyang Li New York University, University of Southern California State of the Art
More informationNewSQL. Database Landscape From: the 451 group. OLTP Focus. NewSQL: Flying on ACID. Cloud DB, Winter 2014, Lecture 14
NewSQL: Flying on ACID David Maier NewSQL Keep SQL (some of it) and ACID But be speedy and scalable Thanks to H-Store folks, Mike Stonebraker, Fred Holahan 3/5/14 David Maier, Portland State University
More informationNewSQL: Flying on ACID
NewSQL: Flying on ACID David Maier Thanks to H-Store folks, Mike Stonebraker, Fred Holahan NewSQL Keep SQL (some of it) and ACID But be speedy and scalable 3/5/14 David Maier, Portland State University
More informationRethinking Serializable Multi-version Concurrency Control. Jose Faleiro and Daniel Abadi Yale University
Rethinking Serializable Multi-version Concurrency Control Jose Faleiro and Daniel Abadi Yale University Theory: Single- vs Multi-version Systems Single-version system T r Read X X 0 T w Write X Multi-version
More informationAdvances in Data Management - NoSQL, NewSQL and Big Data A.Poulovassilis
Advances in Data Management - NoSQL, NewSQL and Big Data A.Poulovassilis 1 NoSQL So-called NoSQL systems offer reduced functionalities compared to traditional Relational DBMSs, with the aim of achieving
More informationBig and Fast. Anti-Caching in OLTP Systems. Justin DeBrabant
Big and Fast Anti-Caching in OLTP Systems Justin DeBrabant Online Transaction Processing transaction-oriented small footprint write-intensive 2 A bit of history 3 OLTP Through the Years relational model
More informationBuilding Consistent Transactions with Inconsistent Replication
Building Consistent Transactions with Inconsistent Replication Irene Zhang, Naveen Kr. Sharma, Adriana Szekeres, Arvind Krishnamurthy, Dan R. K. Ports University of Washington Distributed storage systems
More informationCSE 444: Database Internals. Lectures 13 Transaction Schedules
CSE 444: Database Internals Lectures 13 Transaction Schedules CSE 444 - Winter 2018 1 About Lab 3 In lab 3, we implement transactions Focus on concurrency control Want to run many transactions at the same
More informationDistributed Systems. 12. Concurrency Control. Paul Krzyzanowski. Rutgers University. Fall 2017
Distributed Systems 12. Concurrency Control Paul Krzyzanowski Rutgers University Fall 2017 2014-2017 Paul Krzyzanowski 1 Why do we lock access to data? Locking (leasing) provides mutual exclusion Only
More informationarxiv: v1 [cs.db] 8 Mar 2017
Scaling Distributed Transaction Processing and Recovery based on Dependency Logging Chang Yao, Meihui Zhang, Qian Lin, Beng Chin Ooi, Jiatao Xu National University of Singapore, Singapore University of
More informationTHE UNIVERSITY OF CHICAGO TOWARD COORDINATION-FREE AND RECONFIGURABLE MIXED CONCURRENCY CONTROL A DISSERTATION SUBMITTED TO
THE UNIVERSITY OF CHICAGO TOWARD COORDINATION-FREE AND RECONFIGURABLE MIXED CONCURRENCY CONTROL A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF THE PHYSICAL SCIENCE IN CANDIDACY FOR THE DEGREE
More informationTrouble with transactions. Evan Jones
Trouble with transactions Evan Jones http://evanjones.ca A love story A short love story I Afell in short love story love with transactions with transactions Transactions = correct programs A four year
More informationLast Class Carnegie Mellon Univ. Dept. of Computer Science /615 - DB Applications
Last Class Carnegie Mellon Univ. Dept. of Computer Science 15-415/615 - DB Applications C. Faloutsos A. Pavlo Lecture#23: Concurrency Control Part 2 (R&G ch. 17) Serializability Two-Phase Locking Deadlocks
More information) Intel)(TX)memory):) Transac'onal) Synchroniza'on) Extensions)(TSX))) Transac'ons)
) Intel)(TX)memory):) Transac'onal) Synchroniza'on) Extensions)(TSX))) Transac'ons) Transactions - Definition A transaction is a sequence of data operations with the following properties: * A Atomic All
More informationMotivating Example. Motivating Example. Transaction ROLLBACK. Transactions. CSE 444: Database Internals
CSE 444: Database Internals Client 1: SET money=money-100 WHERE pid = 1 Motivating Example Client 2: SELECT sum(money) FROM Budget Lectures 13 Transaction Schedules 1 SET money=money+60 WHERE pid = 2 SET
More informationAdvances in Data Management - NoSQL, NewSQL and Big Data A.Poulovassilis
Advances in Data Management - NoSQL, NewSQL and Big Data A.Poulovassilis 1 NoSQL So-called NoSQL systems offer reduced functionalities compared to traditional Relational DBMS, with the aim of achieving
More informationCSE 544 Principles of Database Management Systems. Alvin Cheung Fall 2015 Lecture 14 Distributed Transactions
CSE 544 Principles of Database Management Systems Alvin Cheung Fall 2015 Lecture 14 Distributed Transactions Transactions Main issues: Concurrency control Recovery from failures 2 Distributed Transactions
More informationMain-Memory Databases 1 / 25
1 / 25 Motivation Hardware trends Huge main memory capacity with complex access characteristics (Caches, NUMA) Many-core CPUs SIMD support in CPUs New CPU features (HTM) Also: Graphic cards, FPGAs, low
More informationA Survey Paper on NoSQL Databases: Key-Value Data Stores and Document Stores
A Survey Paper on NoSQL Databases: Key-Value Data Stores and Document Stores Nikhil Dasharath Karande 1 Department of CSE, Sanjay Ghodawat Institutes, Atigre nikhilkarande18@gmail.com Abstract- This paper
More informationarxiv: v1 [cs.db] 12 Nov 2018
The Impact of Timestamp Granularity in Optimistic Concurrency Control Yihe Huang Hao Bai Eddie Kohler Harvard University Barbara Liskov MIT Liuba Shrira Brandeis University arxiv:1811.04967v1 [cs.db] 12
More informationSTAR: Scaling Transactions through Asymmetric Replication
STAR: Scaling Transactions through Asymmetric Replication arxiv:1811.259v2 [cs.db] 2 Feb 219 ABSTRACT Yi Lu MIT CSAIL yilu@csail.mit.edu In this paper, we present STAR, a new distributed in-memory database
More informationMcRT-STM: A High Performance Software Transactional Memory System for a Multi- Core Runtime
McRT-STM: A High Performance Software Transactional Memory System for a Multi- Core Runtime B. Saha, A-R. Adl- Tabatabai, R. Hudson, C.C. Minh, B. Hertzberg PPoPP 2006 Introductory TM Sales Pitch Two legs
More informationOverview. Introduction to Transaction Management ACID. Transactions
Introduction to Transaction Management UVic C SC 370 Dr. Daniel M. German Department of Computer Science Overview What is a transaction? What properties transactions have? Why do we want to interleave
More informationThe Hekaton Memory-Optimized OLTP Engine
The Hekaton Memory-Optimized OLTP Engine Per-Ake Larson palarson@microsoft.com Mike Zwilling mikezw@microsoft.com Kevin Farlee kfarlee@microsoft.com Abstract Hekaton is a new OLTP engine optimized for
More informationCompSci 516 Database Systems
CompSci 516 Database Systems Lecture 20 NoSQL and Column Store Instructor: Sudeepa Roy Duke CS, Fall 2018 CompSci 516: Database Systems 1 Reading Material NOSQL: Scalable SQL and NoSQL Data Stores Rick
More informationTransaction Management: Concurrency Control
Transaction Management: Concurrency Control Yanlei Diao Slides Courtesy of R. Ramakrishnan and J. Gehrke DBMS Architecture Query Parser Query Rewriter Query Optimizer Query Executor Lock Manager Concurrency
More informationIntroduction to Data Management CSE 344
Introduction to Data Management CSE 344 Unit 7: Transactions Schedules Implementation Two-phase Locking (3 lectures) 1 Class Overview Unit 1: Intro Unit 2: Relational Data Models and Query Languages Unit
More informationCSE 344 MARCH 25 TH ISOLATION
CSE 344 MARCH 25 TH ISOLATION ADMINISTRIVIA HW8 Due Friday, June 1 OQ7 Due Wednesday, May 30 Course Evaluations Out tomorrow TRANSACTIONS We use database transactions everyday Bank $$$ transfers Online
More informationHardware Transactional Memory on Haswell
Hardware Transactional Memory on Haswell Viktor Leis Technische Universität München 1 / 15 Introduction transactional memory is a very elegant programming model transaction { transaction { a = a 10; c
More informationData-Oriented Transaction Execution
Data-Oriented Transaction Execution Ippokratis Pandis 1,2 ipandis@ece.cmu.edu Ryan Johnson 1,2 ryanjohn@ece.cmu.edu Nikos Hardavellas 3 nikos@northwestern.edu Anastasia Ailamaki 2,1 natassa@epfl.ch 1 Carnegie
More informationCMU SCS CMU SCS Who: What: When: Where: Why: CMU SCS
Carnegie Mellon Univ. Dept. of Computer Science 15-415/615 - DB s C. Faloutsos A. Pavlo Lecture#23: Distributed Database Systems (R&G ch. 22) Administrivia Final Exam Who: You What: R&G Chapters 15-22
More informationAnnouncements. Motivating Example. Transaction ROLLBACK. Motivating Example. CSE 444: Database Internals. Lab 2 extended until Monday
Announcements CSE 444: Database Internals Lab 2 extended until Monday Lab 2 quiz moved to Wednesday Lectures 13 Transaction Schedules HW5 extended to Friday 544M: Paper 3 due next Friday as well CSE 444
More informationC-STORE: A COLUMN- ORIENTED DBMS
C-STORE: A COLUMN- ORIENTED DBMS MIT CSAIL, Brandeis University, UMass Boston And Brown University Proceedings Of The 31st VLDB Conference, Trondheim, Norway, 2005 Presented By: Udit Panchal Timeline of
More informationA Comparison of Memory Usage and CPU Utilization in Column-Based Database Architecture vs. Row-Based Database Architecture
A Comparison of Memory Usage and CPU Utilization in Column-Based Database Architecture vs. Row-Based Database Architecture By Gaurav Sheoran 9-Dec-08 Abstract Most of the current enterprise data-warehouses
More informationTransaction Management Overview. Transactions. Concurrency in a DBMS. Chapter 16
Transaction Management Overview Chapter 16 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Transactions Concurrent execution of user programs is essential for good DBMS performance. Because
More informationVOLTDB + HP VERTICA. page
VOLTDB + HP VERTICA ARCHITECTURE FOR FAST AND BIG DATA ARCHITECTURE FOR FAST + BIG DATA FAST DATA Fast Serve Analytics BIG DATA BI Reporting Fast Operational Database Streaming Analytics Columnar Analytics
More informationTraditional RDBMS Wisdom is All Wrong -- In Three Acts. Michael Stonebraker
Traditional RDBMS Wisdom is All Wrong -- In Three Acts Michael Stonebraker The Stonebraker Says Webinar Series The first three acts: 1. Why main memory is the answer for OLTP Recording available at VoltDB.com
More informationColumn-Stores vs. Row-Stores: How Different Are They Really?
Column-Stores vs. Row-Stores: How Different Are They Really? Daniel J. Abadi, Samuel Madden and Nabil Hachem SIGMOD 2008 Presented by: Souvik Pal Subhro Bhattacharyya Department of Computer Science Indian
More informationLecture 21: Transactional Memory. Topics: consistency model recap, introduction to transactional memory
Lecture 21: Transactional Memory Topics: consistency model recap, introduction to transactional memory 1 Example Programs Initially, A = B = 0 P1 P2 A = 1 B = 1 if (B == 0) if (A == 0) critical section
More informationBirth of Optimistic Methods. On Optimistic Methods for Concurrency Control. Basic performance arg
On Optimistic Methods for Concurrency Control. Kung81: H.T. Kung, John Robinson. ACM Transactions on Database Systems (TODS), vol 6, no 2, June 1981. Birth of Optimistic Methods Lovely, complex, very concurrent
More informationTransaction Management Overview
Transaction Management Overview Chapter 16 CSE 4411: Database Management Systems 1 Transactions Concurrent execution of user programs is essential for good DBMS performance. Because disk accesses are frequent,
More informationIntro to DB CHAPTER 15 TRANSACTION MNGMNT
Intro to DB CHAPTER 15 TRANSACTION MNGMNT Chapter 15: Transactions Transaction Concept Transaction State Implementation of Atomicity and Durability Concurrent Executions Serializability Recoverability
More informationOutline. Database Tuning. Ideal Transaction. Concurrency Tuning Goals. Concurrency Tuning. Nikolaus Augsten. Lock Tuning. Unit 8 WS 2013/2014
Outline Database Tuning Nikolaus Augsten University of Salzburg Department of Computer Science Database Group 1 Unit 8 WS 2013/2014 Adapted from Database Tuning by Dennis Shasha and Philippe Bonnet. Nikolaus
More informationE-Store: Fine-Grained Elastic Partitioning for Distributed Transaction Processing Systems
E-Store: Fine-Grained Elastic Partitioning for Distributed Transaction Processing Systems Rebecca Taft, Essam Mansour, Marco Serafini, Jennie Duggan, Aaron J. Elmore, Ashraf Aboulnaga, Andrew Pavlo, Michael
More informationLecture 7: Transactional Memory Intro. Topics: introduction to transactional memory, lazy implementation
Lecture 7: Transactional Memory Intro Topics: introduction to transactional memory, lazy implementation 1 Transactions New paradigm to simplify programming instead of lock-unlock, use transaction begin-end
More informationCSE 190D Database System Implementation
CSE 190D Database System Implementation Arun Kumar Topic 6: Transaction Management Chapter 16 of Cow Book Slide ACKs: Jignesh Patel 1 Transaction Management Motivation and Basics The ACID Properties Transaction
More informationFIT: A Distributed Database Performance Tradeoff. Faleiro and Abadi CS590-BDS Thamir Qadah
FIT: A Distributed Database Performance Tradeoff Faleiro and Abadi CS590-BDS Thamir Qadah Desirable features in Distributed Databases Impossible to achieve Fairness Isolation Throughput It is impossible
More informationDatabase Management and Tuning
Database Management and Tuning Concurrency Tuning Johann Gamper Free University of Bozen-Bolzano Faculty of Computer Science IDSE Unit 8 May 10, 2012 Acknowledgements: The slides are provided by Nikolaus
More informationMDCC MULTI DATA CENTER CONSISTENCY. amplab. Tim Kraska, Gene Pang, Michael Franklin, Samuel Madden, Alan Fekete
MDCC MULTI DATA CENTER CONSISTENCY Tim Kraska, Gene Pang, Michael Franklin, Samuel Madden, Alan Fekete gpang@cs.berkeley.edu amplab MOTIVATION 2 3 June 2, 200: Rackspace power outage of approximately 0
More informationA Practical Scalable Distributed B-Tree
A Practical Scalable Distributed B-Tree CS 848 Paper Presentation Marcos K. Aguilera, Wojciech Golab, Mehul A. Shah PVLDB 08 March 8, 2010 Presenter: Evguenia (Elmi) Eflov Presentation Outline 1 Background
More informationRococo: Extract more concurrency from distributed transactions
Rococo: Extract more concurrency from distributed transactions Shuai Mu, Yang Cui, Yang Zhang, Wyatt Lloyd, Jinyang Li Tsinghua University, New York University, University of Southern California, Facebook
More informationColumn-Stores vs. Row-Stores: How Different Are They Really?
Column-Stores vs. Row-Stores: How Different Are They Really? Daniel Abadi, Samuel Madden, Nabil Hachem Presented by Guozhang Wang November 18 th, 2008 Several slides are from Daniel Abadi and Michael Stonebraker
More informationT ransaction Management 4/23/2018 1
T ransaction Management 4/23/2018 1 Air-line Reservation 10 available seats vs 15 travel agents. How do you design a robust and fair reservation system? Do not enough resources Fair policy to every body
More informationOverview of Transaction Management
Overview of Transaction Management Chapter 16 Comp 521 Files and Databases Fall 2010 1 Database Transactions A transaction is the DBMS s abstract view of a user program: a sequence of database commands;
More informationCSE 344 MARCH 9 TH TRANSACTIONS
CSE 344 MARCH 9 TH TRANSACTIONS ADMINISTRIVIA HW8 Due Monday Max Two Late days Exam Review Sunday: 5pm EEB 045 CASE STUDY: SQLITE SQLite is very simple More info: http://www.sqlite.org/atomiccommit.html
More informationAnalyzing the Impact of System Architecture on the Scalability of OLTP Engines for High-Contention Workloads
Analyzing the Impact of System Architecture on the Scalability of OLTP Engines for High-Contention Workloads Raja Appuswamy raja.appuswamy@epfl.ch Mustafa K. Iman mustafa.iman@epfl.ch Angelos C. Anadiotis
More informationConcurrency Control - Two-Phase Locking
Concurrency Control - Two-Phase Locking 1 Last time Conflict serializability Protocols to enforce it 2 Big Picture All schedules Want this as big as possible Conflict Serializable Schedules allowed by
More informationAnnouncements. Transaction. Motivating Example. Motivating Example. Transactions. CSE 444: Database Internals
Announcements CSE 444: Database Internals Lab 2 is due TODAY Lab 3 will be released tomorrow, part 1 due next Monday Lectures 13 Transaction Schedules CSE 444 - Spring 2015 1 HW4 is due on Wednesday HW3
More informationOptimistic Intra-Transaction Parallelism on Chip Multiprocessors
Optimistic Intra-Transaction Parallelism on Chip Multiprocessors Christopher B. Colohan, Anastassia Ailamaki, J. Gregory Steffan, and Todd C. Mowry School of Computer Science Carnegie Mellon University
More informationDatenbanksysteme II: Implementation of Database Systems Synchronization of Concurrent Transactions
Datenbanksysteme II: Implementation of Database Systems Synchronization of Concurrent Transactions Material von Prof. Johann Christoph Freytag Prof. Kai-Uwe Sattler Prof. Alfons Kemper, Dr. Eickler Prof.
More informationColumn Stores vs. Row Stores How Different Are They Really?
Column Stores vs. Row Stores How Different Are They Really? Daniel J. Abadi (Yale) Samuel R. Madden (MIT) Nabil Hachem (AvantGarde) Presented By : Kanika Nagpal OUTLINE Introduction Motivation Background
More informationConcurrency control CS 417. Distributed Systems CS 417
Concurrency control CS 417 Distributed Systems CS 417 1 Schedules Transactions must have scheduled so that data is serially equivalent Use mutual exclusion to ensure that only one transaction executes
More informationATOMIC COMMITMENT Or: How to Implement Distributed Transactions in Sharded Databases
ATOMIC COMMITMENT Or: How to Implement Distributed Transactions in Sharded Databases We talked about transactions and how to implement them in a single-node database. We ll now start looking into how to
More informationdata systems 101 prof. Stratos Idreos class 2
class 2 data systems 101 prof. Stratos Idreos HTTP://DASLAB.SEAS.HARVARD.EDU/CLASSES/CS265/ 2 classes per week - OH/Labs every day 1 presentation/discussion lead - 2 reviews each week research (or systems)
More informationDatabase Systems CSE 414
Database Systems CSE 414 Lecture 27: Transaction Implementations 1 Announcements Final exam will be on Dec. 14 (next Thursday) 14:30-16:20 in class Note the time difference, the exam will last ~2 hours
More informationOn Transactional Memory, Spinlocks, and Database Transactions
On Transactional Memory, Spinlocks, and Database Transactions Khai Q. Tran University of Wisconsin Madison W. Dayton Madison, WI, 576 khaitran@cs.wisc.edu Spyros Blanas University of Wisconsin Madison
More informationCOLUMN-STORES VS. ROW-STORES: HOW DIFFERENT ARE THEY REALLY? DANIEL J. ABADI (YALE) SAMUEL R. MADDEN (MIT) NABIL HACHEM (AVANTGARDE)
COLUMN-STORES VS. ROW-STORES: HOW DIFFERENT ARE THEY REALLY? DANIEL J. ABADI (YALE) SAMUEL R. MADDEN (MIT) NABIL HACHEM (AVANTGARDE) PRESENTATION BY PRANAV GOEL Introduction On analytical workloads, Column
More informationAdministration Naive DBMS CMPT 454 Topics. John Edgar 2
Administration Naive DBMS CMPT 454 Topics John Edgar 2 http://www.cs.sfu.ca/coursecentral/454/johnwill/ John Edgar 4 Assignments 25% Midterm exam in class 20% Final exam 55% John Edgar 5 A database stores
More informationIntroduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lecture 22: More Transaction Implementations 1 Review: Schedules, schedules, schedules The DBMS scheduler determines the order of operations from txns are executed
More informationMY WEAK CONSISTENCY IS STRONG WHEN BAD THINGS DO NOT COME IN THREES ZECHAO SHANG JEFFREY XU YU
MY WEAK CONSISTENCY IS STRONG WHEN BAD THINGS DO NOT COME IN THREES ZECHAO SHANG JEFFREY XU YU DISCLAIMER: NOT AN OLTP TALK HOW TO GET ALMOST EVERYTHING FOR NOTHING SHARED-MEMORY SYSTEM IS BACK shared
More informationEnhancing Concurrency in Distributed Transactional Memory through Commutativity
Enhancing Concurrency in Distributed Transactional Memory through Commutativity Junwhan Kim, Roberto Palmieri, Binoy Ravindran Virginia Tech USA Lock-based concurrency control has serious drawbacks Coarse
More informationOutline EEL 5764 Graduate Computer Architecture. Chapter 3 Limits to ILP and Simultaneous Multithreading. Overcoming Limits - What do we need??
Outline EEL 7 Graduate Computer Architecture Chapter 3 Limits to ILP and Simultaneous Multithreading! Limits to ILP! Thread Level Parallelism! Multithreading! Simultaneous Multithreading Ann Gordon-Ross
More informationOLTP on Hardware Islands
OLTP on Hardware Islands Danica Porobic Ippokratis Pandis Miguel Branco Pınar Tözün Anastasia Ailamaki École Polytechnique Fédérale de Lausanne Lausanne, VD, Switzerland {danica.porobic, miguel.branco,
More informationCSE 444: Database Internals. Section 9: 2-Phase Commit and Replication
CSE 444: Database Internals Section 9: 2-Phase Commit and Replication 1 Today 2-Phase Commit Replication 2 Two-Phase Commit Protocol (2PC) One coordinator and many subordinates Phase 1: Prepare Phase 2:
More informationDistributed Systems. Day 13: Distributed Transaction. To Be or Not to Be Distributed.. Transactions
Distributed Systems Day 13: Distributed Transaction To Be or Not to Be Distributed.. Transactions Summary Background on Transactions ACID Semantics Distribute Transactions Terminology: Transaction manager,,
More informationIncrementally Parallelizing. Twofold Speedup on a Quad-Core. Thread-Level Speculation. A Case Study with BerkeleyDB. What Am I Working on Now?
Incrementally Parallelizing Database Transactions with Thread-Level Speculation Todd C. Mowry Carnegie Mellon University (in collaboration with Chris Colohan, J. Gregory Steffan, and Anastasia Ailamaki)
More informationCOURSE 1. Database Management Systems
COURSE 1 Database Management Systems Assessment / Other Details Final grade 50% - laboratory activity / practical test 50% - written exam Course details (bibliography, course slides, seminars, lab descriptions
More informationData Modeling and Databases Ch 14: Data Replication. Gustavo Alonso, Ce Zhang Systems Group Department of Computer Science ETH Zürich
Data Modeling and Databases Ch 14: Data Replication Gustavo Alonso, Ce Zhang Systems Group Department of Computer Science ETH Zürich Database Replication What is database replication The advantages of
More informationTransactional Memory
Transactional Memory Architectural Support for Practical Parallel Programming The TCC Research Group Computer Systems Lab Stanford University http://tcc.stanford.edu TCC Overview - January 2007 The Era
More informationHardware-Based Speculation
Hardware-Based Speculation Execute instructions along predicted execution paths but only commit the results if prediction was correct Instruction commit: allowing an instruction to update the register
More informationCSE 444: Database Internals. Lectures Transactions
CSE 444: Database Internals Lectures 13-14 Transactions CSE 444 - Spring 2014 1 Announcements Lab 2 is due TODAY Lab 3 will be released today, part 1 due next Monday HW4 is due on Wednesday HW3 will be
More informationTopics in Reliable Distributed Systems
Topics in Reliable Distributed Systems 049017 1 T R A N S A C T I O N S Y S T E M S What is A Database? Organized collection of data typically persistent organization models: relational, object-based,
More informationGoldibear and the 3 Locks. Programming With Locks Is Tricky. More Lock Madness. And To Make It Worse. Transactional Memory: The Big Idea
Programming With Locks s Tricky Multicore processors are the way of the foreseeable future thread-level parallelism anointed as parallelism model of choice Just one problem Writing lock-based multi-threaded
More informationConcurrency Control & Recovery
Transaction Management Overview R & G Chapter 18 There are three side effects of acid. Enchanced long term memory, decreased short term memory, and I forget the third. - Timothy Leary Concurrency Control
More information) Intel)(TX)memory):) Transac'onal) Synchroniza'on) Extensions)(TSX))) Transac'ons)
) Intel)(TX)memory):) Transac'onal) Synchroniza'on) Extensions)(TSX))) Transac'ons) Goal A Distributed Transaction We want a transaction that involves multiple nodes Review of transactions and their properties
More informationCSC 261/461 Database Systems Lecture 20. Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101
CSC 261/461 Database Systems Lecture 20 Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101 Announcements Project 1 Milestone 3: Due tonight Project 2 Part 2 (Optional): Due on: 04/08 Project 3
More informationStephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, Samuel Madden Presenter : Akshada Kulkarni Acknowledgement : Author s slides are used with
Stephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, Samuel Madden Presenter : Akshada Kulkarni Acknowledgement : Author s slides are used with some additions/ modifications 1 Introduction Design Evaluation
More informationLeveraging Lock Contention to Improve Transaction Applications. University of Washington
Leveraging Lock Contention to Improve Transaction Applications Cong Yan Alvin Cheung University of Washington Background Pessimistic locking-based CC protocols Poor performance under high data contention
More informationAn Aggressive Concurrency Control Protocol for Main Memory Databases
An Aggressive Concurrency Control Protocol for Main Memory Databases Mohammed Hamdi Department of Computer Science Sarah Alswedani Department of Computer Science Weidong Xiong Department of Computer Science
More informationTransaction Management and Concurrency Control. Chapter 16, 17
Transaction Management and Concurrency Control Chapter 16, 17 Instructor: Vladimir Zadorozhny vladimir@sis.pitt.edu Information Science Program School of Information Sciences, University of Pittsburgh
More informationMobile and Heterogeneous databases Distributed Database System Transaction Management. A.R. Hurson Computer Science Missouri Science & Technology
Mobile and Heterogeneous databases Distributed Database System Transaction Management A.R. Hurson Computer Science Missouri Science & Technology 1 Distributed Database System Note, this unit will be covered
More informationMulti-core Architecture and Programming
Multi-core Architecture and Programming Yang Quansheng( 杨全胜 ) http://www.njyangqs.com School of Computer Science & Engineering 1 http://www.njyangqs.com Process, threads and Parallel Programming Content
More informationDatabase Systems CSE 414
Database Systems CSE 414 Lecture 22: Transaction Implementations CSE 414 - Spring 2017 1 Announcements WQ7 (last!) due on Sunday HW7: due on Wed, May 24 using JDBC to execute SQL from Java using SQL Server
More information