We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byCaitlyn Heacox
Modified about 1 year ago
HANA database lectures March 2014
©2013 SAP AG or an SAP affiliate company. All rights reserved.2 Outline Part 1 Motivation - Why main memory processing What is main memory computing SAP HANA overview Architecture Usage ( SQL, Hana studio) Main memory Column Store Row vs column store Data model Basic operations ( C ++- scan, AVX/SSSE scan) Compression ( references, dictionary, index) Distribution Scale out vs scale up Data split Parallelization
©2013 SAP AG or an SAP affiliate company. All rights reserved.3 Outline Part 2 The insert/update problem : Delta table data model Data access ( insert only) / cost model Data visibility L2D – the state of the art approach for a delta table L1D - discussions Transaction managememt UDIV handling MVCC Tx lists Central operators Joins ( i.e. semi join reducer) Parallel aggregation Sort
©2013 SAP AG or an SAP affiliate company. All rights reserved.4 Outline Part 3 Transactional memory Distributed transactions Optimizer and query execution Execution plans Plan generation Execution engine Optimizer models SQL versions ( SQL 92, 99 …) Persistency & delta Mapping from main memory structures to persistency pages ( PAX) Logging Shadow page concept Text extensions Text data model & operations
©2013 SAP AG or an SAP affiliate company. All rights reserved.5 Two phase locking – definition The basic two-phase locking (2PL) protocol A transaction T must hold a lock on an item x in the appropriate mode before T accesses x. If a conflicting lock on x is being held by another transaction, T waits. Once T releases a lock, it cannot obtain any other lock subsequently. Note: a transaction is divided into two phases: A growing phase (obtaining locks) A shrinking phase (releasing locks) Claim : 2PL ensures conflict serializability
©2013 SAP AG or an SAP affiliate company. All rights reserved.6 Transactions Two-Phase Locking : Abbreviated as 2PL Two lock modes: S (shared, read lock) X (exclusive, write lock) compatibility matrix: NoneSX SOk - Xok-- Held locks Acquired locks
©2013 SAP AG or an SAP affiliate company. All rights reserved.7 2-phase locking -- example 1.S-lock(X) 2.A1 <- Read(X) 3.A1 <- A1 – k 4.X-lock(X) 5.Write(X, A1) 6.S-lock(Y) 7.A2 <- Read(Y) 8.A2 <- A2 + k 9.X-lock(Y) 10.Write(Y, A2) 11.Unlock(X) 12.Unlock(Y) 1.S-lock(X) 1.S-lock(X) 2.A1 <- Read(X) 3.A1 <- A1* X-lock(X) 5.Write(X, A1) 6.S-lock(Y) 7.A2 <- Read(Y) 8.A2 <- A2 * X-lock(Y) 10.Write(Y, A2) 11.Unlock(Y) 12.Unlock(X ) T1 T2 T2 waits Lock point for T1 Lock point for T2
Transactional memory TX paper Intel presentation TUM presentation Self tuning TSXpaperpresentation Self tuning TSX
Efficient Transaction Processing in SAP HANA Database – The End of a Column Store Myth - Vishal Sikka, Franz Farber, Wolfgang Lehner, Sang Kyun Cha, Thomas.
Session - 13 CONCURRENCY CONTROL CONCURRENCY TECHNIQUE Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
Concurrency Control in Database Operating Systems.
Module Coordinator Tan Szu Tak School of Information and Communication Technology, Politeknik Brunei Semester
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
3 Database Systems: Design, Implementation, and Management CHAPTER 9 Transaction Management and Concurrency Control.
1 Concurrency Control II: Locking and Isolation Levels.
CM20145 Concurrency Control Dr Alwyn Barry Dr Joanna Bryson.
Database System Concepts 5 th Ed. © Silberschatz, Korth and Sudarshan, 2005 See for conditions on re-usewww.db-book.com Chapter 16 : Concurrency.
CSIS 7102 Spring 2004 Lecture 5 : Non-locking based concurrency control (and some more lock-based ones, too) Dr. King-Ip Lin.
1 ICS 214B: Transaction Processing and Distributed Data Management Lecture 2: Enforcing Serializable Schedules Professor Chen Li.
Oracle Locking Michael Messina Principal Database Analyst Indiana University.
V. Megalooikonomou Concurrency control (based on slides by C. Faloutsos at CMU and on notes by Silberchatz,Korth, and Sudarshan) Temple University – CIS.
1 Database Systems ( 資料庫系統 ) December 24/26, 2007 Lecture 13.
Chapter 9 Overview Reasons to monitor SQL Server Performance Monitoring and Tuning Tools for Monitoring SQL Server Common Monitoring and Tuning.
Unit 7 Indexes and Views. Key Concepts Index structure Clustered vs. non-clustered indexes Query optimization Creating indexes Selecting index columns.
Concurrency Control Enforcing Serializability by Locks Krishna Nitin Tenali.
1 Concurrency Control. 2 Why Have Concurrent Processes? v Better transaction throughput, response time v Done via better utilization of resources: –While.
Recovery & Concurrency Control. What is a Transaction? A transaction is a logical unit of work that must be either entirely completed or aborted.
Carnegie Mellon Carnegie Mellon Univ. Dept. of Computer Science Database Applications C. Faloutsos Concurrency control.
Concurrency Control and Recovery In real life: users access the database concurrently, and systems crash. Concurrent access to the database also improves.
Bigtable: A Distributed Storage System for Structured Data Ido Hakimi.
Principles of Transaction Management. Outline Transaction concepts & protocols Performance impact of concurrency control Performance tuning.
BigTable CSE 490h, Autumn What is BigTable? z “A BigTable is a sparse, distributed, persistent multidimensional sorted map. The map is indexed by.
Concurrency Control By Donavon Norwood Ankit Patel Aniket Mulye 1.
1 Concurrency Control. 2 Transactions A transaction is a list of actions. The actions are reads (written R T (O)) and writes (written W T (O)) of database.
All of ERD (Ch 3) plus: – Class/subclass relationships – Inheritance – Specialization – Generalization – Category.
CSC271 Database Systems Lecture # 32. Summary: Previous Lecture Database security Countermeasure: computer-based controls DBMSs and web security.
1 Lecture 11: Transactions: Concurrency. 2 Overview Transactions Concurrency Control Locking Transactions in SQL.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 10 Transaction Management.
1 Concurrency Control By Ankit Patel. 2 INTRODUCTION Enforcing serializability by locks Locks Locking scheduler Two phase locking Locking systems with.
Prepared by: Mudra Patel (113) Locking Scheduler & Managing Hierarchies of Database Elements.
9 Chapter 9 Transaction Management and Concurrency Control Hachim Haddouti.
Cs4432concurrency control1 CS4432: Database Systems II Lecture #22 Concurrency Control: Locking-based Protocols Professor Elke A. Rundensteiner.
Concurrency Control Part 2 R&G - Chapter 17 The sequel was far better than the original! -- Nobody.
Granularity of Locks and Degrees of Consistency in a Shared Data Base John LaFontaine Haixuan Sun.
Transaction Management: Concurrency Control CS634 Class 17, Apr 7, 2014 Slides based on “Database Management Systems” 3 rd ed, Ramakrishnan and Gehrke.
9 Chapter 7 Transaction Management and Concurrency Control.
1 Concurrency Control Lecture 22 Ramakrishnan - Chapter 19.
1 Advanced Database Concepts Transaction Management and Concurrency Control.
Concurrency Control. General Overview Relational model - SQL Formal & commercial query languages Functional Dependencies Normalization Transaction Processing.
1 Transaction Management Overview Yanlei Diao UMass Amherst March 15, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
9 Chapter 9 Transaction Management and Concurrency Control Database Systems: Design, Implementation, and Management, Fifth Edition, Rob and Coronel.
1 Supplemental Notes: Practical Aspects of Transactions THIS MATERIAL IS OPTIONAL.
Page 1 Concurrency Control Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.
Lecture 14- Parallel Databases Advanced Databases Masood Niazi Torshiz Islamic Azad University- Mashhad Branch
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Election algorithms –Bully algorithm –Ring algorithm Distributed.
© 2017 SlidePlayer.com Inc. All rights reserved.