Design an indexing solution

-
A good understanding of the data warehouse workload, its structure, and index types are all very important for designing a proper indexing solution.

The two main types of indexes that are part of almost every data warehouse index solution are rowstore and columnstore indexes. Rowstore indexes store table or view data horizontally based on rows of data. Columnstore indexes store table or view data vertically based on column values. Rowstore indexes are the traditional indexes that have been present since the early versions of SQL Server. Columnstore indexes are a newer type of in-memory index that provide increased performance benefits over traditional rowstore indexes in data warehousing workloads.

Rowstore indexes
Rowstore indexes can be defined as clustered or nonclustered row indexes. A clustered rowstore index sorts and stores table or view data in rows in the order of the clustered index key. The clustered index key is usually the table’s primary key, although you can also define a clustered index on tables with no primary key. A table with a clustered index is commonly known as a clustered table. A clustered table can have one and only one clustered index. 

Nonclustered rowstore indexes store the nonclustered index key values with a pointer, known as the row locator, to the data row in a heap table or to the clustered index key in a clustered table.

Columnstore index
A columnstore index is an in-memory technology that stores and manages data by using a column-based format. Columnstore indexes store data in rowgroups as opposed to rowstores. The rowgroups contain compressed column values, known as column segments. This columnar storage format greatly improves query performance because only the specific column segments for the query requested values need to be decompressed. 

The compression algorithm behind a columnstore index can greatly reduce the storage footprint when compared to a traditional rowstore index. A columnstore index is the recommended index for large data warehouse fact tables.


Comments

Post a Comment

Popular Posts

Non-blocking, semi-blocking, and blocking transforms in SSIS

-
Not all Data Flow transforms are created equal. In fact, some are much faster and require a  lot less memory (non-blocking transforms). Others are slower while consuming much more  memory (blocking transforms), and some are in between (semi-blocking transforms). We don’t  always have a choice if we need to use a certain transform to do a certain specified task, but  it is good to know the differences between these types of transforms so that we can better  understand performance and resource utilization issues. Synchronous and asynchronous There is another related aspect about Data Flow transforms, which is their ability to quickly  process a row as they are coming into the transform, independently of any other rows that  came before or after (synchronous transforms). The other type of transform needs to be  dependent on some or all of the rows that come before and after (asynchronous transforms). On the whole, non-blocking transforms are also synchronous, thus are fast and
Read more

Implement additive, semi-additive, and non-additive measures

-
Additive Additive measures are numeric values that can be summed up by all the dimensions in the  fact table, for example the Sales Amount. These are the most common measures and they are  the easiest to understand and implement. Semi-additive Semi-additive measures are numeric values that can be summed up by some dimensions  in the fact table, but not all. In most cases, they can be aggregated by any other dimension  except time.  An example of a semi-additive measure is Account Balance. You can determine  the ending balance of an account at the end of a month, but adding up these monthly account  balances do not make sense. Semi-additive measures are usually found in fact tables that store  periodic snapshots of data. Non-additive Non-additive measures, as the name implies, are measures that cannot be summed up.  These measures include percentages such as Discount Percent, ratios such as Profit Margin, and  averages such as Average Unit Cost. Exam 70-767
Read more

Design an appropriate storage solution, including hardware, disk, and file layout

-
Image
The data warehouse storage’s performance can be measured by  analyzing the time it takes for read and write operations to complete, known as latency , and by  analyzing how much data volume it can read or write in each time frame, known as throughput .  High latency and low throughput can be an indication of an improper selection for the  storage infrastructure or incorrect hardware and software configurations. Performance of a storage subsystem can  be estimated based on several criteria: Volume of data Rate of change and growth of the data Data retention policy Number of concurrent users Typical workloads expected Two important metrics associated with storage are throughput and Input/Output Per  Second (IOPS) . Throughput is a measure of the amount of data that can be transferred in a  period. This is typically measured in megabytes or gigabytes per second. IOPS is the number of  I/O read or write operations that can complete in a second.  It is important
Read more