Home > Store

Oracle Performance Survival Guide: A Systematic Approach to Database Optimization

Register your product to gain access to bonus material or receive a coupon.

Oracle Performance Survival Guide: A Systematic Approach to Database Optimization

eBook

  • Your Price: $51.19
  • List Price: $63.99
  • About Watermarked eBooks
  • This PDF will be accessible from your Account page after purchase and requires PDF reading software, such as Acrobat® Reader®.

    The eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

    Watermarked eBook FAQ

Description

  • Copyright 2010
  • Pages: 768
  • Edition: 1st
  • eBook
  • ISBN-10: 0-13-700049-9
  • ISBN-13: 978-0-13-700049-4

Oracle Performance Survival Guide

A Systematic Approach to Database Optimization

The fast, complete, start-to-finish guide to optimizing Oracle performance

Oracle Performance Survival Guide offers a structured, systematic, start-to-finish methodology for optimizing Oracle performance as efficiently as possible. Leading Oracle expert Guy Harrison shows how to maximize your tuning investment by focusing on causes rather than symptoms, and by quickly identifying the areas that deliver the greatest “bang for the buck.”

Writing for DBAs and developers with all levels of experience, Harrison covers every area of Oracle performance management, from application design through SQL tuning, contention management through memory and physical IO management. He also presents up-to-the-minute guidance for optimizing the performance of the Oracle 11g Release 2. 

You’ll start by mastering Oracle structured performance tuning principles and tools, including techniques for tracing and monitoring Oracle execution. Harrison illuminates the interaction between applications and databases, guides you through choosing tuning tools, and introduces upfront design techniques that lead to higher-performance applications. He also presents a collection of downloadable scripts for reporting on all aspects of database performance.

Coverage includes

     •    “Tuning by layers,” the most effective, highest-value approach to Oracle performance optimization

     •    Making the most of Oracle’s core tools for tracing, monitoring, and diagnosing performance

     •    Highly efficient database logical and physical design, indexing, transaction design, and API use

     •    SQL and PL/SQL tuning, including the use of parallel SQL techniques

     •    Minimizing contention for locks, latches, shared memory, and other database resources

     •    Optimizing memory and physical disk IO

     •    Tuning Real Application Cluster (RAC) databases

guyharrison.net

informit.com/ph

Sample Content

Table of Contents

Preface

Part I: Methods, Concepts, and Tools

Chapter 1. Oracle Performance Tuning: A Methodical Approach

A Brief History of Oracle Performance Tuning

Moving Beyond a Symptomatic Approach

Stage 1: Minimizing the Application Workload

Stage 2: Reducing Contention and Bottlenecks

Stage 3: Reducing Physical IO

Stage 4: Optimizing Disk IO

Summary

Chapter 2. Oracle Architecture and Concepts

The Oracle APIs

    Creating the Cursor

    Checking for Cached SQL Statements 

    Parsing the SQL

    Associating Bind Variables

    Executing the SQL

    Fetching Rows

    Using Array Fetch

    Processing Result Sets

    Closing the Cursor

    Optimizing Oracle API Calls

The Oracle Query Optimizer

    Cost Based Optimization

    Optimizer Goal

    Optimizer Statistics

    Bind Variable Peeking and Adaptive Cursor Sharing

    Hints

    Outlines, Profiles, and Baselines

Transactions and Locking

Oracle Server Architecture

    Instances and Databases

    The System Global Area

    Data Caching

    The Program Global Area

    Memory Management

Segments and Files

    Tables

    Indexes

    Blocks, Extents, Segments, and Partitions

    Tablespaces and Data Files

    Undo Segments

    Redo Logs and Archive Logs

    Flashback Logs

Server Processes

Background Processes

Real Application Clusters

Summary

Chapter 3. Tools of the Trade

Explaining SQL Statements

    The Plan Table

    Exploiting Cached SQL

    DBMS_XPLAN

    Interpreting the Execution Plan

    Virtual Indexing

Tracing Oracle Execution

    Tracing from Within Your Session

    Identifying Your Trace File

    Getting Tracing Status

    Invoking Trace in Another Session

    Tracing by MODULE, ACTION, or SERVICE

    Starting a Trace Using a Login Trigger

    Finding the Trace File

    Other Specialized Traces

Formatting Traces with tkprof

    The tkprof Sort Options

    Other tkprof Options

    Merging Multiple SQL Trace Files

    Interpreting Tkprof Output

    Execution Plans in tkprof

    Wait Statistics and tkprof

    Alternatives to tkprof

Using AUTOTRACE in SQL*PLUS

Monitoring the Oracle Server

    The V$ table interface

    Wait Interface

    The Time Model

    Integrating the Time Model and Wait Interface

    Oracle Enterprise Manager

    Spotlight on Oracle

Summary

Part II: Application and Database Design

Chapter 4. Logical and Physical Database Design

Logical Data Modeling

    Normalization and Third Normal Form

    Data Type Choices

    Artificial Keys

    Data Warehouse Design

Logical to Physical

    Mapping Entities or Classes to Tables

    Choosing a Table Type

    Data Types and Precisions

    Optional Attributes and NULL Values

    Column Order

    Exploiting Oracle Object Types

Denormalization

    Replicating Column Values to Avoid Joins

    Summary Tables

    Vertical Partitioning

    Implementing Denormalization

Star Schema Design

    Star Schema Basics

    Snowflakes Schemas

    Dimension Hierarchies

    Aggregations and Materialized Views

    Materialized View Best Practices

Physical Storage Options

    Manual and Automatic Segment Storage Management

    Concurrent Inserts and Freelists

    PCTFREE and PCTUSED

    Compression

    LOB Storage

Oracle Partitioning

    Types of Partitions

    Composite Partitions

    Choosing a Partitioning Strategy

    Enterprise Manager Partitioning Advisor

Summary

Chapter 5. Indexing and Clustering

Overview of Oracle Indexing and Clustering

B*-Tree Indexes

    Index Selectivity

    Unique Indexes

    Implicit Indexes

    Concatenated Indexes

    Index Skip Scans

    Guidelines for Concatenated Indexes

    Index Merges

    Null Values in Indexes

    Reverse Key Indexes

    Index Compression

    Functional Indexes

    Foreign Keys and Locking

    Indexes and Partitioning

Bitmap Indexes

    Features of Bitmap Indexes

    Drawbacks of Bitmap Indexes

    Bitmap Indexes and Cardinality

    Bitmap Index Merge

    Bitmap Join Indexes

Index Overhead

    Index Organized Tables

    Configuring the Overflow Segment

    Periodic Rebuild of Index Only Tables

Clustering

    Index Clusters

    Hash Clusters

Nested Tables

Choosing the Best Indexing Strategy

Summary

Chapter 6. Application Design and Implementation

SQL Statement Management

    Optimizing Parsing

    Avoiding Unnecessary SQL Executions

The Array Interface

    Implementing Array Fetch

    Array Insert

Transaction Design

    Isolation Levels

    Transactions and Locks

    Row Level Locking in Oracle

    Application Locking Strategies

Using Stored Procedures to Reduce Network Traffic

Summary

Part III: SQL and PL/SQL Tuning

Chapter 7. Optimizing the Optimizer

The Oracle Optimizer

    What Is Cost?

    Optimizer Goal

    Selectivity and Cardinality

    Query Transformation

    Cost Calculations

    Object Statistics

    Histograms

    Bind Variable Peeking

    Adaptive Cursor Sharing

    Database Parameters

    System Statistics

    Collecting Statistics

Using DBMS_STAT

    DBMS_STATS Procedures and Parameters

    Setting DBMS_STATS Defaults

    Creating Histograms with METHOD_OPT

    Sampling

    Partition Statistics

    Extended Statistics

    Locking Statistics

    System Statistics

    Exporting and Importing Statistics

    Manipulating Statistics

Summary

Chapter 8. Execution Plan Management

Hints

    Using Hints to Change the Access Path

    Using Hints to Change the Join Order

    Errors in Hint Specifications

Stored Outlines

    Creating an Outline to Stabilize a Plan

    Hacking an Outline

    SQL Tuning Sets

    Manually Creating a Tuning Set

    Creating Tuning Sets in

    Enterprise Manager

SQL Profiles and the SQL Tuning Advisor

    Using DBMS_SQLTUNE

    Indexing Advice

    SQL Tuning in Enterprise Manager

    Cross-SQL Tuning with the SQL Access Advisor

SQL Baselines

    Creating the Baseline

    Evolving the Baseline

    Automating and Configuring Baselines

    Fixed Baselines

    Baseline Management in Oracle

    Enterprise Manager

Summary

Chapter 9. Tuning Table Access

Single Value Lookups

    Choosing Between Table and Index Scan

    Bitmap Indexes and Single Value Lookups

    Hash Clusters and Single Value Lookups

Avoiding “Accidental” Table Scans

    NOT EQUALS Conditions

    Searching for Nulls

    Searching for Values That Are NOT NULL

    Creating Indexes on NULLable Columns

    Unintentionally Disabling an Index with a Function

    Functional Indexes

    Functional Indexes and Statistics

    Virtual Columns

Multicolumn Lookups

    Using Concatenated Indexes

    Index Merges

    Uniqueness and Over-Indexing

Searching for Ranges

    Unbounded Range Scan

    Bounded Range Scans

    Range Lookups

Using the LIKE Operator

Multvalue Single-Column Lookups

Optimizing Necessary Full Table Scans

    Lowering the High Water Mark

    Optimizing PCTFREE and PCTUSED

    Reducing the Row Length

    Compressing the Table

    Making Database IO More Efficient

    Using the SAMPLE Option

    Parallel Query

    The Fast Full Index Scan

    Partitioning

Summary

Chapter 10. Joins and Subqueries

Types of Joins

Join Methods

    Nested Loops Join

    Sort-Merge Join

    Hash Join

Choosing the Right Join Method

    Sort-Merge/Hash Versus Nested Loops

    Sort-Merge Versus Hash Joins

Optimizing Joins

    Optimizing Nested Loops Join

    Optimizing Sort-Merge and Hash Joins

Avoiding Joins

    Denormalization

    Index Clusters

    Materialized Views

    Bitmap Join Index

Join Order

    Special Joins

    Outer Joins

    Star Joins

    Hierarchical Joins

Subqueries

    Simple Subqueries

    Correlated Subqueries

    Anti-Join Subqueries

    Semi-Join Subqueries

Summary

Chapter 11. Sorting, Grouping, and Set Operations

Sort Operations

    Optimal, One-Pass and Multi-Pass Sorts

    Measuring Sort Activity

    Tracing Sort Activity

    Using an Index to Avoid a Sort

Grouping and Aggregates

    Aggregate Operations

    Maximums and Minimums

    The “Top N” Query

    Counting the Rows in a Table

    GROUP BY Operations

    HAVING Versus WHERE

SET Operations

    UNION Versus UNION ALL

    INTERSECT

    MINUS

    SET Operations and Their Alternatives

Summary

Chapter 12. Using and Tuning PL/SQL

Performance Advantages of PL/SQL

    A Procedural Approach

    Reduction in Network Overhead

    Divide and Conquer Massive SQLs

Measuring PL/SQL Performance

    Measuring PL/SQL Overhead

    Using DBMS_PROFILER

    The 11g Hierarchical Profiler

    Data Access Optimization

    Array Processing and BULK COLLECT

    Array Processing for INSERT Statements

    Bind Variables and Dynamic SQL

PL/SQL Code Optimization

    Tune the SQL First

    PLSQL_OPTIMIZE_LEVEL

    LOOP Optimization

    “Short Circuiting” Expressions

    Order of Expressions in IF and CASE Statements

    Recursion

    The NOCOPY Clause

    Associative Arrays

Other Optimizations

    Native Compilation

    PL/SQL In-Lining

    Data Types

    Using Java for Computation

    Function Caching

DML Trigger Performance

    UPDATE OF and WHEN Clauses

    Before and After Row Triggers

Summary

Chapter 13. Parallel SQL

Understanding Parallel SQL

    Parallel Processes and the Degree of Parallelism

    Parallel Slave Pool

    Parallel Query IO

    Parallel Performance Gains

Deciding When to Use Parallel Processing

    Your Server Computer Has Multiple CPUs

    The Data to Be Accessed Is on Multiple Disk Drives

    The SQL to Be Parallelized is Long Running or Resource-Intensive

    The SQL Performs at Least One Full Table, Index, or Partition Scan

    There Is Spare Capacity on Your Host

    The SQL is Well Tuned

Configuring Parallel Processing

    Determining the Degree of Parallelism

    Parallel Hints

    Parallel Configuration Parameters

Monitoring Parallel SQL

    Parallel Explain Plans

    Tracing Parallel Execution

    The V$PQ_TQSTAT View

    Other Statistics

Optimizing Parallel Performance

    Start with a SQL That Is Optimized for Serial Execution

    Ensure That the SQL Is a Suitable SQL for Parallel Execution

    Ensure That the System Is Suitably Configured for Parallel Execution

    Make Sure that All Parts of the Execution Plan Are Parallelized

    Ensure That the Requested DOP Is Realistic

    Monitor the Actual DOP

    Check for Skew in Data and Skew in Workload Between Processes

Other Parallel Topics

    Parallel Execution in RAC

    Parallel Index Lookups

    Parallel DML

    Parallel DDL

Summary

Chapter 14. DML Tuning

DML Performance Fundamentals

    WHERE Clause Optimization

    Index Overhead

    Trigger Overhead

    Referential Integrity

INSERT Specific Optimizations

    Array Processing

    Direct Path Inserts

    Multi-Table Insert

    Manual Segment Storage Management (MSSM) and Freelists

    Parallel DML

DELETE Operations

    TRUNCATE

    Partitions

    Create Table as Select

UPDATE and MERGE Operations

    Correlated UPDATEs

    Optimizing MERGE

COMMIT Optimization

    COMMIT Frequency

    Batch and NOWAIT Commit

    NOLOGGING

Summary

Part IV: Minimizing Contention

Chapter 15. Lock Contention

Lock Types and Modes

Waiting for Locks

Monitoring and Analyzing Locks

    Lock Wait Statistics

    Finding the Responsible SQL

    Measuring Lock Contention for Specific Transactions

    Tracing Lock Activity

    Blockers and Waiters

Application Locking Strategies

When Row Level Locking Fails

    Unindexed Foreign Keys

    ITL Waits

    Bitmap Indexes

    Direct Path Inserts

System Locks

    The High Water Mark (HW) Enqueue

    The Space Transaction (ST) Enqueue

    The Sequence Cache (SQ) Enqueue

    The User Lock (UL) Enqueue

    Other System Locks

Summary

Chapter 16. Latch and Mutex Contention

Overview of Latch and Mutex Architecture

    Gets, Spins, and Sleeps

    Mutexes

Measuring and Diagnosing Latch/Mutex Contention

    Identifying Individual Latches

    Finding SQLs and Segments Associated with Latch Waits

Specific Latch/Mutex Scenarios

    Library Cache Mutex Waits

    Library Cache Pin

    Shared Pool Latch

    Cache Buffers Chains Latch

    Row Cache Objects Latch

    Other Latch Scenarios

Is Latch Contention Inevitable?

    What About Changing _SPIN_COUNT?

    Spin Count, Latch Contention, and Throughput

    Setting Spin Count for Individual Latches

Summary

Chapter 17. Shared Memory Contention

Buffer Cache Architecture

Free Buffer Waits

    DBWR Direct and Asynchronous IO

    Other Remedies for Free Buffer Waits

Recovery Writer (RVWR) Waits

    Improving Flashback Log IO

    Increasing the Size of the

    Flashback Log Buffer

Buffer Busy Waits

    Measuring Buffer Busy

    Traditional Causes of Buffer Busy Waits

    Buffer Busy and Hot Blocks

Redo Log Buffer Waits

Summary

Part V: Optimizing Memory

Chapter 18. Buffer Cache Tuning

Buffer Cache Principles

    The LRU List

    Table Scan Handling

    The CACHE Property

    Direct Path IO

Buffer Cache Configuration and Tuning

    Monitoring the Buffer Cache

    The Buffer Cache Hit Rate

    Multiple Buffer Caches

    Sizing the Buffer Cache

Automatic Shared Memory Management (ASMM)

    Implementing ASMM

    Monitoring Resize Operations

    Tuning ASMM

    Nondefault Pools

    Memory Thrashing

Summary

Chapter 19. Optimizing PGA Memory

IO and PGA Memory

PGA Memory Management

    PGA_AGGREGATE_TARGET

    Session PGA Limits

Measuring PGA Usage and Efficiency

    Session PGA Utilization

    Measuring Temporary IO Wait Time

    Measuring Work Area Activity

Sizing the PGA with V$PGA_TARGET_ADVICE

Over-Riding PGA Aggregate Target

Summary

Chapter 20. Other Memory Management Topics

Optimizing Overall Oracle Memory

    IO Wait Times and Memory Optimization

    Using Advisories to Distribute PGA/Buffer Cache Memory

    Oracle 11G Automatic Memory Management (AMM)

Result Set Cache

    Enabling and Configuring the Result Set Cache

    Result Cache Statistics

    Result Cache Dependencies

    Result Cache Latches

    PL/SQL Function Cache

Other Memory Optimizations

    Sizing the Shared Pool

    Large Pool Sizing

    Redo Log Buffer

    Locking the SGA

Summary

Part VI: IO Tuning and Clustering

Chapter 21. Disk IO Tuning Fundamentals

Disk IO Concepts

    Service Time and Throughput

    Queuing

    Disk Drives: Slow and Getting Slower

    Disk Capacity and Data Placement

Oracle IO Architecture

    Datafile Single Block Read

    Multi Block Read

    Direct Path Reads

    Temporary Direct Path IO

    Data File Write IO

    Direct Path Writes

    Redo Log IO

    Archive Log IO

    Flashback IO

    Control File IO

Measuring and Monitoring Oracle IO

    IO Wait Times

    Monitoring Datafile IO

    Calibrating IO

Optimizing Datafile IO

    Minimizing IO Latency

    Maximizing IO Throughput

    Striping Strategies

    RAID Arrays

    Isolating Datafile IO

Redo and Archive Optimization

    Alternating and Distributing Logs

    Redo and Archive Fine-Grained Striping

    Just Say NO to RAID5 for Redo!

    Redo Log Sizing

Flashback Logs

Summary

Chapter 22. Advanced IO Techniques

Automatic Storage Management (ASM)

    ASM Architecture

    ASM Monitoring

    ASM Tuning

Solid State Disk (SSD)

    Flash-Based SSD

    DDR RAM-Based SSD

    Hybrid SSD

    Using SSD for Oracle Databases

The Exadata Storage Server

Database Block Size

Summary

Chapter 23. Optimizing RAC

RAC Overview

    Global Cache Requests

    RAC Tuning Principles

    Single Instance Tuning and RAC  

Measuring Cluster Overhead

Reducing Global Cache Latency

    Measuring Global Cache Latency

    Examining the Interconnect

    Signs of Interconnect Problems

Optimizing the Interconnect

    Network Hardware and Protocols

    Ethernet Jumbo Frames

    UDP Buffer Size

    LMS Waits

Cluster Balance

    Assessing Cluster Balance

    Cluster Balance and Services

    RAC Load Balancing Facilities

Minimizing Global Cache Requests

    Causes of High Global Cache Request Rates

    Measuring Global Cache Request Rates

    Techniques for Reducing Global Cache Requests

Summary

Bibliography

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020