1. 100 200 Introducing Hekaton The next step in SQL Server OLTP performance Mladen Prajdić Email:mladenp@gmail.com Twitter:@MladenPrajdic

2. 100 200 About me

3. 100 200 First, a little history  SQL Server 7.0  Sybase origins  Completely rewritten storage engine  New locking mechanism  Data page from 2k to 8k  Dynamic memory and file management

4. 100 200 First, a little history  SQL Server 2000  First 64bit version  Multiple instances on single machine  Materialized views and computed columns  Proper clustering  UDFs  performance problems -> awesome for consultants  XML  Instead Of triggers -> updateable views

5. 100 200 First, a little history  SQL Server 2005  5 years  DMV’s and DMF’s  New snapshot transaction isolation levels  Service Broker  The basis for DB mirroring and Always ON  DDL triggers  CLR and XML integration  T-SQL improvements

6. 100 200 First, a little history  SQL Server 2008 & 2008R2  New data types  Spatial, Hierarchy, Date, Time, DateTime2, …  Table Valued Parameters  Filestream  Resource governor  CDC & CT  Merge statement  Compression

7. 100 200 First, a little history  SQL Server 2012  Always ON  Contained Databases  T-SQL enhancements  Full Text Semantic Search  Changed licensing   In memory technologies (xVelocity)  ColumnStore, Vertipaq, StreamInsight

8. 100 200 SQL Server vNext HEKATON

9. 100 200 HEKATON  Hekaton = Greek for 100x  In-Memory OLTP  Built directly into DB engine  High performance  Fully ACID  RDBMS are optimized for disk IO, SSDs help  CPU clock frequency flattened -> multicore  But… Memory started becoming cheap

10. 100 200 HEKATON Computing power holds Moore Law due to parallelism CPU clock frequency stalled Memory has gotten a LOT cheaper

11. 100 200 HEKATON - IO  No locks, latches, spinlocks or lock manager  No data pages or B-trees, row based  Stream based, no random IO  WAL guarantees ACID  T-Log records are much, much smaller

12. 100 200 HEKATON - CPU & Memory  Separate from the SQL Server buffer pool  User settable, part of MAX server memory  No more memory it fails the operation  Scales linearly with the number of CPUs  Everything is done to minimize CPU cycles

13. 100 200 HEKATON – T-SQL  Stored procedures compile to C, then to machine code  Bypasses the whole execution part in the engine  Not everything is supported  Calling a stored procedure is just a DLL entry point  Nothing radically new to learn

14. 100 200 HEKATON – Data Structures  Lock free algorithms  Type of MVCC  Not in tempdb  Fully supported for HA, Backups, Log Shipping, etc  Durable and non durable tables  Data lost on restarts, schema fixed  Special filegroup, it’s filestream based  Tables must be migrated to the Hekaton filegroup

15. 100 200 HEKATON – Data Structures  Bw-Tree index  Lock free b-tree index  Not a skip list  Demonstrated by MS research two years ago  Works on delta tables  For more details there’s a research paper on it

16. 100 200 HEKATON – Coding scenarios: Transaction/Sec Normal stored procedure and table Normal stored procedure and Hekaton table Hekaton stored procedure and table

17. 100 200 HEKATON – Coding scenarios: CPU Normal stored procedure and table Normal stored procedure and Hekaton table Hekaton stored procedure and table

18. 100 200 QUESTIONS After the session please fill out the questionnaire. Questionnaires will be sent to you by e-mail and will be available in the profile section of the NT Conference website www.ntk.si.www.ntk.si Thank you! ?