Kalen Delaney
Kalen Delaney has been working with SQL Server for over 32 years, providing advanced SQL Server training to clients around the world. She was a SQL Server MVP for 25 years, since 1993, until starting to work for Microsoft. She has been writing about SQL Server almost as long as she has been using it. Kalen has spoken at dozens of technical conferences, including every PASS conference in the US and multiple TechEd events in both the US and Europe. Kalen is the author or co-author of many books on SQL Server, the most recent being SQL Server 2016 Internals: In-memory OLTP, from Red Gate.
Kalen Delaney's Training Days
Faster Queries Without NOLOCK!SQLBits 2019
Look at the ways SQL Server manages multiple users, and avoid blocking!
Locking, Blocking, Row Versions: Concurrency for PerformanceSQLBits 2017
Look at the ways SQL Server manages multiple users, and avoid blocking!
SQL Server Query Plans --- Reuse or Recompile?SQLBits 2016
In this seminar, we’ll discuss how SQL Server decides whether to recompile or reuse an existing plan, and how you can tell if that’s a good choice. We’ll also look at how you can ‘encourage’ SQL Server to do what you want it to do.
Index Magic: Rowstore, Columnstore and NoStoreSQLBits 2015
Indexes allow SQL Server to access your data in the most efficient manner and improve performance by orders of magnitude. This seminar looks at 3 kinds of index structures: B-Tree indexes, columnstore indexes, and indexes used for in-memory tables.
Index Magic: Rowstore, Columnstore and NoStoreSQLBits 2015
Indexes allow SQL Server to access your data in the most efficient manner and improve performance by orders of magnitude. This seminar looks at 3 kinds of index structures: B-Tree indexes, columnstore indexes, and indexes used for in-memory tables.
Index Magic: Rowstore, Columnstore and NoStoreSQLBits 2015
Indexes allow SQL Server to access your data in the most efficient manner and improve performance by orders of magnitude. This seminar looks at 3 kinds of index structures: B-Tree indexes, columnstore indexes, and indexes used for in-memory tables.
Index Magic: Rowstore, Columnstore and NoStoreSQLBits 2015
Indexes allow SQL Server to access your data in the most efficient manner and improve performance by orders of magnitude. This seminar looks at 3 kinds of index structures: B-Tree indexes, columnstore indexes, and indexes used for in-memory tables.
Index Magic: Rowstore, Columnstore and NoStoreSQLBits 2015
Indexes allow SQL Server to access your data in the most efficient manner and improve performance by orders of magnitude. This seminar looks at 3 kinds of index structures: B-Tree indexes, columnstore indexes, and indexes used for in-memory tables.
Index Magic: Rowstore, Columnstore and NoStoreSQLBits 2015
Indexes allow SQL Server to access your data in the most efficient manner and improve performance by orders of magnitude. This seminar looks at 3 kinds of index structures: B-Tree indexes, columnstore indexes, and indexes used for in-memory tables.
Performance Tuning with Indexes: Internals and Best PracticeSQLBits 2013
Indexes allow SQL Server to access your data in the most efficient manner and can improve performance by orders of magnitude. This seminar looks at index storage internals as well as best practices, so you can create the best indexes for your data.
Kalen Delaney's Sessions
Behind the Query Store…SQLBits 2019
Look inside Query Store to see what it does and how it works
Exploring Statistics: Where estimated rowcount comes fromSQLBits 2017
A look inside SQL Server distribution statistics
What Happened? Exploring the Plan CacheSQLBits 2015
In this session, we'll explore SQL Server's plan cache, including techniques for discovering what plans are in cache, how often they've been run, and whether they contain any sub-optimal operators. Knowing what's happened is the first step in tuning.
Seeking SQL Server SecretsSQLBits 2013
In this session, I’ll tell you about some of my favorite undocumented features, and also tell you some of my tricks for discovering more undocumented secrets.