Range-List Partition - Definition,Features - Oracle Indexes and Partitioned Tables

Discussion

• Nirja Shah   -Posted on 28 Sep 15
  - Range-List partitioning
  - Like the composite range-hash partitioning method, the composite range-list partitioning method provides for partitioning based on a two level hierarchy.
  - The first level of partitioning is based on a range of values, as for range partitioning; the second level is based on discrete values, as for list partitioning.
  - This form of composite partitioning is well suited for historical data, but lets you further group the rows of data based on unordered or unrelated column values.
  
  - When creating range-list partitions, you specify the following:
  1. Partitioning method: range
  2. Partitioning column(s)
  3. Partition descriptions identifying partition bounds
  4. Subpartitioning method: list
  5. Subpartitioning column
  6. Subpartition descriptions, each specifying a list of literal values (a value list), which are the discrete values of the subpartitioning column that qualify a row to be included in the subpartition
  
  - Range-Hash Partitioning
  - It partitions data using the range method, and within each partition, subpartitions it using the hash method.
  - These composite partitions are ideal for both historical data and striping, and provide improved manageability of range partitioning and data placement, as well as the parallelism advantages of hash partitioning.
  
  - When creating range-hash partitions, you specify the following:
  1. Partitioning method: range
  2. Partitioning column(s)
  3. Partition descriptions identifying partition bounds
  4. Subpartitioning method: hash
  5. Subpartitioning column(s)
  6. Number of subpartitions for each partition or descriptions of subpartitions

➨ Post your comment / Share knowledge