1 / 23

Data Warehousing Features in SQL Server 2008

Data Warehousing Features in SQL Server 2008. James Rowland-Jones @ jrowlandjones. Official DW Feature Set in SQL 2008. JRJ’s DW Feature Set in SQL 2008. What We’ll Focus On. Data Compression. Enterprise Edition Only Row and Page Compression

bridgit-kearney
Télécharger la présentation

Data Warehousing Features in SQL Server 2008

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data Warehousing Features in SQL Server 2008 James Rowland-Jones @jrowlandjones

  2. Official DW Feature Set in SQL 2008

  3. JRJ’s DW Feature Set in SQL 2008

  4. What We’ll Focus On

  5. Data Compression • Enterprise Edition Only • Row and Page Compression • Compression Ratio 2 to 1 or 3 to 1 - 50% to 70% reduction in data • Can be for a table, index or a subset of their partitions • Estimate savings: exec sp_estimate_data_compression_savings • Max row size plus compression overhead must not exceed 8060 bytes

  6. Compression Alert UNCOMPRESSED TEXT Compressed Table

  7. Monitoring Compression • SQL Server, Access Methods Object • Page compression attempts/sec • Pages compressed/sec • Compression Statistics for individual Partitions • Dynamic Management Function • sys.dm_db_index_operational_stats

  8. Resource Governor (Quickly) Data Compression DEMO TIME

  9. P & P Partitioning Parallelism

  10. Partitioning & Parallelism • Partition Table Parallelism • Few Outer Rows Parallelism • Partition-Aligned Indexed Views • SQL 2005 behaviour – needs to be dropped before switch • Switch Partition Pulls across indexed view • Rebuild index partition

  11. What is a Partitioned Table? P1 P2 P3 P4

  12. The “Problem” in SQL 2005

  13. Partitioning & Parallelism Compared SQL Server 2005 P1 P2 P3 P4 P2 SQL Server 2008 P1 P2 P3 P4 P2

  14. Work Around for SQL Server 2005 Partition 3 • UNION Partition 4

  15. Few Outer Rows Parallelism SELECT d.Date_Desc ,SUM(f.Sale_Amt*f.Sales_Qty) FROM Tbl_Fact_Store_Sales f JOIN Tbl_Dim_Date d ON f.sk_date_id = d.sk_date_id WHERE d.date_value between '10/1/2004' and '10/7/2004' GROUP BY d.Date_Desc • SQL 2005 • One thread given per page of rows on a nested loop join • SQL 2008 • One thread given per row on a nested loop join • Good for Joins to Date Dim • M$ internal DW Scale Benchmark perf increase by 30%

  16. Work-Around’s for SQL Server 2005 • STUFF YOUR ROW • Add a JUNK Col on the Date dimension to force one row per page • CLUSTER ON A GUID • Add a column and populate with GUIDs to encourage Rows onto separate pages

  17. Partition Aligned Indexed Views • The Big Chore was “Sliding” a table with an indexed view on it. • In 2005 this needed to be dropped • In 2008 it does not 

  18. Sliding Window with Indexed View in Place Rebuild Partitioned Index Filtered Indexes IT’s DEMO TIME

  19. STAR JOINS “Optimized” Bitmap Filters • What is a Bitmap filter • In memory structure (no index overhead) • Created dynamically • Typically quite small in size • Bitmap Filter SQL 2005 • What it was in 2005... • Hash or Merge JOIN • Optimised Bitmap Filter SQL 2008 • Enterprise Edition • Parallel Query • Hash JOIN only • Fact table must have > 100 pages • Single Column join (No PK FK relationship requirement)(integer needed for optimized) • Dimension input cardinalities are smaller than fact input cardinalities • Look for Bitmap warning event for missed opportunities to use Bitmap

  20. Minimally Logged Inserts & TF 610

  21. Bulk Load Methods Compared

  22. STAR JOINS Minimally Logged INSERTS FOR THE FINAL TIME

More Related