EXPLAIN Request Modifier and Partitioned Primary Index Access - Analytics Database

EXPLAIN reports indicate partition accesses, deletions, joins, and eliminations performed during query optimization.

Partitioned Primary Index Examples

This set of examples shows important EXPLAIN text phrases associated with optimizing queries made on tables that have partitioned primary indexes.

The following example demonstrates a partial EXPLAIN report for accessing a subset of row partitions for a SELECT request. The relevant phrase is highlighted in boldface type.

CREATE TABLE t1 (
a INTEGER,
b INTEGER)
PRIMARY INDEX(a) 
PARTITION BY RANGE_N(b BETWEEN 1
                       AND    10
                       EACH    1);
   
EXPLAIN 
SELECT *
FROM t1
WHERE b > 2;

...
3) We do an all-AMPs RETRIEVE step in TD_MAP1 from 8 partitions of
   mws.t1 with a condition of ("mws.t1.b >= 3") into Spool 1
   (group_amps), which is built locally on the AMPs.  The size of
   Spool 1 is estimated with no confidence to be 3 rows (129 bytes).
   The estimated time for this step is 0.15 seconds.
...

The following example demonstrates a partial EXPLAIN report for a SELECT request with an equality constraint on the partitioning column. The relevant phrase is highlighted in boldface type. The report indicates that all rows in a single row partition are scanned across all AMPs.

CREATE TABLE t1 (a INTEGER, b INTEGER)
PRIMARY INDEX(a) 
PARTITION BY RANGE_N(b BETWEEN 1
                       AND    10
                       EACH    1);

EXPLAIN 
SELECT *
FROM t1
WHERE t1.b = 1;

...
3) We do an all-AMPs RETRIEVE step from  a single partition of  mws.t1
   with a condition of ("mws.t1.b = 1") into Spool 1
   (group_amps), which is built locally on the AMPs. The size of
   Spool 1 is estimated with no confidence to be 2 rows. The
   estimated time for this step is 0.15 seconds.
...

The following example demonstrates a partial EXPLAIN request report for row-partitioned primary index access without any constraints on the partitioning column. The relevant phrase is in boldface type. The report indicates that all row partitions are accessed by way of the primary index on a single AMP.

CREATE TABLE t1 (a INTEGER, b INTEGER)
PRIMARY INDEX(a)
PARTITION BY RANGE_N(b BETWEEN 1
                       AND    10
                       EACH 1);

EXPLAIN 
SELECT *
FROM t1
WHERE t1.a = 1;

1) First, we do a single-AMP RETRIEVE step from  all partitions of
   mws2.t1 by way of the primary index "mws2.t1.a = 1" with no
   residual conditions into Spool 1 (one_amp), which is built
   locally on that AMP. The size of Spool 1 is estimated with low
   confidence to be 2 rows. The estimated time for this step is 0.15 seconds.
...

The following example demonstrates the processing of a SELECT request without any row partition elimination. The phrase "n partitions of" does not occur in the report.

CREATE TABLE t1 (a INTEGER, b INTEGER)
PRIMARY INDEX(a)
PARTITION BY RANGE_N(b BETWEEN 1
                       AND    10
                       EACH    1);

EXPLAIN 
SELECT *
FROM t1
WHERE b>-1;

...
3) We do an all-AMPs RETRIEVE step in TD_MAP1 from mws.t1 by way of
   an all-rows scan with a condition of ("NOT (mws.t1.b IS NULL)")
   into Spool 1 (group_amps), which is built locally on the AMPs.
   The size of Spool 1 is estimated with low confidence to be 8 rows
   (344 bytes).  The estimated time for this step is 0.15 seconds.
...

Two steps are generated to perform the partial and full row partition deletions, respectively, as demonstrated in the following partial EXPLAIN reports. The relevant phrases appear in boldface type.

CREATE TABLE t2 (
a INTEGER,
b INTEGER)
PRIMARY INDEX(a)
PARTITION BY RANGE_N(b BETWEEN 1 
                       AND    10
                       EACH 2);

EXPLAIN 
DELETE FROM t2
WHERE b BETWEEN 4 AND 7;

...
3) We do an all-AMPs DELETE from  2 partitions of  mws.t2
   with a condition of ("(mws.t2.b <= 7) AND (mws.t2.b >= 4)").
4) We do an all-AMPs DELETE  of a single partition  from mws.t2 with a
   condition of ("(mws.t2.b <= 7) AND (mws.t2.b >= 4)").
...

EXPLAIN 
DELETEFROM t2
WHERE b BETW EEN 4 AND 8;

...
3) We do an all-AMPs DELETE from  a single partition of  mws.t2
   with a condition of ("(mws.t2.b <= 8) AND (mws.t2.b >= 4)").
4) We do an all-AMPs DELETE  of 2 partitions  from mws.t2 with a
   condition of ("(mws.t2.b <= 8) AND (mws.t2.b >= 4)").
...

The following example demonstrates a spool with a row-partitioned primary index and a rowkey-based merge join. The relevant phrases appear in boldface type.

CREATE TABLE t3 (
a INTEGER,
b INTEGER)
PRIMARY INDEX(a);

CREATE TABLE t4 (
a INTEGER,
b INTEGER)
PRIMARY INDEX(a)
PARTITION BY b;

EXPLAIN 
SELECT *
FROM t3, t4
WHERE t3.a = t4.a
AND   t3.b = t4.b;

...
4) We do an all-AMPs RETRIEVE step in TD_MAP1 from mws.t3 by way of
   an all-rows scan with a condition of ("(NOT (mws.t3.a IS NULL ))
   AND ((mws.t3.b <= 65535) AND (mws.t3.b >= 1 ))") into Spool 2
   (all_amps), which is built locally on the AMPs.  Then we do a SORT
   to partition Spool 2 by rowkey.  The size of Spool 2 is estimated
   with no confidence to be 2 rows (42 bytes).  The estimated time
   for this step is 0.05 seconds.
5) We do an all-AMPs JOIN step in TD_MAP1 from mws.t4 by way of a
   RowHash match scan, which is joined to Spool 2 (Last Use) by way
   of a RowHash match scan.  mws.t4 and Spool 2 are joined using a
   rowkey-based merge join, with a join condition of ("(b = mws.t4.b)
   AND (a = mws.t4.a)").  The result goes into Spool 1 (group_amps),
   which is built locally on the AMPs.  The size of Spool 1 is
   estimated with no confidence to be 2 rows (130 bytes).  The
   estimated time for this step is 0.09 seconds.
...

The following example demonstrates one step for joining two tables having the same partitioning and primary keys. The relevant phrases appear in boldface type.

CREATE TABLE orders (
   o_orderkey      INTEGER NOT NULL,
   o_custkey       INTEGER,
   o_orderstatus   CHARACTER(1) CASESPECIFIC,
   o_totalprice    DECIMAL(13,2) NOT NULL,
   o_orderdate     DATE FORMAT 'yyyy-mm-dd' NOT NULL,
   o_orderpriority CHARACTER(21),
   o_clerk         CHARACTER(16),
   o_shippriority  INTEGER,
   o_comment       VARCHAR(79))
PRIMARY INDEX (o_orderkey)
PARTITION BY RANGE_N(o_orderdate BETWEEN DATE '1992-01-01'
                                 AND     DATE '1998-12-31'
                                 EACH INTERVAL '1' MONTH)
UNIQUE INDEX (o_orderkey);
CREATE TABLE lineitem (
  l_orderkey      INTEGER NOT NULL,
  l_partkey       INTEGER NOT NULL,
  l_suppkey       INTEGER,
  l_linenumber    INTEGER,
  l_quantity      INTEGER NOT NULL,
  l_extendedprice DECIMAL(13,2) NOT NULL,
  l_discount      DECIMAL(13,2),
  l_tax           DECIMAL(13,2),
  l_returnflag    CHARACTER(1),
  l_linestatus    CHARACTER(1),
  l_shipdate      DATE FORMAT 'yyyy-mm-dd',
  l_commitdate    DATE FORMAT 'yyyy-mm-dd',
  l_receiptdate   DATE FORMAT 'yyyy-mm-dd',
  l_shipinstruct  VARCHAR(25),
  l_shipmode      VARCHAR(10),
  l_comment       VARCHAR(44))
PRIMARY INDEX (l_orderkey)
PARTITION BY RANGE_N(l_shipdate BETWEEN DATE '1992-01-01'
                                AND     DATE '1998-12-31'
                                EACH INTERVAL '1' MONTH);

EXPLAIN 
SELECT *
FROM lineitem, ordertbl
WHERE  l_orderkey = o_orderkey
AND    l_shipdate = o_orderdate
AND   (o_orderdate < DATE '1993-10-01')
AND   (o_orderdate >= DATE '1993-07-01')
ORDER BY o_orderdate, l_orderkey;

...
3) We do an all-AMPs JOIN step from  3 partitions of  TH.ORDERTBL
   with a condition of (
   "(TH.ORDERTBL.O_ORDERDATE < DATE '1993-10-01') AND
   (TH.ORDERTBL.O_ORDERDATE >= DATE '1993-07-01')"),
   which is joined to TH.LINEITEM with a condition of (
   "TH.LINEITEM.L_COMMITDATE < TH.LINEITEM.L_RECEIPTDATE").
   TH.ORDERTBL and TH.LINEITEM are joined using a rowkey-based
   inclusion merge join, with a join condition of (
   "TH.LINEITEM.L_ORDERKEY = TH.ORDERTBL.O_ORDERKEY").
   The input tables TH.ORDERTBL and TH.LINEITEM will
   not be cached in memory. The result goes into Spool 3 (all_amps),
   which is built locally on the AMPs. The size of Spool 3 is
   estimated with no confidence to be 7,739,047 rows. The
   estimated time for this step is 1 hour and 34 minutes.
...

The following example demonstrates row partition elimination in an aggregation. The relevant phrase appears in boldface type.

CREATE TABLE t1 (
a INTEGER,
b INTEGER)
PRIMARY INDEX(a) 
PARTITION BY RANGE_N(b BETWEEN 1
                       AND    10
                       EACH 1);

EXPLAIN 
SELECT MAX(a)
FROM t1
WHERE b > 3;

...
3) We do an all-AMPs SUM step in TD_MAP1 to aggregate from 7 partitions of
   mws.t1 with a condition of ("mws.t1.b >= 4").
   Aggregate Intermediate Results are computed globally, then placed
   in Spool 3 in TD_Map1.  The size of Spool 3 is estimated with high
   confidence to be 1 row (19 bytes).  The estimated time for this
   step is 0.21 seconds.
4) We do an all-AMPs RETRIEVE step in TD_Map1 from Spool 3 (Last Use)
   by way of an all-rows scan into Spool 1 (group_amps), which is
   built locally on the AMPs.  The size of Spool 1 is estimated with
   high confidence to be 1 row (32 bytes).  The estimated time for
   this step is 0.03 seconds.
...

New terminology in these explanations are defined as follows:

Phrase	Definition
n partitions of	Only n of the row partitions are accessed, where n > 1. In this case, n = 8.
a single partition of	Only one row partition is accessed in processing this request.
all partitions of	All row partitions are accessed for primary index access in processing this request.
of a single partition	The Optimizer determined that all rows in a single row partition can be deleted. This may allow faster deletion of the entire partition.
of n partitions	The Optimizer determined that all rows in each of n row partitions can be deleted, where n > 1. This may allow faster deletion of entire row partitions.
SORT to partition Spool n by rowkey.	The Optimizer determined that a spool is to be row-partitioned based on the same partitioning expression as a table to which the spool is to be joined. That is, the spool is to be sorted by rowkey (partition and hash). Partitioning the spool in this way enables a faster join with the row-partitioned table. n is the spool number.
a rowkey-based	The join is hash-based by row partition (rowkey). In this case, there are equality constraints on both the partitioning and primary index columns. This enables a faster join since each uneliminated row partition needs to be joined with at most only one other row partition. When this phrase is not reported, then the join is hash-based. That is, there are equality constraints on the primary index columns from which the hash is derived. For a row-partitioned table, there is additional overhead incurred by processing the table in hash order. With either method, the join conditions must be validated.

EXPLAIN Request Modifier and Partitioned Primary Index Access - Analytics Database - Teradata Vantage

SQL Request and Transaction Processing

Partitioned Primary Index Examples