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(…)