How do I narrow my search results?
After you submit your search query:
- On the Refine Search results page, select one or more categories of products or services from the left sidebar.
- Then for a category with search results, click Select to choose your product and release filters, and then click OK.
For search queries that contain multiple words, surround the query with quotes, and then resubmit your query. Example: "database cloud service"
How do I find the documentation for my product or service?
From the home page, click the technology categories for your products or services. If you do not know which category to pick, try the following features:
- Click the Find a product tab and search for your product or service.
- Click Browse All Products & Services at the bottom of the home page to view an alphabetical listing of products and services.
- Apple Safari: Version 6
- Google Chrome: Version 29 and later
- Mozilla Firefox: Version 24 and later
- Microsoft Internet Explorer: Version 9 and later
36 DBMS_COMPRESSION → Oracle Database SQL Language Reference Oracle Database Data Warehousing Guide Oracle Database VLDB and
BEGIN_SQL_BLOCK Procedure → Parallel Statement Queuing with Resource Manager\" in Oracle Database VLDB and Partitioning Guide.
C.3.128 resmgr:pq queued → degree of parallelism Parameter Description location Location of the wait See Also: Oracle Database VLDB
About the Database Buffer Cache → statements Oracle Database VLDB and Partitioning Guide for information about parallel execution
FAST_START_PARALLEL_ROLLBACK → If a system fails when there are uncommitted parallel DML or DDL transactions, you can speed up transaction recovery during startup by using the FAST_START_PARALLEL_ROLLBACK parameter. This parameter controls the DOP used when recovering terminated transactions. Terminated transactions are transactions that are active before a system failure. By default, the DOP is chosen to be at most two times the
Degree of Parallelism (CREATE Part) → The DOP for the CREATE operation, and for the SELECT operation if it is parallelized, is specified by the PARALLEL clause of the CREATE statement, unless it is overridden by an ALTER SESSION FORCE PARALLEL DDL statement. If the PARALLEL clause does not specify the DOP, the default is the number of CPUs.
Creating Composite List-Range Partitioned Tables → Example 4-14 shows an accounts table that is list partitioned by region and subpartitioned using range by account balance, and row movement is enabled. Subpartitions for different list partitions could have different ranges specified. To learn how using a subpartition template can simplify the specification of a composite partitioned table, see \" Specifying Subpartition Templates to Describe Composite
Creating Reference-Partitioned Tables → To create a reference-partitioned table, you specify a PARTITION BY REFERENCE clause in the CREATE TABLE statement. This clause specifies the name of a referential constraint and this constraint becomes the partitioning referential constraint that is used as the basis for reference partitioning in the table. The referential constraint must be enabled and enforced. As with other partitioned tables,
Single-Level Partitioning → A table is defined by specifying one of the following data distribution methodologies, using one or more columns as the partitioning key: Range Partitioning Hash Partitioning List Partitioning For example, consider a table with a column of type NUMBER as the partitioning key and two partitions less_than_five_hundred and less_than_one_thousand. The less_than_one_thousand partition contains rows where
Creating a Composite Range-List Partitioned Table → Example 4-10 illustrates how range-list partitioning might be used. The example tracks sales data of products by quarters and within each quarter, groups it by specified states. A row is mapped to a partition by checking whether the value of the partitioning column for a row falls within a specific partition range. The row is then mapped to a subpartition within that partition by identifying the subpartition
Truncating Multiple Partitions → You can truncate multiple partitions from a range or list partitioned table with the TRUNCATE PARTITION clause of the ALTER TABLE statement. The corresponding partitions of local indexes are truncated in the operation. Global indexes must be rebuilt unless UPDATE INDEXES is specified.For example, the following SQL statement truncates multiple partitions in the range-partitioned sales table. ALTER
Exchanging a Hash Partitioned Table with a *-Hash Partition → In this example, you are exchanging a whole hash partitioned table, with all of its partitions, with the partition of a *-hash partitioned table and all of its hash subpartitions. The following example illustrates this concept for a range-hash partitioned table. First, create a hash partitioned table: CREATE TABLE t1 (i NUMBER, j NUMBER) PARTITION BY HASH(i) (PARTITION p1, PARTITION p2); Populate
Best Practice 1: Use ARCHIVELOG Mode → Archived redo logs are crucial for recovery when no data can be lost because they constitute a record of changes to the database. Oracle Database can be run in either of two modes: ARCHIVELOG Oracle Database archives the filled online redo log files before reusing them in the cycle. NOARCHIVELOG Oracle Database does not archive the filled online redo log files before reusing them in the cycle. Running
Extract, Transform, and Load → The ETL process uses several Oracle features and a combination of methods to load (re-load) data into a data warehouse. These features consist of: Transportable tablespaces Transportable tablespaces allow users to quickly move a tablespace across Oracle Databases. It is the most efficient way to move bulk data between databases. Oracle Database provides the ability to transport tablespaces across
Concurrent Execution of Union All → Set operators like UNION or UNION ALL consist of multiple queries (branches) combined to a single SQL statement. Traditionally, set operators are processed in a sequential manner. Individual branches can be processed in serial or parallel, but only one branch at a time, one branch after another. While this approach satisfies many use cases, there are situations where the processing of multiple branches
About Modifying List Partitions: Adding Values → List partitioning enables you to optionally add literal values from the defining value list. This section contains the following topics: Adding Values for a List Partition Adding Values for a List Subpartition
Partitioning Overview → Partitioning allows a table, index, or index-organized table to be subdivided into smaller pieces, where each piece of such a database object is called a partition. Each partition has its own name, and may optionally have its own storage characteristics. This section contains the following topics: Basics of Partitioning Partitioning Key Partitioned Tables Partitioned Index-Organized Tables System
Global Nonpartitioned Indexes → Global nonpartitioned indexes behave just like local nonpartitioned indexes. Figure 2-8 offers a graphical view of global nonpartitioned indexes. Figure 2-8 Global Nonpartitioned Index Description of \"Figure 2-8 Global Nonpartitioned Index\"
Partition Pruning → Partition pruning is an essential performance feature for data warehouses. In partition pruning, the optimizer analyzes FROM and WHERE clauses in SQL statements to eliminate unneeded partitions when building the partition access list. This functionality enables Oracle Database to perform operations only on those partitions that are relevant to the SQL statement. This section contains the following
Incremental Data Loading in Parallel → Parallel DML combined with the updatable join views facility provides an efficient solution for refreshing the tables of a data warehouse system. To refresh tables is to update them with the differential data generated from the OLTP production system. In the following example, assume a refresh of a table named customers that has columns c_key, c_name, and c_addr. The differential data contains either