Extreme Transaction Processing (XTP)

How Hekaton (XTP) achieves Durability for “Memory Optimised” Tables 2

“Memory Optimised” tables reside entirely in memory, the operations INSERT, UPDATE and DELETE as well as SELECT are all significantly quicker, but just how is it possible to achieve durability with memory optimised tables while still achieving the significantly higher throughput? Like traditional on-storage tables durability is achieved once the data has been written and hardened off(…)

Changing In-Memory Table definition without down time 4

One of the restrictions of a “memory optimised” table is that you cannot modify its definition once created. You may find that once your table has been in use for a period of time it may be apparent you don’t need one of the Hash indexes for example, or perhaps you made a hash (pardon the(…)

SQL Server Hekaton (XTP) in-memory tables: Choosing the correct BUCKET_COUNT for a Hash Index 2

In this post I cover off how to choose the correct number for the BUCKET_COUNT and how you go about that, also, how to monitor and change the bucket_count. The general approach is that you set the BUCKET_COUNT to the number of unique values there will be given just the columns on your hash index (see(…)

SQL Server Hekaton (XTP) in-memory Tables: Range Indexes and Row Chains 2

Hash and Range indexes both involve row chains, if you haven’t already read my post on Understanding the row chains of Hash Indexes I’d suggest you do before continuing with this post which essentially is a continuation of it and assumes you know the basics of row chains already. A range index is implemented using the(…)