...................................................................................266 16.4.7. Runtime Statistics ..................................................................................... declaring number of dimensions or sizes in CREATE TABLE is simply documentation, it does not affect runtime behavior. An alternative syntax, which conforms to the SQL:1999 standard, may be used for one-dimensional width=148) (actual time=0.295..0.324 rows=1 loops=50) Index Cond: ("outer".unique2 = t2.unique2) Total runtime: 31.604 ms Note that the “actual time” values are in milliseconds of real time, whereas the “cost”

Log................................................................................252 16.4.7. Runtime Statistics ....................................................................................254 declaring number of dimensions or sizes in CREATE TABLE is simply documentation, it does not affect runtime behavior. An alternative syntax, which conforms to the SQL:1999 standard, may be used for one-dimensional width=148) (actual time=0.295..0.324 rows=1 loops=50) Index Cond: ("outer".unique2 = t2.unique2) Total runtime: 31.604 ms Note that the “actual time” values are in milliseconds of real time, whereas the “cost”

constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you rows=1 width=244) (actual time=0.021..0.022 rows=1 loops=10) Index Cond: (unique2 = t1.unique2) Total runtime: 0.501 ms Note that the “actual time” values are in milliseconds of real time, whereas the cost rows=101 width=0) (actual time=0.049..0.049 rows=100 loops=1) Index Cond: (unique1 < 100) Total runtime: 8.008 ms The Sort node shows the sort method used (in particular, whether the sort was in-memory

constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you rows=1 width=244) (actual time=0.021..0.022 rows=1 loops=10) Index Cond: (unique2 = t1.unique2) Total runtime: 0.501 ms Note that the “actual time” values are in milliseconds of real time, whereas the cost rows=101 width=0) (actual time=0.049..0.049 rows=100 loops=1) Index Cond: (unique1 < 100) Total runtime: 8.008 ms The Sort node shows the sort method used (in particular, whether the sort was in-memory

constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you rows=1 width=244) (actual time=0.041..0.048 rows=1 loops=10) Index Cond: (unique2 = t1.unique2) Total runtime: 2.414 ms Note that the “actual time” values are in milliseconds of real time, whereas the cost rows=101 width=0) (actual time=0.390..0.390 rows=100 loops=1) Index Cond: (unique1 < 100) Total runtime: 107.392 ms The Sort node shows the sort method used (in particular, whether the sort was in-memory

constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you rows=1 width=244) (actual time=0.041..0.048 rows=1 loops=10) Index Cond: (unique2 = t1.unique2) Total runtime: 2.414 ms Note that the “actual time” values are in milliseconds of real time, whereas the cost rows=101 width=0) (actual time=0.390..0.390 rows=100 loops=1) Index Cond: (unique1 < 100) Total runtime: 107.392 ms The Sort node shows the sort method used (in particular, whether the sort was in-memory

be optimized, since the planner cannot know what partitions the parameter value might select at runtime. For the same reason, “stable” functions such as CURRENT_DATE must be avoided. Joining the partition constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you width=244) (actual time=0.067..0.078 rows=1 loops=100) Index Cond: ("outer".unique2 = t2.unique2) Total runtime: 14.452 ms Note that the “actual time” values are in milliseconds of real time, whereas the “cost”

be optimized, since the planner cannot know what partitions the parameter value might select at runtime. For the same reason, “stable” functions such as CURRENT_DATE must be avoided. Joining the partition constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you width=244) (actual time=0.067..0.078 rows=1 loops=100) Index Cond: ("outer".unique2 = t2.unique2) Total runtime: 14.452 ms Note that the “actual time” values are in milliseconds of real time, whereas the “cost”

constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you width=244) (actual time=0.067..0.078 rows=1 loops=100) Index Cond: (t2.unique2 = t1.unique2) Total runtime: 14.452 ms Note that the “actual time” values are in milliseconds of real time, whereas the cost shown. Multiply by the loops value to get the total time actually spent in the node. The Total runtime shown by EXPLAIN ANALYZE includes executor start-up and shut-down time, as well as time spent processing

constant to be stored as a text constant instead of regclass: nextval(’foo’::text) foo is looked up at runtime Note that late binding was the only behavior supported in PostgreSQL releases before 8.1, so you width=244) (actual time=0.067..0.078 rows=1 loops=100) Index Cond: (t2.unique2 = t1.unique2) Total runtime: 14.452 ms Note that the “actual time” values are in milliseconds of real time, whereas the cost shown. Multiply by the loops value to get the total time actually spent in the node. The Total runtime shown by EXPLAIN ANALYZE includes executor start-up and shut-down time, as well as time spent processing