int.log

pgtest
...
BEGIN
DROP TABLE
NOTICE:  table "parent_1" does not exist, skipping
DROP TABLE
NOTICE:  table "parent_2" does not exist, skipping
DROP TABLE
NOTICE:  table "child_surrogate" does not exist, skipping
NOTICE:  table "child_natural" does not exist, skipping
DROP TABLE
CREATE TABLE
CREATE TABLE
CREATE TABLE
CREATE TABLE
INSERT 0 10000
INSERT 0 100
INSERT 0 1000000
INSERT 0 1000000
COMMIT
ANALYZE
ANALYZE
ANALYZE
ANALYZE
CREATE EXTENSION
> Benchmark before CLUSTER
INFO:  Run 1, Statement 1: 00:00:00.542427
INFO:  Run 1, Statement 2: 00:00:00.53563
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.538393
INFO:  Run 2, Statement 2: 00:00:00.533696
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.538329
INFO:  Run 3, Statement 2: 00:00:00.533263
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.538051
INFO:  Run 4, Statement 2: 00:00:00.533743
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.537748
INFO:  Run 5, Statement 2: 00:00:00.533501
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..192.98 rows=100 width=4) (actual time=0.073..0.137 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.030..0.031 rows=1 loops=1)
         Index Cond: (id = 4)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..183.43 rows=100 width=12) (actual time=0.039..0.084 rows=100 loops=1)
         Index Cond: (parent_1_id = 4)
 Planning Time: 0.496 ms
 Execution Time: 0.205 ms
(8 rows)

                                                                   QUERY PLAN                                                                    
-------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..192.98 rows=100 width=4) (actual time=0.053..0.096 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.024..0.025 rows=1 loops=1)
         Index Cond: (id = 4)
         Heap Fetches: 1
   ->  Index Scan using child_natural_pkey on child_natural c  (cost=0.42..183.43 rows=100 width=12) (actual time=0.024..0.047 rows=100 loops=1)
         Index Cond: (parent_1_id = 4)
 Planning Time: 0.511 ms
 Execution Time: 0.165 ms
(8 rows)

CLUSTER
ANALYZE
> Benchmark after CLUSTER on surrogate key
INFO:  Run 1, Statement 1: 00:00:00.537628
INFO:  Run 1, Statement 2: 00:00:00.536158
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.535762
INFO:  Run 2, Statement 2: 00:00:00.53523
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.536298
INFO:  Run 3, Statement 2: 00:00:00.539874
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.538574
INFO:  Run 4, Statement 2: 00:00:00.538613
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.539386
INFO:  Run 5, Statement 2: 00:00:00.538525
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..192.98 rows=100 width=4) (actual time=0.055..0.096 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.017..0.018 rows=1 loops=1)
         Index Cond: (id = 4)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..183.43 rows=100 width=12) (actual time=0.033..0.062 rows=100 loops=1)
         Index Cond: (parent_1_id = 4)
 Planning Time: 0.425 ms
 Execution Time: 0.140 ms
(8 rows)

CLUSTER
ANALYZE
> Benchmark after CLUSTER on natural key
INFO:  Run 1, Statement 1: 00:00:00.539064
INFO:  Run 1, Statement 2: 00:00:00.532681
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.5319
INFO:  Run 2, Statement 2: 00:00:00.531002
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.531616
INFO:  Run 3, Statement 2: 00:00:00.531787
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.531712
INFO:  Run 4, Statement 2: 00:00:00.532297
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.532229
INFO:  Run 5, Statement 2: 00:00:00.53321
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..192.98 rows=100 width=4) (actual time=0.064..0.104 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.017..0.018 rows=1 loops=1)
         Index Cond: (id = 4)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..183.43 rows=100 width=12) (actual time=0.043..0.070 rows=100 loops=1)
         Index Cond: (parent_1_id = 4)
 Planning Time: 0.397 ms
 Execution Time: 0.149 ms
(8 rows)

> Space requirements
                 objectname                  | objecttype | entries | size  
---------------------------------------------+------------+---------+-------
 child_surrogate_pkey                        | i          |   1e+06 | 21 MB
 child_surrogate_parent_1_id_parent_2_id_key | i          |   1e+06 | 21 MB
 child_surrogate                             | r          |   1e+06 | 50 MB
 child_natural_pkey                          | i          |   1e+06 | 21 MB
 child_natural                               | r          |   1e+06 | 42 MB
(5 rows)

LICENSE.txt

                                 Apache License
                           Version 2.0, January 2004
                        http://www.apache.org/licenses/

   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION

   1. Definitions.

      "License" shall mean the terms and conditions for use, reproduction,
      and distribution as defined by Sections 1 through 9 of this document.

      "Licensor" shall mean the copyright owner or entity authorized by
      the copyright owner that is granting the License.

      "Legal Entity" shall mean the union of the acting entity and all
      other entities that control, are controlled by, or are under common
      control with that entity. For the purposes of this definition,
      "control" means (i) the power, direct or indirect, to cause the
      direction or management of such entity, whether by contract or
      otherwise, or (ii) ownership of fifty percent (50%) or more of the
      outstanding shares, or (iii) beneficial ownership of such entity.

      "You" (or "Your") shall mean an individual or Legal Entity
      exercising permissions granted by this License.

      "Source" form shall mean the preferred form for making modifications,
      including but not limited to software source code, documentation
      source, and configuration files.

      "Object" form shall mean any form resulting from mechanical
      transformation or translation of a Source form, including but
      not limited to compiled object code, generated documentation,
      and conversions to other media types.

      "Work" shall mean the work of authorship, whether in Source or
      Object form, made available under the License, as indicated by a
      copyright notice that is included in or attached to the work
      (an example is provided in the Appendix below).

      "Derivative Works" shall mean any work, whether in Source or Object
      form, that is based on (or derived from) the Work and for which the
      editorial revisions, annotations, elaborations, or other modifications
      represent, as a whole, an original work of authorship. For the purposes
      of this License, Derivative Works shall not include works that remain
      separable from, or merely link (or bind by name) to the interfaces of,
      the Work and Derivative Works thereof.

      "Contribution" shall mean any work of authorship, including
      the original version of the Work and any modifications or additions
      to that Work or Derivative Works thereof, that is intentionally
      submitted to Licensor for inclusion in the Work by the copyright owner
      or by an individual or Legal Entity authorized to submit on behalf of
      the copyright owner. For the purposes of this definition, "submitted"
      means any form of electronic, verbal, or written communication sent
      to the Licensor or its representatives, including but not limited to
      communication on electronic mailing lists, source code control systems,
      and issue tracking systems that are managed by, or on behalf of, the
      Licensor for the purpose of discussing and improving the Work, but
      excluding communication that is conspicuously marked or otherwise
      designated in writing by the copyright owner as "Not a Contribution."

      "Contributor" shall mean Licensor and any individual or Legal Entity
      on behalf of whom a Contribution has been received by Licensor and
      subsequently incorporated within the Work.

   2. Grant of Copyright License. Subject to the terms and conditions of
      this License, each Contributor hereby grants to You a perpetual,
      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
      copyright license to reproduce, prepare Derivative Works of,
      publicly display, publicly perform, sublicense, and distribute the
      Work and such Derivative Works in Source or Object form.

   3. Grant of Patent License. Subject to the terms and conditions of
      this License, each Contributor hereby grants to You a perpetual,
      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
      (except as stated in this section) patent license to make, have made,
      use, offer to sell, sell, import, and otherwise transfer the Work,
      where such license applies only to those patent claims licensable
      by such Contributor that are necessarily infringed by their
      Contribution(s) alone or by combination of their Contribution(s)
      with the Work to which such Contribution(s) was submitted. If You
      institute patent litigation against any entity (including a
      cross-claim or counterclaim in a lawsuit) alleging that the Work
      or a Contribution incorporated within the Work constitutes direct
      or contributory patent infringement, then any patent licenses
      granted to You under this License for that Work shall terminate
      as of the date such litigation is filed.

   4. Redistribution. You may reproduce and distribute copies of the
      Work or Derivative Works thereof in any medium, with or without
      modifications, and in Source or Object form, provided that You
      meet the following conditions:

      (a) You must give any other recipients of the Work or
          Derivative Works a copy of this License; and

      (b) You must cause any modified files to carry prominent notices
          stating that You changed the files; and

      (c) You must retain, in the Source form of any Derivative Works
          that You distribute, all copyright, patent, trademark, and
          attribution notices from the Source form of the Work,
          excluding those notices that do not pertain to any part of
          the Derivative Works; and

      (d) If the Work includes a "NOTICE" text file as part of its
          distribution, then any Derivative Works that You distribute must
          include a readable copy of the attribution notices contained
          within such NOTICE file, excluding those notices that do not
          pertain to any part of the Derivative Works, in at least one
          of the following places: within a NOTICE text file distributed
          as part of the Derivative Works; within the Source form or
          documentation, if provided along with the Derivative Works; or,
          within a display generated by the Derivative Works, if and
          wherever such third-party notices normally appear. The contents
          of the NOTICE file are for informational purposes only and
          do not modify the License. You may add Your own attribution
          notices within Derivative Works that You distribute, alongside
          or as an addendum to the NOTICE text from the Work, provided
          that such additional attribution notices cannot be construed
          as modifying the License.

      You may add Your own copyright statement to Your modifications and
      may provide additional or different license terms and conditions
      for use, reproduction, or distribution of Your modifications, or
      for any such Derivative Works as a whole, provided Your use,
      reproduction, and distribution of the Work otherwise complies with
      the conditions stated in this License.

   5. Submission of Contributions. Unless You explicitly state otherwise,
      any Contribution intentionally submitted for inclusion in the Work
      by You to the Licensor shall be under the terms and conditions of
      this License, without any additional terms or conditions.
      Notwithstanding the above, nothing herein shall supersede or modify
      the terms of any separate license agreement you may have executed
      with Licensor regarding such Contributions.

   6. Trademarks. This License does not grant permission to use the trade
      names, trademarks, service marks, or product names of the Licensor,
      except as required for reasonable and customary use in describing the
      origin of the Work and reproducing the content of the NOTICE file.

   7. Disclaimer of Warranty. Unless required by applicable law or
      agreed to in writing, Licensor provides the Work (and each
      Contributor provides its Contributions) on an "AS IS" BASIS,
      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
      implied, including, without limitation, any warranties or conditions
      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
      PARTICULAR PURPOSE. You are solely responsible for determining the
      appropriateness of using or redistributing the Work and assume any
      risks associated with Your exercise of permissions under this License.

   8. Limitation of Liability. In no event and under no legal theory,
      whether in tort (including negligence), contract, or otherwise,
      unless required by applicable law (such as deliberate and grossly
      negligent acts) or agreed to in writing, shall any Contributor be
      liable to You for damages, including any direct, indirect, special,
      incidental, or consequential damages of any character arising as a
      result of this License or out of the use or inability to use the
      Work (including but not limited to damages for loss of goodwill,
      work stoppage, computer failure or malfunction, or any and all
      other commercial damages or losses), even if such Contributor
      has been advised of the possibility of such damages.

   9. Accepting Warranty or Additional Liability. While redistributing
      the Work or Derivative Works thereof, You may choose to offer,
      and charge a fee for, acceptance of support, warranty, indemnity,
      or other liability obligations and/or rights consistent with this
      License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,
      defend, and hold each Contributor harmless for any liability
      incurred by, or claims asserted against, such Contributor by reason
      of your accepting any such warranty or additional liability.

   END OF TERMS AND CONDITIONS

   APPENDIX: How to apply the Apache License to your work.

      To apply the Apache License to your work, attach the following
      boilerplate notice, with the fields enclosed by brackets "[]"
      replaced with your own identifying information. (Don't include
      the brackets!)  The text should be enclosed in the appropriate
      comment syntax for the file format. We also recommend that a
      file or class name and description of purpose be included on the
      same "printed page" as the copyright notice for easier
      identification within third-party archives.

   Copyright [yyyy] [name of copyright owner]

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.

mysql-benchmark.sql

-- Copyright Data Geekery GmbH
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
--     http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
DO $$
DECLARE
  v_ts TIMESTAMP;
  v_repeat CONSTANT INT := 10000;
  rec RECORD;
BEGIN

  -- Repeat the whole benchmark several times to avoid warmup penalty
  FOR r IN 1..5 LOOP
    v_ts := clock_timestamp();

    FOR i IN 1..v_repeat LOOP
      FOR rec IN (
    SELECT c.payload_1 + c.payload_2 AS a FROM parent_1 AS p1 JOIN child_surrogate AS c ON p1.id = c.parent_1_id WHERE p1.id = (SELECT id FROM parent_1 TABLESAMPLE SYSTEM_ROWS(1))
      ) LOOP
        NULL;
      END LOOP;
    END LOOP;

    RAISE INFO 'Run %, Statement 1: %', r, (clock_timestamp() - v_ts);
    v_ts := clock_timestamp();

    FOR i IN 1..v_repeat LOOP
      FOR rec IN (
    SELECT c.payload_1 + c.payload_2 AS a FROM parent_1 AS p1 JOIN child_natural AS c ON p1.id = c.parent_1_id WHERE p1.id = (SELECT id FROM parent_1 TABLESAMPLE SYSTEM_ROWS(1))
      ) LOOP
        NULL;
      END LOOP;
    END LOOP;

    RAISE INFO 'Run %, Statement 2: %', r, (clock_timestamp() - v_ts);
    RAISE INFO '';
  END LOOP;

  RAISE INFO '';
  RAISE INFO 'Copyright Data Geekery GmbH';
  RAISE INFO 'https://www.jooq.org/benchmark';
END$$;

mysql-setup.sql

BEGIN TRANSACTION;

drop table if exists parent_1;
drop table if exists parent_2;
drop table if exists child_surrogate;
drop table if exists child_natural;

create table parent_1 (id varchar not null primary key);
create table parent_2 (id varchar not null primary key);

create table child_surrogate (
  id serial, 
  parent_1_id varchar not null references parent_1, 
  parent_2_id varchar not null references parent_2, 
  payload_1 int, 
  payload_2 int, 
  primary key (id), 
  unique (parent_1_id, parent_2_id)
) -- ENGINE = MyISAM
;

create table child_natural (
  parent_1_id varchar not null references parent_1, 
  parent_2_id varchar not null references parent_2, 
  payload_1 int, 
  payload_2 int, 
  primary key (parent_1_id, parent_2_id)
) -- ENGINE = MyISAM
;


insert into parent_1 (id)
with recursive t as (
  select 1000000000 v
  union all
  select v + 1 from t where v < (1000000000 + 10000)
)
select v
from t;

insert into parent_2 (id)
with recursive t as (
  select 1000000000 v
  union all
  select v + 1 from t where v < (1000000000 + 100)
)
select '' || v
from t;

insert into child_surrogate (parent_1_id, parent_2_id, payload_1, payload_2)
select p1.id, p2.id, 1, 1
from parent_1 as p1, parent_2 as p2;


insert into child_natural (parent_1_id, parent_2_id, payload_1, payload_2)
select p1.id, p2.id, 1, 1
from parent_1 as p1, parent_2 as p2;

COMMIT;

analyze parent_1;
analyze parent_2;
analyze child_surrogate;
analyze child_natural;

create extension tsm_system_rows;

pg.bash

#!/bin/bash

set -o errexit

pg()
{
    docker exec -i pgtest psql -U postgres "$@"
}

recreate_pg_container()
{
    docker rm -f pgtest 2>/dev/null || true
    docker run -d --name pgtest postgres:11 >/dev/null 2>&1

    while ! pg -c 'SELECT 1' >/dev/null 2>&1; do printf . && sleep 1; done
    printf '\n'
}

main()
{
    recreate_pg_container

    pg < mysql-setup.sql

    printf '> Benchmark before CLUSTER\n'

    pg < mysql-benchmark.sql

    pg -c "EXPLAIN ANALYZE SELECT c.payload_1 + c.payload_2 AS a FROM parent_1 AS p1 JOIN child_surrogate AS c ON p1.id = c.parent_1_id WHERE p1.id = '1000000004'"
    pg -c "EXPLAIN ANALYZE SELECT c.payload_1 + c.payload_2 AS a FROM parent_1 AS p1 JOIN child_natural AS c ON p1.id = c.parent_1_id WHERE p1.id = '1000000004'"

    pg -c 'CLUSTER child_surrogate USING child_surrogate_pkey'
    pg -c 'ANALYZE child_surrogate'
    printf '> Benchmark after CLUSTER on surrogate key\n'
    pg < mysql-benchmark.sql
    pg -c "EXPLAIN ANALYZE SELECT c.payload_1 + c.payload_2 AS a FROM parent_1 AS p1 JOIN child_surrogate AS c ON p1.id = c.parent_1_id WHERE p1.id = '1000000004'"

    pg -c 'CLUSTER child_surrogate USING child_surrogate_parent_1_id_parent_2_id_key'
    pg -c 'ANALYZE child_surrogate'
    printf '> Benchmark after CLUSTER on natural key\n'
    pg < mysql-benchmark.sql
    pg -c "EXPLAIN ANALYZE SELECT c.payload_1 + c.payload_2 AS a FROM parent_1 AS p1 JOIN child_surrogate AS c ON p1.id = c.parent_1_id WHERE p1.id = '1000000004'"

    # https://wiki-bsse.ethz.ch/display/ITDOC/Check+size+of+tables+and+objects+in+PostgreSQL+database
    printf '> Space requirements\n'
    pg -c "SELECT
    relname AS objectname,
    relkind AS objecttype,
    reltuples AS entries, pg_size_pretty(relpages::bigint*8*1024) AS size
    FROM pg_class
    WHERE relpages >= 8 AND relname LIKE 'child_%'
    ORDER BY relname DESC"
}

main

varchar-1.log

pgtest
...
BEGIN
DROP TABLE
NOTICE:  table "parent_1" does not exist, skipping
DROP TABLE
NOTICE:  table "parent_2" does not exist, skipping
NOTICE:  table "child_surrogate" does not exist, skipping
DROP TABLE
NOTICE:  table "child_natural" does not exist, skipping
DROP TABLE
CREATE TABLE
CREATE TABLE
CREATE TABLE
CREATE TABLE
INSERT 0 10000
INSERT 0 100
INSERT 0 1000000
INSERT 0 1000000
COMMIT
ANALYZE
ANALYZE
ANALYZE
ANALYZE
CREATE EXTENSION
> Benchmark before CLUSTER
INFO:  Run 1, Statement 1: 00:00:00.654799
INFO:  Run 1, Statement 2: 00:00:00.639652
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.648762
INFO:  Run 2, Statement 2: 00:00:00.640546
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.649607
INFO:  Run 3, Statement 2: 00:00:00.641307
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.650854
INFO:  Run 4, Statement 2: 00:00:00.62841
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.63609
INFO:  Run 5, Statement 2: 00:00:00.625045
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..268.50 rows=100 width=4) (actual time=0.094..0.158 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.029..0.030 rows=1 loops=1)
         Index Cond: (id = '4'::text)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..258.94 rows=100 width=12) (actual time=0.060..0.105 rows=100 loops=1)
         Index Cond: ((parent_1_id)::text = '4'::text)
 Planning Time: 0.543 ms
 Execution Time: 0.221 ms
(8 rows)

                                                                   QUERY PLAN                                                                    
-------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..264.08 rows=100 width=4) (actual time=0.068..0.108 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.028..0.028 rows=1 loops=1)
         Index Cond: (id = '4'::text)
         Heap Fetches: 1
   ->  Index Scan using child_natural_pkey on child_natural c  (cost=0.42..254.53 rows=100 width=12) (actual time=0.036..0.059 rows=100 loops=1)
         Index Cond: ((parent_1_id)::text = '4'::text)
 Planning Time: 0.489 ms
 Execution Time: 0.165 ms
(8 rows)

CLUSTER
ANALYZE
> Benchmark after CLUSTER on surrogate key
INFO:  Run 1, Statement 1: 00:00:00.640201
INFO:  Run 1, Statement 2: 00:00:00.634613
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.640532
INFO:  Run 2, Statement 2: 00:00:00.637953
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.639498
INFO:  Run 3, Statement 2: 00:00:00.637909
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.63956
INFO:  Run 4, Statement 2: 00:00:00.633978
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.624921
INFO:  Run 5, Statement 2: 00:00:00.628745
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..265.85 rows=100 width=4) (actual time=0.089..0.144 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.031..0.031 rows=1 loops=1)
         Index Cond: (id = '4'::text)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..256.30 rows=100 width=12) (actual time=0.054..0.089 rows=100 loops=1)
         Index Cond: ((parent_1_id)::text = '4'::text)
 Planning Time: 0.613 ms
 Execution Time: 0.212 ms
(8 rows)

CLUSTER
ANALYZE
> Benchmark after CLUSTER on natural key
INFO:  Run 1, Statement 1: 00:00:00.625631
INFO:  Run 1, Statement 2: 00:00:00.626623
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.60795
INFO:  Run 2, Statement 2: 00:00:00.621584
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.608345
INFO:  Run 3, Statement 2: 00:00:00.621684
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.608526
INFO:  Run 4, Statement 2: 00:00:00.633827
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.622683
INFO:  Run 5, Statement 2: 00:00:00.637831
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..192.98 rows=100 width=4) (actual time=0.084..0.127 rows=100 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=4) (actual time=0.028..0.029 rows=1 loops=1)
         Index Cond: (id = '4'::text)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..183.43 rows=100 width=12) (actual time=0.051..0.076 rows=100 loops=1)
         Index Cond: ((parent_1_id)::text = '4'::text)
 Planning Time: 0.609 ms
 Execution Time: 0.188 ms
(8 rows)

> Space requirements
                 objectname                  | objecttype | entries | size  
---------------------------------------------+------------+---------+-------
 child_surrogate_pkey                        | i          |   1e+06 | 21 MB
 child_surrogate_parent_1_id_parent_2_id_key | i          |   1e+06 | 22 MB
 child_surrogate                             | r          |   1e+06 | 50 MB
 child_natural_pkey                          | i          |   1e+06 | 39 MB
 child_natural                               | r          |   1e+06 | 42 MB
(5 rows)

varchar-10.log

pgtest
...
BEGIN
DROP TABLE
NOTICE:  table "parent_1" does not exist, skipping
DROP TABLE
NOTICE:  table "parent_2" does not exist, skipping
NOTICE:  table "child_surrogate" does not exist, skipping
DROP TABLE
NOTICE:  table "child_natural" does not exist, skipping
DROP TABLE
CREATE TABLE
CREATE TABLE
CREATE TABLE
CREATE TABLE
INSERT 0 10001
INSERT 0 101
INSERT 0 1010101
INSERT 0 1010101
COMMIT
ANALYZE
ANALYZE
ANALYZE
ANALYZE
CREATE EXTENSION
> Benchmark before CLUSTER
INFO:  Run 1, Statement 1: 00:00:00.664437
INFO:  Run 1, Statement 2: 00:00:00.657545
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.66128
INFO:  Run 2, Statement 2: 00:00:00.65369
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.661375
INFO:  Run 3, Statement 2: 00:00:00.65439
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.661147
INFO:  Run 4, Statement 2: 00:00:00.655771
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.657891
INFO:  Run 5, Statement 2: 00:00:00.655252
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..194.76 rows=101 width=4) (actual time=0.085..0.135 rows=101 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=11) (actual time=0.030..0.030 rows=1 loops=1)
         Index Cond: (id = '1000000004'::text)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..185.19 rows=101 width=19) (actual time=0.051..0.087 rows=101 loops=1)
         Index Cond: ((parent_1_id)::text = '1000000004'::text)
 Planning Time: 0.476 ms
 Execution Time: 0.186 ms
(8 rows)

                                                                   QUERY PLAN                                                                    
-------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..194.76 rows=101 width=4) (actual time=0.100..0.158 rows=101 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=11) (actual time=0.034..0.035 rows=1 loops=1)
         Index Cond: (id = '1000000004'::text)
         Heap Fetches: 1
   ->  Index Scan using child_natural_pkey on child_natural c  (cost=0.42..185.19 rows=101 width=19) (actual time=0.060..0.099 rows=101 loops=1)
         Index Cond: ((parent_1_id)::text = '1000000004'::text)
 Planning Time: 0.607 ms
 Execution Time: 0.221 ms
(8 rows)

CLUSTER
ANALYZE
> Benchmark after CLUSTER on surrogate key
INFO:  Run 1, Statement 1: 00:00:00.65983
INFO:  Run 1, Statement 2: 00:00:00.656176
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.65419
INFO:  Run 2, Statement 2: 00:00:00.653798
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.654595
INFO:  Run 3, Statement 2: 00:00:00.653591
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.654671
INFO:  Run 4, Statement 2: 00:00:00.650243
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.650813
INFO:  Run 5, Statement 2: 00:00:00.65049
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..192.98 rows=100 width=4) (actual time=0.098..0.159 rows=101 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=11) (actual time=0.038..0.038 rows=1 loops=1)
         Index Cond: (id = '1000000004'::text)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..183.43 rows=100 width=19) (actual time=0.055..0.100 rows=101 loops=1)
         Index Cond: ((parent_1_id)::text = '1000000004'::text)
 Planning Time: 0.687 ms
 Execution Time: 0.227 ms
(8 rows)

CLUSTER
ANALYZE
> Benchmark after CLUSTER on natural key
INFO:  Run 1, Statement 1: 00:00:00.655081
INFO:  Run 1, Statement 2: 00:00:00.652315
INFO:  
INFO:  Run 2, Statement 1: 00:00:00.651649
INFO:  Run 2, Statement 2: 00:00:00.650471
INFO:  
INFO:  Run 3, Statement 1: 00:00:00.653662
INFO:  Run 3, Statement 2: 00:00:00.651739
INFO:  
INFO:  Run 4, Statement 1: 00:00:00.653825
INFO:  Run 4, Statement 2: 00:00:00.65326
INFO:  
INFO:  Run 5, Statement 1: 00:00:00.655352
INFO:  Run 5, Statement 2: 00:00:00.655131
INFO:  
INFO:  
INFO:  Copyright Data Geekery GmbH
INFO:  https://www.jooq.org/benchmark
DO
                                                                                 QUERY PLAN                                                                                 
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Nested Loop  (cost=0.71..194.76 rows=101 width=4) (actual time=0.068..0.116 rows=101 loops=1)
   ->  Index Only Scan using parent_1_pkey on parent_1 p1  (cost=0.29..8.30 rows=1 width=11) (actual time=0.027..0.028 rows=1 loops=1)
         Index Cond: (id = '1000000004'::text)
         Heap Fetches: 1
   ->  Index Scan using child_surrogate_parent_1_id_parent_2_id_key on child_surrogate c  (cost=0.42..185.19 rows=101 width=19) (actual time=0.036..0.068 rows=101 loops=1)
         Index Cond: ((parent_1_id)::text = '1000000004'::text)
 Planning Time: 0.511 ms
 Execution Time: 0.167 ms
(8 rows)

> Space requirements
                 objectname                  | objecttype |  entries   | size  
---------------------------------------------+------------+------------+-------
 child_surrogate_pkey                        | i          | 1.0101e+06 | 22 MB
 child_surrogate_parent_1_id_parent_2_id_key | i          | 1.0101e+06 | 39 MB
 child_surrogate                             | r          | 1.0101e+06 | 66 MB
 child_natural_pkey                          | i          | 1.0101e+06 | 39 MB
 child_natural                               | r          | 1.0101e+06 | 58 MB
(5 rows)