Thank you for hanging in there with me today Dear Reader and as always Thanks for stopping by.
9:50 am We are looking at the Post Processing Phase. there are 3 sub-phases. 1 generate log record containing all new version of rows, Primary key of all deleted rows 2. force log records as a single */) to sql server log 3. For all rows in transactions write set apply end timestamp.
Check points and recovery. Holds data for memory optimized tables during shutdowns. design goals wher incremental non blocking and parallel
restart recovery starts by loading a known checkpoint.
Query Execution is next. Interpretation.
In Hekaton you have two options. Regular T-SQL Queries. T-SQL can access all three query engines.
In Hekaton you can make a natively compiled stored proc which will make a compiled DLL that works at the machine level and is much more efficient with CPU.
We get an example of a regular query against regular OLTP tables. We review Interpreted Plan Execution. We are charged for the generic capabilities of the regular T-SQL optimizer parsing.
Native Plan generation. The initial steps are the same Parse, semantics analysis, query optimization. Physical plans are different. We get a physical plan, go through a translator. It is compiled to C code to the C compiler at the DLL. Ugly Ugly coed. Totally specific for the query, no function calls within the DLL.
The DLL is then loaded and Invoked.
We get a nice table with 3 columns one for a Classic/Non Hekaton Table. Hekaton Table using Interop for T-SQL, then Hekaton with a Natively compiled proc.
row matching query
Classic 700 Instructions
Hekaton/interop 332 Instructions
Hekaton/Native 75 instructions
non-row matching query
Classic 300 Instructions
Hekaton/interop 110 Instructions
Hekaton/Native 30 instructions
9:40 am We get to see a transaction flow of Locking vs. Optimistic. Serialization using variables Xa and Xb. Good stuff and we are getting deep.
Now that we've covered Concurrency, what about all the old versions? Do we get a lot of junk stored memory. Hekaton garbage collector is non-blocking, cooperative, incremental, parallel, self-throttling and has minimal impact on performance.
We are starting the wrap up.
9:30 am Rows are allocated space form SQL's heap storage. All rows in a table are organized on Hash or range keys. We are getting an example showing how the row is updated. The Beginning timestamp is the end of the transaction that replaces it. The End will be when the record is changed.
create a new version of the row
step 2 store it's identifier in the End TS and in the Beginning of the new time stamp. If the End timestamp is later validated. When validation occurs the delta end timestamp receives is final value at the moment of commit.
We call this timestamp and version. No Latches is required.
two concurrent transactions. We get our delta record from the previous example. We get a concurrent read operation.
Things still occur in a dirty yet concurrent fashion based on the last committed timestamp.
9:20 am We get a nice view of SQL Server vs. Hekaton. Lock Free vs. Latching in order to get this it truly is rocket science. It was invented by Maurice Herlihy at Brown University. When you hear Lock Free, it's important to realize version control gives us the ability to operate Latch Free.
Nice demo of Latch vs. Latch
Optimisitc Concurrency will allow transactions to run and perform validation for conflict detection after the transaction runs. Multirow version allows for multiple records to be gathered for updates. Timestamps are placed on each row to create a total order for transactions to obtain equivalent datasets.
Transaction Phases in Hekaton. Begin, Normal processing, Pre-Commit, Validation (this is where transaction concurrency occurs), Commit, Post-Processing, Terminate.
Each transaction has a Begin timestamp and they receive and End timestamp. Each transaction will get a unique timestamp. If you think back to the two phase locking demo, we need to get total order which is equivalent to serial order. Using this method you can achieve a much lighter weight locking without latches.
We get a nice example on hash tables for tree utilization and table storage.
9:10 am We are now looking at a locking example for our two queries. we look at the serial manner that locking and blocking occur. Setting a lock requires setting several latches. Remember we get locking, blocking, and CPU. Eventually we also need a mechanism for Deadlock detection and resolution.
Hekaton get's rid of all of this. It's not something that was just made up it was a 5 year effort.
B-Tree's are expensive to interprete when they are on disk. Putting them in main memory is inexpensive.
Hekaton introduces Lock-free data structures. (We'll get to that). We use Optimistic Multiversion optimistic concurrency control. That's a mouthful. Also we can compile queries and compile them into DLL's as natively compiled stored procs.
We get a nice view of SQL Server 2014. We have another query engine specifically for Column Store Indexes. For 2014 we got a THIRD engine for Hekaton. Hekaton spans all three engines.
There will be some limitations in V1, Drastic improvements are coming.
Hekaton can have Durable and Non-Durable tables that are stored in memory. Indexes are either Hash or Range. We get a new type of tree called a D-Tree. Schema limitations. No Blob's, no XML but they will clean that up.
Populating a Hekaton table requires the exact size of the table to be reserved in memory. You've got to plan for this. You will get a minimum of 3x for Performance Boost by Hekaton. x5 to x30 for Natively compiled stored procs.
9:00 am Dr. DeWitt doesn't trash competitors with marketing slogans. He does it with knowledge. That is much more powerful than a catchy slogan.
He's walking us through the implications of a shared buffer pool. He is giving us details of why Latches were introduced into SQL Server for the buffer pool.
He's talking about how Latches are put on Frames within the Buffer Pool to make sure that meta data over writes do not occur. Latches are great for Data Integrity, terrible for performance. They cause Spinlocks, utilize a lot of CPU, and slow things down.
Reason #2 for a new Query Processor? Concurrency Control.
The complexity of this information and the ease at which he presents is remarkable. This is why DeWitt is so sought after as a speaaker.
We are looking at two transactions one doing 100 actions another doing 500 actions.
He shows how the separate transactions can cause dirty reads.
He is speaking about Jim Gray and the two phased locking mechanism in SQL Server using exclusive and shared locking. Before access a query must acquire "appropriate" lock type form the Lock Manager, and once a query releases a lock, no further locks can be acquired. If the rules are followed the resulting schedule of actions is equivalent to some serial (good) schedules for actions.
8:50 am The Microsoft appreciation party is tonight and Tom is giving out the details of how to get there.
Tom Introduces Dr David DeWitt who is a technical fellow at teh Jim Gray Lab for Microsoft.
Dr DeWitt takes the stage!
Dr. DeWitt acknowledges his co-author. He's got a lot of funny animations to start off. This is streaming live and if you arent' watching it should be posted on the PASS Summit later. This Dear Reader will be well worth a watch.
He tells us how he picked this talk. He compares Hekaton to a rocket ship for OLTP databases.
Hekaton is Memory-Optimized but durable. Very high performance OLTP Engine. Fully integrated into SQL server 2014 ad completely architected for modern CPUs.
The Deck is already posted and Dr. DeWitt tells us to go get them. Oh and VOTE for #Hekaton to be the name on twitter!!
A new Query engine was introduced in SQL 2014, why? Historically OLTP performance improvements were the result of CPU Performance doubling every 2 years. CPU's are not doubling anymore and we've got to find increases. That well is running dry.
How did they choose the name Hekaton? They wanted 100K improvement. Hekaton is a mythical creature with 100 Heads and 100 arms. They don't get 100K, but they do get around 30 x.
In order to make things go faster you need to reduce the instruction set for the CPU.
8:40 am Bill Graziano is now out, he's thanking Douglas for his 6 years of hard work on the Board. Rob Farley also get's a nice honorable mention for his hard work. Rushabh Mehta is on stage. Rushabh is the immediate PASS president. He has been on the Board or working on the Executive committee for PASS.
Thomas Larock, the one and only SQLRockstar the new incoming PASS President takes the stage. He introduces the new board members and Executive committee for the next year.
Tom great's us with hashtags. Next Year's PASS Summit will be November 4th - 7th back in Seattle next year.
8:30 am Douglas McDowell is up on stage doing the recap of finances for the year. PASS holds the financial meeting because we don't travel just for a budgetary process, since they are a non profit and we are all members, they give us a transparent look at the funds.
PASS has done well this year, the majority of the funds that sustain us through the year come from the PASS Summit.
Last year PASS spent $7.6 MILLION DOLLARS, que the picture of Dr Evil. 30% of the money spent was focused on international growth and chapters.
In short PASS is in good financial state.
Hello Dear Reader! Getting ready for the Day 2 Keynote for the 2013 PASS Summit. Just a quick reminder the way it works is head down to the bottom and read from the beginning. And away we go!