Cover Image

The brilliance of Netezza / authors, Tom Coffing and John Nolan.

This book discusses the architecture of Netezza for enterprise data warehousing. It covers parallel processing, FPGA (field programmable gate arrays) cards and zone maps, distribution keys, collecting statistics, creating tables and databases, and other database management processes.

Saved in:
Bibliographic Details
Online Access: Full Text (via Skillsoft)
Main Authors: Coffing, Tom, Nolan, John (Author)
Format: Electronic eBook
Language:English
Published: [Middletown, Ohio?] : Coffing Data Warehousing, ©2014.
Series:Tera-Tom genius series
Subjects:
Data warehousing.
Database management.
Data warehousing
Database management
Table of Contents:
  • Intro; Chapter 1
  • How Netezza Works; What is Parallel Processing?; The Basics of a Single Computer; Netezza Parallel Processes Data; Netezza is Born to be Parallel; Starts with a Linux User, a Database User and A Database; Each SPU holds a Portion of Every Table; The Rows of a Table are Spread Across All SPUs; The Brilliance of Netezza; Compress Engine II
  • Adaptive Stream Compression; FPGA Card and Zone Maps
  • The Netezza Secret Weapon; How Data Might Look Like on a SPU; Question
  • How Many Blocks Move Into Memory?; Answer
  • How Many Blocks Move Into Memory?
  • Quiz
  • Master that Query With the Zone MapAnswer to Quiz
  • Master that Query With the Zone Map; Netezza has Linear Scalability; The Netezza Architecture; The Host; Netezza Disks; There Are Three Options for Backup and Restore; The IBM Netezza Family; Chapter 2
  • A Chip Off The Old Block; Netezza Stores Data in Tables; Each SPU is Assigned Specific Rows; Each SPU Organizes the Rows inside a Data Block (Extent); SPUs Must Transfer Their Data Blocks to Memory; As Tables Get Bigger the SPU uses Multiple Extents; SPUs Process A Table One Block at a Time; The Slowest Processing is a Full Table Scan.
  • The FPGA Card and the Zone Maps Eliminate ExtentsThe FPGA Card and the Zone Map Enlightenment; Netezza Systems Can Grow Forever; Chapter 3
  • How Netezza Distributes the Data; Netezza Tables
  • Distribution Key or Random Distribution; Table CREATE Examples with 4 different Distribution Keys; Netezza Uses a Hash Formula; The Hash Map Determines which SPU will own the Row; The Hash Formula, Hash Map and SPU; Placing rows on the SPU; Placing rows on the SPU Continued; A Review of the Hashing Process; Like Data Hashes to the Same SPU; Distribution Keys.
  • Distribution Key in WHERE Clause
  • 1 SPU RetrieveA Non-Unique Distribution Key; Distribution Key in the WHERE Clause
  • 1 SPU Retrieve; A conceptual example of a Multi-Column Distribution Key; Distribution Key in the WHERE Clause
  • 1 SPU Retrieve; A conceptual example of a Table with Random Distribution; A Full Table Scan
  • or a Sequential Scan; What happens when you forget the Distribution Key?; Fully Qualifying an Object; Checking for Skew; Educate the Business on the Business by Sharing the Model; Load Your Models and have the SQL Built Automatically; Netezza is Massively Parallel.
  • Chapter 4
  • Deep Dive Inside a Netezza Extent and RowNetezza Performance
  • Three Things to Keep in Mind; How Netezza Allocates Data Storage; Extents and Zone Maps; How Data Might Look in an Extent; Why Dates Are Generally Not Good Distribution Keys; When a Table is Created, a Table Header is Created; Every SPU has the Exact Same Tables; All Netezza Tables are spread across All SPUs; The Table Header and the Data Rows are Stored Separately; A SPU Stores Rows of a Table inside a Data Block (Extent); To Read Rows, a SPU Moves the Data Block into Memory.

Similar Items