Speaker: Kalen Delaney
SQL Server’s memory-optimized tables support two new kinds of indexes: hash and range. How are these indexes different than the B-tree indexes on your disk-based tables and how do they help in-memory OLTP achieve such blazing-fast performance?
• Understand the internal structure of hash and range indexes
• Discuss the pros, cons, and best practices for both types of indexes
• Examine the metadata that shows how the index on memory-optimized tables are being used.