Optimizing Temporal Queries

Having a SQL Server solution for a problem does not mean the job is done. Of course, the next immediate issue is the performance. Temporal queries that involve intervals are typically very IO and CPU intensive. For example, a test for overlapping intervals was solved with inefficient queries for years. However, a handful of solutions with fast queries was developed lately. This high-level technical session introduces five different methods to get efficient queries that search for overlapping intervals. Of course, these solutions can be implemented on other temporal problems as well. Actually, the test for overlapping intervals is one of the most complex temporal problems.
Presented by Dejan Sarka at SQLBits XII
Tags (no tags)
  • Downloads
    Slide deck available Slide deck 474 KB
    Video available MP4 Video HD 578 MB
  • SpeakerBIO

    Dejan Sarka, MCT and SQL Server MVP, is an independent trainer and consultant that focuses on development of database & business intelligence applications.  Besides projects, he spends about half of the time on training and mentoring. He is the founder of the Slovenian SQL Server and .NET Users Group. Dejan Sarka is the main author or coauthor of thirteen books about databases and SQL Server. Dejan Sarka also developed many courses and seminars for Microsoft, SolidQ and Pluralsight.

    http://sqlblog.com/blogs/dejan_sarka/default.aspx http://sqlblog.com/blogs/dejan_sarka/rss.aspx
  • Video