使用复合散列范围分区有什么意义
What is the point of using a Composite hash range partition
如果我有一个 table 具有范围内的值，那么我应该创建一个范围分区...如果 table 没有适合范围或列表部分的数据，那么应该创建一个散列分区。那么将多个分区连接在一起有什么意义呢？
Docs 覆盖这个。
何时使用复合范围哈希分区
Composite range-hash partitioning is particularly common for tables
that store history, are very large consequently, and are frequently
joined with other large tables. For these types of tables (typical of
data warehouse systems), composite range-hash partitioning provides
the benefit of partition pruning at the range level with the
opportunity to perform parallel full or partial partition-wise joins
at the hash level. Specific cases can benefit from partition pruning
on both dimensions for specific SQL statements.
Composite range-hash partitioning can also be used for tables that
traditionally use hash partitioning, but also use a rolling window
approach. Over time, data can be moved from one storage tier to
another storage tier, compressed, stored in a read-only tablespace,
and eventually purged. Information Lifecycle Management (ILM)
scenarios often use range partitions to implement a tiered storage
approach. See Managing and Maintaining Time-Based Information for more
details.
Example 3-8 is an example of a range hash partitioned page_history
table of an Internet service provider. The table definition is
optimized for historical analysis for either specific client_ip values
(in which case queries benefit from partition pruning) or for analysis
across many IP addresses, in which case queries can take advantage of
full or partial partition-wise joins...
如果我有一个 table 具有范围内的值，那么我应该创建一个范围分区...如果 table 没有适合范围或列表部分的数据，那么应该创建一个散列分区。那么将多个分区连接在一起有什么意义呢？
Docs 覆盖这个。
何时使用复合范围哈希分区
Composite range-hash partitioning is particularly common for tables that store history, are very large consequently, and are frequently joined with other large tables. For these types of tables (typical of data warehouse systems), composite range-hash partitioning provides the benefit of partition pruning at the range level with the opportunity to perform parallel full or partial partition-wise joins at the hash level. Specific cases can benefit from partition pruning on both dimensions for specific SQL statements.
Composite range-hash partitioning can also be used for tables that traditionally use hash partitioning, but also use a rolling window approach. Over time, data can be moved from one storage tier to another storage tier, compressed, stored in a read-only tablespace, and eventually purged. Information Lifecycle Management (ILM) scenarios often use range partitions to implement a tiered storage approach. See Managing and Maintaining Time-Based Information for more details.
Example 3-8 is an example of a range hash partitioned page_history table of an Internet service provider. The table definition is optimized for historical analysis for either specific client_ip values (in which case queries benefit from partition pruning) or for analysis across many IP addresses, in which case queries can take advantage of full or partial partition-wise joins...