Baoding-FenShuaJiang
/
Green_GoodERP18_FSJ_Standard
Suivre 1
Ajouter aux favoris 0
Wiki 捐赠
gooderp18绿色标准版
Vous ne pouvez pas sélectionner plus de 25 sujets Les noms de sujets doivent commencer par une lettre ou un nombre, peuvent contenir des tirets ('-') et peuvent comporter jusqu'à 35 caractères.
Aborescence: 0f75e31513
Branches Tags
${ item.name }
Créer la branche ${ searchTerm }
de '0f75e31513'
${ noResults }
Green_GoodERP18_FSJ_Standard/PostgreSQL/doc/postgresql/html/pgbench.html

883 lignes
78KB
Brut Annotations Historique 

  1. <?xml version="1.0" encoding="UTF-8" standalone="no"?>

  2. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>pgbench</title><link rel="stylesheet" type="text/css" href="stylesheet.css" /><link rev="made" href="pgsql-docs@lists.postgresql.org" /><meta name="generator" content="DocBook XSL Stylesheets V1.79.1" /><link rel="prev" href="app-pgbasebackup.html" title="pg_basebackup" /><link rel="next" href="app-pgconfig.html" title="pg_config" /></head><body><div xmlns="http://www.w3.org/TR/xhtml1/transitional" class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="5" align="center"><span xmlns="http://www.w3.org/1999/xhtml" class="application">pgbench</span></th></tr><tr><td width="10%" align="left"><a accesskey="p" href="app-pgbasebackup.html" title="pg_basebackup">Prev</a> </td><td width="10%" align="left"><a accesskey="u" href="reference-client.html" title="PostgreSQL Client Applications">Up</a></td><th width="60%" align="center">PostgreSQL Client Applications</th><td width="10%" align="right"><a accesskey="h" href="index.html" title="PostgreSQL 12.4 Documentation">Home</a></td><td width="10%" align="right"> <a accesskey="n" href="app-pgconfig.html" title="pg_config">Next</a></td></tr></table><hr></hr></div><div class="refentry" id="PGBENCH"><div class="titlepage"></div><a id="id-1.9.4.10.1" class="indexterm"></a><div class="refnamediv"><h2><span class="refentrytitle"><span class="application">pgbench</span></span></h2><p>pgbench — run a benchmark test on <span class="productname">PostgreSQL</span></p></div><div class="refsynopsisdiv"><h2>Synopsis</h2><div class="cmdsynopsis"><p id="id-1.9.4.10.4.1"><code class="command">pgbench</code>  <code class="option">-i</code>  [<em class="replaceable"><code>option</code></em>...] [<em class="replaceable"><code>dbname</code></em>]</p></div><div class="cmdsynopsis"><p id="id-1.9.4.10.4.2"><code class="command">pgbench</code> [<em class="replaceable"><code>option</code></em>...] [<em class="replaceable"><code>dbname</code></em>]</p></div></div><div class="refsect1" id="id-1.9.4.10.5"><h2>Description</h2><p>

  3.   <span class="application">pgbench</span> is a simple program for running benchmark

  4.   tests on <span class="productname">PostgreSQL</span>.  It runs the same sequence of SQL

  5.   commands over and over, possibly in multiple concurrent database sessions,

  6.   and then calculates the average transaction rate (transactions per second).

  7.   By default, <span class="application">pgbench</span> tests a scenario that is

  8.   loosely based on TPC-B, involving five <code class="command">SELECT</code>,

  9.   <code class="command">UPDATE</code>, and <code class="command">INSERT</code> commands per transaction.

  10.   However, it is easy to test other cases by writing your own transaction

  11.   script files.

  12.  </p><p>

  13.   Typical output from <span class="application">pgbench</span> looks like:

  14. 

  15. </p><pre class="screen">

  16. transaction type: &lt;builtin: TPC-B (sort of)&gt;

  17. scaling factor: 10

  18. query mode: simple

  19. number of clients: 10

  20. number of threads: 1

  21. number of transactions per client: 1000

  22. number of transactions actually processed: 10000/10000

  23. tps = 85.184871 (including connections establishing)

  24. tps = 85.296346 (excluding connections establishing)

  25. </pre><p>

  26. 

  27.   The first six lines report some of the most important parameter

  28.   settings.  The next line reports the number of transactions completed

  29.   and intended (the latter being just the product of number of clients

  30.   and number of transactions per client); these will be equal unless the run

  31.   failed before completion.  (In <code class="option">-T</code> mode, only the actual

  32.   number of transactions is printed.)

  33.   The last two lines report the number of transactions per second,

  34.   figured with and without counting the time to start database sessions.

  35.  </p><p>

  36.    The default TPC-B-like transaction test requires specific tables to be

  37.    set up beforehand.  <span class="application">pgbench</span> should be invoked with

  38.    the <code class="option">-i</code> (initialize) option to create and populate these

  39.    tables.  (When you are testing a custom script, you don't need this

  40.    step, but will instead need to do whatever setup your test needs.)

  41.    Initialization looks like:

  42. 

  43. </p><pre class="programlisting">

  44. pgbench -i [<span class="optional"> <em class="replaceable"><code>other-options</code></em> </span>] <em class="replaceable"><code>dbname</code></em>

  45. </pre><p>

  46. 

  47.    where <em class="replaceable"><code>dbname</code></em> is the name of the already-created

  48.    database to test in.  (You may also need <code class="option">-h</code>,

  49.    <code class="option">-p</code>, and/or <code class="option">-U</code> options to specify how to

  50.    connect to the database server.)

  51.   </p><div class="caution"><h3 class="title">Caution</h3><p>

  52.     <code class="literal">pgbench -i</code> creates four tables <code class="structname">pgbench_accounts</code>,

  53.     <code class="structname">pgbench_branches</code>, <code class="structname">pgbench_history</code>, and

  54.     <code class="structname">pgbench_tellers</code>,

  55.     destroying any existing tables of these names.

  56.     Be very careful to use another database if you have tables having these

  57.     names!

  58.    </p></div><p>

  59.    At the default <span class="quote">“<span class="quote">scale factor</span>”</span> of 1, the tables initially

  60.    contain this many rows:

  61. </p><pre class="screen">

  62. table                   # of rows

  63. ---------------------------------

  64. pgbench_branches        1

  65. pgbench_tellers         10

  66. pgbench_accounts        100000

  67. pgbench_history         0

  68. </pre><p>

  69.    You can (and, for most purposes, probably should) increase the number

  70.    of rows by using the <code class="option">-s</code> (scale factor) option.  The

  71.    <code class="option">-F</code> (fillfactor) option might also be used at this point.

  72.   </p><p>

  73.    Once you have done the necessary setup, you can run your benchmark

  74.    with a command that doesn't include <code class="option">-i</code>, that is

  75. 

  76. </p><pre class="programlisting">

  77. pgbench [<span class="optional"> <em class="replaceable"><code>options</code></em> </span>] <em class="replaceable"><code>dbname</code></em>

  78. </pre><p>

  79. 

  80.    In nearly all cases, you'll need some options to make a useful test.

  81.    The most important options are <code class="option">-c</code> (number of clients),

  82.    <code class="option">-t</code> (number of transactions), <code class="option">-T</code> (time limit),

  83.    and <code class="option">-f</code> (specify a custom script file).

  84.    See below for a full list.

  85.   </p></div><div class="refsect1" id="id-1.9.4.10.6"><h2>Options</h2><p>

  86.    The following is divided into three subsections.  Different options are

  87.    used during database initialization and while running benchmarks, but some

  88.    options are useful in both cases.

  89.   </p><div class="refsect2" id="PGBENCH-INIT-OPTIONS"><h3>Initialization Options</h3><p>

  90.     <span class="application">pgbench</span> accepts the following command-line

  91.     initialization arguments:

  92. 

  93.     </p><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="option">-i</code><br /></span><span class="term"><code class="option">--initialize</code></span></dt><dd><p>

  94.         Required to invoke initialization mode.

  95.        </p></dd><dt><span class="term"><code class="option">-I <em class="replaceable"><code>init_steps</code></em></code><br /></span><span class="term"><code class="option">--init-steps=<em class="replaceable"><code>init_steps</code></em></code></span></dt><dd><p>

  96.         Perform just a selected set of the normal initialization steps.

  97.         <em class="replaceable"><code>init_steps</code></em> specifies the

  98.         initialization steps to be performed, using one character per step.

  99.         Each step is invoked in the specified order.

  100.         The default is <code class="literal">dtgvp</code>.

  101.         The available steps are:

  102. 

  103.         </p><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="literal">d</code> (Drop)</span></dt><dd><p>

  104.             Drop any existing <span class="application">pgbench</span> tables.

  105.            </p></dd><dt><span class="term"><code class="literal">t</code> (create Tables)</span></dt><dd><p>

  106.             Create the tables used by the

  107.             standard <span class="application">pgbench</span> scenario, namely

  108.             <code class="structname">pgbench_accounts</code>,

  109.             <code class="structname">pgbench_branches</code>,

  110.             <code class="structname">pgbench_history</code>, and

  111.             <code class="structname">pgbench_tellers</code>.

  112.            </p></dd><dt><span class="term"><code class="literal">g</code> (Generate data)</span></dt><dd><p>

  113.             Generate data and load it into the standard tables,

  114.             replacing any data already present.

  115.            </p></dd><dt><span class="term"><code class="literal">v</code> (Vacuum)</span></dt><dd><p>

  116.             Invoke <code class="command">VACUUM</code> on the standard tables.

  117.            </p></dd><dt><span class="term"><code class="literal">p</code> (create Primary keys)</span></dt><dd><p>

  118.             Create primary key indexes on the standard tables.

  119.            </p></dd><dt><span class="term"><code class="literal">f</code> (create Foreign keys)</span></dt><dd><p>

  120.             Create foreign key constraints between the standard tables.

  121.             (Note that this step is not performed by default.)

  122.            </p></dd></dl></div><p>

  123.        </p></dd><dt><span class="term"><code class="option">-F</code> <em class="replaceable"><code>fillfactor</code></em><br /></span><span class="term"><code class="option">--fillfactor=</code><em class="replaceable"><code>fillfactor</code></em></span></dt><dd><p>

  124.         Create the <code class="structname">pgbench_accounts</code>,

  125.         <code class="structname">pgbench_tellers</code> and

  126.         <code class="structname">pgbench_branches</code> tables with the given fillfactor.

  127.         Default is 100.

  128.        </p></dd><dt><span class="term"><code class="option">-n</code><br /></span><span class="term"><code class="option">--no-vacuum</code></span></dt><dd><p>

  129.         Perform no vacuuming during initialization.

  130.         (This option suppresses the <code class="literal">v</code> initialization step,

  131.         even if it was specified in <code class="option">-I</code>.)

  132.        </p></dd><dt><span class="term"><code class="option">-q</code><br /></span><span class="term"><code class="option">--quiet</code></span></dt><dd><p>

  133.         Switch logging to quiet mode, producing only one progress message per 5

  134.         seconds. The default logging prints one message each 100000 rows, which

  135.         often outputs many lines per second (especially on good hardware).

  136.        </p></dd><dt><span class="term"><code class="option">-s</code> <em class="replaceable"><code>scale_factor</code></em><br /></span><span class="term"><code class="option">--scale=</code><em class="replaceable"><code>scale_factor</code></em></span></dt><dd><p>

  137.         Multiply the number of rows generated by the scale factor.

  138.         For example, <code class="literal">-s 100</code> will create 10,000,000 rows

  139.         in the <code class="structname">pgbench_accounts</code> table. Default is 1.

  140.         When the scale is 20,000 or larger, the columns used to

  141.         hold account identifiers (<code class="structfield">aid</code> columns)

  142.         will switch to using larger integers (<code class="type">bigint</code>),

  143.         in order to be big enough to hold the range of account

  144.         identifiers.

  145.        </p></dd><dt><span class="term"><code class="option">--foreign-keys</code></span></dt><dd><p>

  146.         Create foreign key constraints between the standard tables.

  147.         (This option adds the <code class="literal">f</code> step to the initialization

  148.         step sequence, if it is not already present.)

  149.        </p></dd><dt><span class="term"><code class="option">--index-tablespace=<em class="replaceable"><code>index_tablespace</code></em></code></span></dt><dd><p>

  150.         Create indexes in the specified tablespace, rather than the default

  151.         tablespace.

  152.        </p></dd><dt><span class="term"><code class="option">--tablespace=<em class="replaceable"><code>tablespace</code></em></code></span></dt><dd><p>

  153.         Create tables in the specified tablespace, rather than the default

  154.         tablespace.

  155.        </p></dd><dt><span class="term"><code class="option">--unlogged-tables</code></span></dt><dd><p>

  156.         Create all tables as unlogged tables, rather than permanent tables.

  157.        </p></dd></dl></div><p>

  158.    </p></div><div class="refsect2" id="PGBENCH-RUN-OPTIONS"><h3>Benchmarking Options</h3><p>

  159.     <span class="application">pgbench</span> accepts the following command-line

  160.     benchmarking arguments:

  161. 

  162.     </p><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="option">-b</code> <em class="replaceable"><code>scriptname[@weight]</code></em><br /></span><span class="term"><code class="option">--builtin</code>=<em class="replaceable"><code>scriptname[@weight]</code></em></span></dt><dd><p>

  163.         Add the specified built-in script to the list of executed scripts.

  164.         An optional integer weight after <code class="literal">@</code> allows to adjust the

  165.         probability of drawing the script.  If not specified, it is set to 1.

  166.         Available built-in scripts are: <code class="literal">tpcb-like</code>,

  167.         <code class="literal">simple-update</code> and <code class="literal">select-only</code>.

  168.         Unambiguous prefixes of built-in names are accepted.

  169.         With special name <code class="literal">list</code>, show the list of built-in scripts

  170.         and exit immediately.

  171.        </p></dd><dt><span class="term"><code class="option">-c</code> <em class="replaceable"><code>clients</code></em><br /></span><span class="term"><code class="option">--client=</code><em class="replaceable"><code>clients</code></em></span></dt><dd><p>

  172.         Number of clients simulated, that is, number of concurrent database

  173.         sessions.  Default is 1.

  174.        </p></dd><dt><span class="term"><code class="option">-C</code><br /></span><span class="term"><code class="option">--connect</code></span></dt><dd><p>

  175.         Establish a new connection for each transaction, rather than

  176.         doing it just once per client session.

  177.         This is useful to measure the connection overhead.

  178.        </p></dd><dt><span class="term"><code class="option">-d</code><br /></span><span class="term"><code class="option">--debug</code></span></dt><dd><p>

  179.         Print debugging output.

  180.        </p></dd><dt><span class="term"><code class="option">-D</code> <em class="replaceable"><code>varname</code></em><code class="literal">=</code><em class="replaceable"><code>value</code></em><br /></span><span class="term"><code class="option">--define=</code><em class="replaceable"><code>varname</code></em><code class="literal">=</code><em class="replaceable"><code>value</code></em></span></dt><dd><p>

  181.         Define a variable for use by a custom script (see below).

  182.         Multiple <code class="option">-D</code> options are allowed.

  183.        </p></dd><dt><span class="term"><code class="option">-f</code> <em class="replaceable"><code>filename[@weight]</code></em><br /></span><span class="term"><code class="option">--file=</code><em class="replaceable"><code>filename[@weight]</code></em></span></dt><dd><p>

  184.         Add a transaction script read from <em class="replaceable"><code>filename</code></em> to

  185.         the list of executed scripts.

  186.         An optional integer weight after <code class="literal">@</code> allows to adjust the

  187.         probability of drawing the test.

  188.         See below for details.

  189.        </p></dd><dt><span class="term"><code class="option">-j</code> <em class="replaceable"><code>threads</code></em><br /></span><span class="term"><code class="option">--jobs=</code><em class="replaceable"><code>threads</code></em></span></dt><dd><p>

  190.         Number of worker threads within <span class="application">pgbench</span>.

  191.         Using more than one thread can be helpful on multi-CPU machines.

  192.         Clients are distributed as evenly as possible among available threads.

  193.         Default is 1.

  194.        </p></dd><dt><span class="term"><code class="option">-l</code><br /></span><span class="term"><code class="option">--log</code></span></dt><dd><p>

  195.         Write information about each transaction to a log file.

  196.         See below for details.

  197.        </p></dd><dt><span class="term"><code class="option">-L</code> <em class="replaceable"><code>limit</code></em><br /></span><span class="term"><code class="option">--latency-limit=</code><em class="replaceable"><code>limit</code></em></span></dt><dd><p>

  198.         Transactions that last more than <em class="replaceable"><code>limit</code></em> milliseconds

  199.         are counted and reported separately, as <em class="firstterm">late</em>.

  200.        </p><p>

  201.         When throttling is used (<code class="option">--rate=...</code>), transactions that

  202.         lag behind schedule by more than <em class="replaceable"><code>limit</code></em> ms, and thus

  203.         have no hope of meeting the latency limit, are not sent to the server

  204.         at all. They are counted and reported separately as

  205.         <em class="firstterm">skipped</em>.

  206.        </p></dd><dt><span class="term"><code class="option">-M</code> <em class="replaceable"><code>querymode</code></em><br /></span><span class="term"><code class="option">--protocol=</code><em class="replaceable"><code>querymode</code></em></span></dt><dd><p>

  207.         Protocol to use for submitting queries to the server:

  208.           </p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p><code class="literal">simple</code>: use simple query protocol.</p></li><li class="listitem"><p><code class="literal">extended</code>: use extended query protocol.</p></li><li class="listitem"><p><code class="literal">prepared</code>: use extended query protocol with prepared statements.</p></li></ul></div><p>

  209. 

  210.         In the <code class="literal">prepared</code> mode, <span class="application">pgbench</span>

  211.         reuses the parse analysis result starting from the second query

  212.         iteration, so <span class="application">pgbench</span> runs faster

  213.         than in other modes.

  214.        </p><p>

  215.         The default is simple query protocol.  (See <a class="xref" href="protocol.html" title="Chapter 52. Frontend/Backend Protocol">Chapter 52</a>

  216.         for more information.)

  217.        </p></dd><dt><span class="term"><code class="option">-n</code><br /></span><span class="term"><code class="option">--no-vacuum</code></span></dt><dd><p>

  218.         Perform no vacuuming before running the test.

  219.         This option is <span class="emphasis"><em>necessary</em></span>

  220.         if you are running a custom test scenario that does not include

  221.         the standard tables <code class="structname">pgbench_accounts</code>,

  222.         <code class="structname">pgbench_branches</code>, <code class="structname">pgbench_history</code>, and

  223.         <code class="structname">pgbench_tellers</code>.

  224.        </p></dd><dt><span class="term"><code class="option">-N</code><br /></span><span class="term"><code class="option">--skip-some-updates</code></span></dt><dd><p>

  225.         Run built-in simple-update script.

  226.         Shorthand for <code class="option">-b simple-update</code>.

  227.        </p></dd><dt><span class="term"><code class="option">-P</code> <em class="replaceable"><code>sec</code></em><br /></span><span class="term"><code class="option">--progress=</code><em class="replaceable"><code>sec</code></em></span></dt><dd><p>

  228.         Show progress report every <em class="replaceable"><code>sec</code></em> seconds.  The report

  229.         includes the time since the beginning of the run, the TPS since the

  230.         last report, and the transaction latency average and standard

  231.         deviation since the last report.  Under throttling (<code class="option">-R</code>),

  232.         the latency is computed with respect to the transaction scheduled

  233.         start time, not the actual transaction beginning time, thus it also

  234.         includes the average schedule lag time.

  235.        </p></dd><dt><span class="term"><code class="option">-r</code><br /></span><span class="term"><code class="option">--report-latencies</code></span></dt><dd><p>

  236.         Report the average per-statement latency (execution time from the

  237.         perspective of the client) of each command after the benchmark

  238.         finishes.  See below for details.

  239.        </p></dd><dt><span class="term"><code class="option">-R</code> <em class="replaceable"><code>rate</code></em><br /></span><span class="term"><code class="option">--rate=</code><em class="replaceable"><code>rate</code></em></span></dt><dd><p>

  240.         Execute transactions targeting the specified rate instead of running

  241.         as fast as possible (the default).  The rate is given in transactions

  242.         per second.  If the targeted rate is above the maximum possible rate,

  243.         the rate limit won't impact the results.

  244.        </p><p>

  245.         The rate is targeted by starting transactions along a

  246.         Poisson-distributed schedule time line.  The expected start time

  247.         schedule moves forward based on when the client first started, not

  248.         when the previous transaction ended.  That approach means that when

  249.         transactions go past their original scheduled end time, it is

  250.         possible for later ones to catch up again.

  251.        </p><p>

  252.         When throttling is active, the transaction latency reported at the

  253.         end of the run is calculated from the scheduled start times, so it

  254.         includes the time each transaction had to wait for the previous

  255.         transaction to finish. The wait time is called the schedule lag time,

  256.         and its average and maximum are also reported separately. The

  257.         transaction latency with respect to the actual transaction start time,

  258.         i.e. the time spent executing the transaction in the database, can be

  259.         computed by subtracting the schedule lag time from the reported

  260.         latency.

  261.        </p><p>

  262.         If <code class="option">--latency-limit</code> is used together with <code class="option">--rate</code>,

  263.         a transaction can lag behind so much that it is already over the

  264.         latency limit when the previous transaction ends, because the latency

  265.         is calculated from the scheduled start time. Such transactions are

  266.         not sent to the server, but are skipped altogether and counted

  267.         separately.

  268.        </p><p>

  269.         A high schedule lag time is an indication that the system cannot

  270.         process transactions at the specified rate, with the chosen number of

  271.         clients and threads. When the average transaction execution time is

  272.         longer than the scheduled interval between each transaction, each

  273.         successive transaction will fall further behind, and the schedule lag

  274.         time will keep increasing the longer the test run is. When that

  275.         happens, you will have to reduce the specified transaction rate.

  276.        </p></dd><dt><span class="term"><code class="option">-s</code> <em class="replaceable"><code>scale_factor</code></em><br /></span><span class="term"><code class="option">--scale=</code><em class="replaceable"><code>scale_factor</code></em></span></dt><dd><p>

  277.         Report the specified scale factor in <span class="application">pgbench</span>'s

  278.         output.  With the built-in tests, this is not necessary; the

  279.         correct scale factor will be detected by counting the number of

  280.         rows in the <code class="structname">pgbench_branches</code> table.

  281.         However, when testing only custom benchmarks (<code class="option">-f</code> option),

  282.         the scale factor will be reported as 1 unless this option is used.

  283.        </p></dd><dt><span class="term"><code class="option">-S</code><br /></span><span class="term"><code class="option">--select-only</code></span></dt><dd><p>

  284.         Run built-in select-only script.

  285.         Shorthand for <code class="option">-b select-only</code>.

  286.        </p></dd><dt><span class="term"><code class="option">-t</code> <em class="replaceable"><code>transactions</code></em><br /></span><span class="term"><code class="option">--transactions=</code><em class="replaceable"><code>transactions</code></em></span></dt><dd><p>

  287.         Number of transactions each client runs.  Default is 10.

  288.        </p></dd><dt><span class="term"><code class="option">-T</code> <em class="replaceable"><code>seconds</code></em><br /></span><span class="term"><code class="option">--time=</code><em class="replaceable"><code>seconds</code></em></span></dt><dd><p>

  289.         Run the test for this many seconds, rather than a fixed number of

  290.         transactions per client. <code class="option">-t</code> and

  291.         <code class="option">-T</code> are mutually exclusive.

  292.        </p></dd><dt><span class="term"><code class="option">-v</code><br /></span><span class="term"><code class="option">--vacuum-all</code></span></dt><dd><p>

  293.         Vacuum all four standard tables before running the test.

  294.         With neither <code class="option">-n</code> nor <code class="option">-v</code>, <span class="application">pgbench</span> will vacuum the

  295.         <code class="structname">pgbench_tellers</code> and <code class="structname">pgbench_branches</code>

  296.         tables, and will truncate <code class="structname">pgbench_history</code>.

  297.        </p></dd><dt><span class="term"><code class="option">--aggregate-interval=<em class="replaceable"><code>seconds</code></em></code></span></dt><dd><p>

  298.         Length of aggregation interval (in seconds).  May be used only

  299.         with <code class="option">-l</code> option.  With this option, the log contains

  300.         per-interval summary data, as described below.

  301.        </p></dd><dt><span class="term"><code class="option">--log-prefix=<em class="replaceable"><code>prefix</code></em></code></span></dt><dd><p>

  302.         Set the filename prefix for the log files created by

  303.         <code class="option">--log</code>.  The default is <code class="literal">pgbench_log</code>.

  304.        </p></dd><dt><span class="term"><code class="option">--progress-timestamp</code></span></dt><dd><p>

  305.         When showing progress (option <code class="option">-P</code>), use a timestamp

  306.         (Unix epoch) instead of the number of seconds since the

  307.         beginning of the run.  The unit is in seconds, with millisecond

  308.         precision after the dot.

  309.         This helps compare logs generated by various tools.

  310.        </p></dd><dt><span class="term"><code class="option">--random-seed=</code><em class="replaceable"><code>SEED</code></em></span></dt><dd><p>

  311.         Set random generator seed.  Seeds the system random number generator,

  312.         which then produces a sequence of initial generator states, one for

  313.         each thread.

  314.         Values for <em class="replaceable"><code>SEED</code></em> may be:

  315.         <code class="literal">time</code> (the default, the seed is based on the current time),

  316.         <code class="literal">rand</code> (use a strong random source, failing if none

  317.         is available), or an unsigned decimal integer value.

  318.         The random generator is invoked explicitly from a pgbench script

  319.         (<code class="literal">random...</code> functions) or implicitly (for instance option

  320.         <code class="option">--rate</code> uses it to schedule transactions).

  321.         When explicitly set, the value used for seeding is shown on the terminal.

  322.         Any value allowed for <em class="replaceable"><code>SEED</code></em> may also be

  323.         provided through the environment variable

  324.         <code class="literal">PGBENCH_RANDOM_SEED</code>.

  325.         To ensure that the provided seed impacts all possible uses, put this option

  326.         first or use the environment variable.

  327.       </p><p>

  328.         Setting the seed explicitly allows to reproduce a <code class="command">pgbench</code>

  329.         run exactly, as far as random numbers are concerned.

  330.         As the random state is managed per thread, this means the exact same

  331.         <code class="command">pgbench</code> run for an identical invocation if there is one

  332.         client per thread and there are no external or data dependencies.

  333.         From a statistical viewpoint reproducing runs exactly is a bad idea because

  334.         it can hide the performance variability or improve performance unduly,

  335.         e.g. by hitting the same pages as a previous run.

  336.         However, it may also be of great help for debugging, for instance

  337.         re-running a tricky case which leads to an error.

  338.         Use wisely.

  339.        </p></dd><dt><span class="term"><code class="option">--sampling-rate=<em class="replaceable"><code>rate</code></em></code></span></dt><dd><p>

  340.         Sampling rate, used when writing data into the log, to reduce the

  341.         amount of log generated. If this option is given, only the specified

  342.         fraction of transactions are logged. 1.0 means all transactions will

  343.         be logged, 0.05 means only 5% of the transactions will be logged.

  344.        </p><p>

  345.         Remember to take the sampling rate into account when processing the

  346.         log file. For example, when computing TPS values, you need to multiply

  347.         the numbers accordingly (e.g. with 0.01 sample rate, you'll only get

  348.         1/100 of the actual TPS).

  349.        </p></dd></dl></div><p>

  350.    </p></div><div class="refsect2" id="PGBENCH-COMMON-OPTIONS"><h3>Common Options</h3><p>

  351.     <span class="application">pgbench</span> accepts the following command-line

  352.     common arguments:

  353. 

  354.     </p><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="option">-h</code> <em class="replaceable"><code>hostname</code></em><br /></span><span class="term"><code class="option">--host=</code><em class="replaceable"><code>hostname</code></em></span></dt><dd><p>

  355.         The database server's host name

  356.        </p></dd><dt><span class="term"><code class="option">-p</code> <em class="replaceable"><code>port</code></em><br /></span><span class="term"><code class="option">--port=</code><em class="replaceable"><code>port</code></em></span></dt><dd><p>

  357.         The database server's port number

  358.        </p></dd><dt><span class="term"><code class="option">-U</code> <em class="replaceable"><code>login</code></em><br /></span><span class="term"><code class="option">--username=</code><em class="replaceable"><code>login</code></em></span></dt><dd><p>

  359.         The user name to connect as

  360.        </p></dd><dt><span class="term"><code class="option">-V</code><br /></span><span class="term"><code class="option">--version</code></span></dt><dd><p>

  361.         Print the <span class="application">pgbench</span> version and exit.

  362.        </p></dd><dt><span class="term"><code class="option">-?</code><br /></span><span class="term"><code class="option">--help</code></span></dt><dd><p>

  363.         Show help about <span class="application">pgbench</span> command line

  364.         arguments, and exit.

  365.        </p></dd></dl></div><p>

  366.    </p></div></div><div class="refsect1" id="id-1.9.4.10.7"><h2>Exit Status</h2><p>

  367.    A successful run will exit with status 0.  Exit status 1 indicates static

  368.    problems such as invalid command-line options.  Errors during the run such

  369.    as database errors or problems in the script will result in exit status 2.

  370.    In the latter case, <span class="application">pgbench</span> will print partial

  371.    results.

  372.   </p></div><div class="refsect1" id="id-1.9.4.10.8"><h2>Environment</h2><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="envar">PGHOST</code><br /></span><span class="term"><code class="envar">PGPORT</code><br /></span><span class="term"><code class="envar">PGUSER</code></span></dt><dd><p>

  373.       Default connection parameters.

  374.      </p></dd></dl></div><p>

  375.    This utility, like most other <span class="productname">PostgreSQL</span> utilities,

  376.    uses the environment variables supported by <span class="application">libpq</span>

  377.    (see <a class="xref" href="libpq-envars.html" title="33.14. Environment Variables">Section 33.14</a>).

  378.   </p></div><div class="refsect1" id="id-1.9.4.10.9"><h2>Notes</h2><div class="refsect2" id="id-1.9.4.10.9.2"><h3>What Is the <span class="quote">“<span class="quote">Transaction</span>”</span> Actually Performed in <span class="application">pgbench</span>?</h3><p>

  379.    <span class="application">pgbench</span> executes test scripts chosen randomly

  380.    from a specified list.

  381.    They include built-in scripts with <code class="option">-b</code> and

  382.    user-provided custom scripts with <code class="option">-f</code>.

  383.    Each script may be given a relative weight specified after a

  384.    <code class="literal">@</code> so as to change its drawing probability.

  385.    The default weight is <code class="literal">1</code>.

  386.    Scripts with a weight of <code class="literal">0</code> are ignored.

  387.  </p><p>

  388.    The default built-in transaction script (also invoked with <code class="option">-b tpcb-like</code>)

  389.    issues seven commands per transaction over randomly chosen <code class="literal">aid</code>,

  390.    <code class="literal">tid</code>, <code class="literal">bid</code> and <code class="literal">delta</code>.

  391.    The scenario is inspired by the TPC-B benchmark, but is not actually TPC-B,

  392.    hence the name.

  393.   </p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p><code class="literal">BEGIN;</code></p></li><li class="listitem"><p><code class="literal">UPDATE pgbench_accounts SET abalance = abalance + :delta WHERE aid = :aid;</code></p></li><li class="listitem"><p><code class="literal">SELECT abalance FROM pgbench_accounts WHERE aid = :aid;</code></p></li><li class="listitem"><p><code class="literal">UPDATE pgbench_tellers SET tbalance = tbalance + :delta WHERE tid = :tid;</code></p></li><li class="listitem"><p><code class="literal">UPDATE pgbench_branches SET bbalance = bbalance + :delta WHERE bid = :bid;</code></p></li><li class="listitem"><p><code class="literal">INSERT INTO pgbench_history (tid, bid, aid, delta, mtime) VALUES (:tid, :bid, :aid, :delta, CURRENT_TIMESTAMP);</code></p></li><li class="listitem"><p><code class="literal">END;</code></p></li></ol></div><p>

  394.    If you select the <code class="literal">simple-update</code> built-in (also <code class="option">-N</code>),

  395.    steps 4 and 5 aren't included in the transaction.

  396.    This will avoid update contention on these tables, but

  397.    it makes the test case even less like TPC-B.

  398.   </p><p>

  399.    If you select the <code class="literal">select-only</code> built-in (also <code class="option">-S</code>),

  400.    only the <code class="command">SELECT</code> is issued.

  401.   </p></div><div class="refsect2" id="id-1.9.4.10.9.3"><h3>Custom Scripts</h3><p>

  402.    <span class="application">pgbench</span> has support for running custom

  403.    benchmark scenarios by replacing the default transaction script

  404.    (described above) with a transaction script read from a file

  405.    (<code class="option">-f</code> option).  In this case a <span class="quote">“<span class="quote">transaction</span>”</span>

  406.    counts as one execution of a script file.

  407.   </p><p>

  408.    A script file contains one or more SQL commands terminated by

  409.    semicolons.  Empty lines and lines beginning with

  410.    <code class="literal">--</code> are ignored.  Script files can also contain

  411.    <span class="quote">“<span class="quote">meta commands</span>”</span>, which are interpreted by <span class="application">pgbench</span>

  412.    itself, as described below.

  413.   </p><div class="note"><h3 class="title">Note</h3><p>

  414.     Before <span class="productname">PostgreSQL</span> 9.6, SQL commands in script files

  415.     were terminated by newlines, and so they could not be continued across

  416.     lines.  Now a semicolon is <span class="emphasis"><em>required</em></span> to separate consecutive

  417.     SQL commands (though a SQL command does not need one if it is followed

  418.     by a meta command).  If you need to create a script file that works with

  419.     both old and new versions of <span class="application">pgbench</span>, be sure to write

  420.     each SQL command on a single line ending with a semicolon.

  421.    </p></div><p>

  422.    There is a simple variable-substitution facility for script files.

  423.    Variable names must consist of letters (including non-Latin letters),

  424.    digits, and underscores.

  425.    Variables can be set by the command-line <code class="option">-D</code> option,

  426.    explained above, or by the meta commands explained below.

  427.    In addition to any variables preset by <code class="option">-D</code> command-line options,

  428.    there are a few variables that are preset automatically, listed in

  429.    <a class="xref" href="pgbench.html#PGBENCH-AUTOMATIC-VARIABLES" title="Table 257. Automatic Variables">Table 257</a>. A value specified for these

  430.    variables using <code class="option">-D</code> takes precedence over the automatic presets.

  431.    Once set, a variable's

  432.    value can be inserted into a SQL command by writing

  433.    <code class="literal">:</code><em class="replaceable"><code>variablename</code></em>.  When running more than

  434.    one client session, each session has its own set of variables.

  435.    <span class="application">pgbench</span> supports up to 255 variable uses in one

  436.    statement.

  437.   </p><div class="table" id="PGBENCH-AUTOMATIC-VARIABLES"><p class="title"><strong>Table 257. Automatic Variables</strong></p><div class="table-contents"><table class="table" summary="Automatic Variables" border="1"><colgroup><col /><col /></colgroup><thead><tr><th>Variable</th><th>Description</th></tr></thead><tbody><tr><td> <code class="literal">client_id</code> </td><td>unique number identifying the client session (starts from zero)</td></tr><tr><td> <code class="literal">default_seed</code> </td><td>seed used in hash functions by default</td></tr><tr><td> <code class="literal">random_seed</code> </td><td>random generator seed (unless overwritten with <code class="option">-D</code>)</td></tr><tr><td> <code class="literal">scale</code> </td><td>current scale factor</td></tr></tbody></table></div></div><br class="table-break" /><p>

  438.    Script file meta commands begin with a backslash (<code class="literal">\</code>) and

  439.    normally extend to the end of the line, although they can be continued

  440.    to additional lines by writing backslash-return.

  441.    Arguments to a meta command are separated by white space.

  442.    These meta commands are supported:

  443.   </p><div class="variablelist"><dl class="variablelist"><dt id="PGBENCH-METACOMMAND-GSET"><span class="term">

  444.      <code class="literal">\gset [<em class="replaceable"><code>prefix</code></em>]</code>

  445.     </span></dt><dd><p>

  446.       This command may be used to end SQL queries, taking the place of the

  447.       terminating semicolon (<code class="literal">;</code>).

  448.      </p><p>

  449.       When this command is used, the preceding SQL query is expected to

  450.       return one row, the columns of which are stored into variables named after

  451.       column names, and prefixed with <em class="replaceable"><code>prefix</code></em> if provided.

  452.      </p><p>

  453.       The following example puts the final account balance from the first query

  454.       into variable <em class="replaceable"><code>abalance</code></em>, and fills variables

  455.       <em class="replaceable"><code>p_two</code></em> and <em class="replaceable"><code>p_three</code></em>

  456.       with integers from the third query.

  457.       The result of the second query is discarded.

  458. </p><pre class="programlisting">

  459. UPDATE pgbench_accounts

  460.   SET abalance = abalance + :delta

  461.   WHERE aid = :aid

  462.   RETURNING abalance \gset

  463. -- compound of two queries

  464. SELECT 1 \;

  465. SELECT 2 AS two, 3 AS three \gset p_

  466. </pre><p>

  467.      </p></dd><dt><span class="term"><code class="literal">\if</code> <em class="replaceable"><code>expression</code></em><br /></span><span class="term"><code class="literal">\elif</code> <em class="replaceable"><code>expression</code></em><br /></span><span class="term"><code class="literal">\else</code><br /></span><span class="term"><code class="literal">\endif</code></span></dt><dd><p>

  468.       This group of commands implements nestable conditional blocks,

  469.       similarly to <code class="literal">psql</code>'s <a class="xref" href="app-psql.html#PSQL-METACOMMAND-IF"><code class="literal">\if</code> <em class="replaceable"><code>expression</code></em></a>.

  470.       Conditional expressions are identical to those with <code class="literal">\set</code>,

  471.       with non-zero values interpreted as true.

  472.      </p></dd><dt id="PGBENCH-METACOMMAND-SET"><span class="term">

  473.      <code class="literal">\set <em class="replaceable"><code>varname</code></em> <em class="replaceable"><code>expression</code></em></code>

  474.     </span></dt><dd><p>

  475.       Sets variable <em class="replaceable"><code>varname</code></em> to a value calculated

  476.       from <em class="replaceable"><code>expression</code></em>.

  477.       The expression may contain the <code class="literal">NULL</code> constant,

  478.       Boolean constants <code class="literal">TRUE</code> and <code class="literal">FALSE</code>,

  479.       integer constants such as <code class="literal">5432</code>,

  480.       double constants such as <code class="literal">3.14159</code>,

  481.       references to variables <code class="literal">:</code><em class="replaceable"><code>variablename</code></em>,

  482.       <a class="link" href="pgbench.html#PGBENCH-BUILTIN-OPERATORS" title="Built-in Operators">operators</a>

  483.       with their usual SQL precedence and associativity,

  484.       <a class="link" href="pgbench.html#PGBENCH-BUILTIN-FUNCTIONS" title="Built-In Functions">function calls</a>,

  485.       SQL <a class="link" href="functions-conditional.html#FUNCTIONS-CASE" title="9.17.1. CASE"><code class="token">CASE</code> generic conditional

  486.       expressions</a> and parentheses.

  487.      </p><p>

  488.       Functions and most operators return <code class="literal">NULL</code> on

  489.       <code class="literal">NULL</code> input.

  490.      </p><p>

  491.       For conditional purposes, non zero numerical values are

  492.       <code class="literal">TRUE</code>, zero numerical values and <code class="literal">NULL</code>

  493.       are <code class="literal">FALSE</code>.

  494.      </p><p>

  495.       Too large or small integer and double constants, as well as

  496.       integer arithmetic operators (<code class="literal">+</code>,

  497.       <code class="literal">-</code>, <code class="literal">*</code> and <code class="literal">/</code>)

  498.       raise errors on overflows.

  499.      </p><p>

  500.       When no final <code class="token">ELSE</code> clause is provided to a

  501.       <code class="token">CASE</code>, the default value is <code class="literal">NULL</code>.

  502.      </p><p>

  503.       Examples:

  504. </p><pre class="programlisting">

  505. \set ntellers 10 * :scale

  506. \set aid (1021 * random(1, 100000 * :scale)) % \

  507.            (100000 * :scale) + 1

  508. \set divx CASE WHEN :x &lt;&gt; 0 THEN :y/:x ELSE NULL END

  509. </pre></dd><dt><span class="term">

  510.      <code class="literal">\sleep <em class="replaceable"><code>number</code></em> [ us | ms | s ]</code>

  511.     </span></dt><dd><p>

  512.       Causes script execution to sleep for the specified duration in

  513.       microseconds (<code class="literal">us</code>), milliseconds (<code class="literal">ms</code>) or seconds

  514.       (<code class="literal">s</code>).  If the unit is omitted then seconds are the default.

  515.       <em class="replaceable"><code>number</code></em> can be either an integer constant or a

  516.       <code class="literal">:</code><em class="replaceable"><code>variablename</code></em> reference to a variable

  517.       having an integer value.

  518.      </p><p>

  519.       Example:

  520. </p><pre class="programlisting">

  521. \sleep 10 ms

  522. </pre></dd><dt><span class="term">

  523.      <code class="literal">\setshell <em class="replaceable"><code>varname</code></em> <em class="replaceable"><code>command</code></em> [ <em class="replaceable"><code>argument</code></em> ... ]</code>

  524.     </span></dt><dd><p>

  525.       Sets variable <em class="replaceable"><code>varname</code></em> to the result of the shell command

  526.       <em class="replaceable"><code>command</code></em> with the given <em class="replaceable"><code>argument</code></em>(s).

  527.       The command must return an integer value through its standard output.

  528.      </p><p>

  529.       <em class="replaceable"><code>command</code></em> and each <em class="replaceable"><code>argument</code></em> can be either

  530.       a text constant or a <code class="literal">:</code><em class="replaceable"><code>variablename</code></em> reference

  531.       to a variable. If you want to use an <em class="replaceable"><code>argument</code></em> starting

  532.       with a colon, write an additional colon at the beginning of

  533.       <em class="replaceable"><code>argument</code></em>.

  534.      </p><p>

  535.       Example:

  536. </p><pre class="programlisting">

  537. \setshell variable_to_be_assigned command literal_argument :variable ::literal_starting_with_colon

  538. </pre></dd><dt><span class="term">

  539.      <code class="literal">\shell <em class="replaceable"><code>command</code></em> [ <em class="replaceable"><code>argument</code></em> ... ]</code>

  540.     </span></dt><dd><p>

  541.       Same as <code class="literal">\setshell</code>, but the result of the command

  542.       is discarded.

  543.      </p><p>

  544.       Example:

  545. </p><pre class="programlisting">

  546. \shell command literal_argument :variable ::literal_starting_with_colon

  547. </pre></dd></dl></div></div><div class="refsect2" id="PGBENCH-BUILTIN-OPERATORS"><h3>Built-in Operators</h3><p>

  548.    The arithmetic, bitwise, comparison and logical operators listed in

  549.    <a class="xref" href="pgbench.html#PGBENCH-OPERATORS" title="Table 258. pgbench Operators by Increasing Precedence">Table 258</a> are built into <span class="application">pgbench</span>

  550.    and may be used in expressions appearing in

  551.    <a class="link" href="pgbench.html#PGBENCH-METACOMMAND-SET"><code class="literal">\set</code></a>.

  552.   </p><div class="table" id="PGBENCH-OPERATORS"><p class="title"><strong>Table 258. pgbench Operators by Increasing Precedence</strong></p><div class="table-contents"><table class="table" summary="pgbench Operators by Increasing Precedence" border="1"><colgroup><col /><col /><col /><col /></colgroup><thead><tr><th>Operator</th><th>Description</th><th>Example</th><th>Result</th></tr></thead><tbody><tr><td><code class="literal">OR</code></td><td>logical or</td><td><code class="literal">5 or 0</code></td><td><code class="literal">TRUE</code></td></tr><tr><td><code class="literal">AND</code></td><td>logical and</td><td><code class="literal">3 and 0</code></td><td><code class="literal">FALSE</code></td></tr><tr><td><code class="literal">NOT</code></td><td>logical not</td><td><code class="literal">not false</code></td><td><code class="literal">TRUE</code></td></tr><tr><td><code class="literal">IS [NOT] (NULL|TRUE|FALSE)</code></td><td>value tests</td><td><code class="literal">1 is null</code></td><td><code class="literal">FALSE</code></td></tr><tr><td><code class="literal">ISNULL|NOTNULL</code></td><td>null tests</td><td><code class="literal">1 notnull</code></td><td><code class="literal">TRUE</code></td></tr><tr><td><code class="literal">=</code></td><td>is equal</td><td><code class="literal">5 = 4</code></td><td><code class="literal">FALSE</code></td></tr><tr><td><code class="literal">&lt;&gt;</code></td><td>is not equal</td><td><code class="literal">5 &lt;&gt; 4</code></td><td><code class="literal">TRUE</code></td></tr><tr><td><code class="literal">!=</code></td><td>is not equal</td><td><code class="literal">5 != 5</code></td><td><code class="literal">FALSE</code></td></tr><tr><td><code class="literal">&lt;</code></td><td>lower than</td><td><code class="literal">5 &lt; 4</code></td><td><code class="literal">FALSE</code></td></tr><tr><td><code class="literal">&lt;=</code></td><td>lower or equal</td><td><code class="literal">5 &lt;= 4</code></td><td><code class="literal">FALSE</code></td></tr><tr><td><code class="literal">&gt;</code></td><td>greater than</td><td><code class="literal">5 &gt; 4</code></td><td><code class="literal">TRUE</code></td></tr><tr><td><code class="literal">&gt;=</code></td><td>greater or equal</td><td><code class="literal">5 &gt;= 4</code></td><td><code class="literal">TRUE</code></td></tr><tr><td><code class="literal">|</code></td><td>integer bitwise OR</td><td><code class="literal">1 | 2</code></td><td><code class="literal">3</code></td></tr><tr><td><code class="literal">#</code></td><td>integer bitwise XOR</td><td><code class="literal">1 # 3</code></td><td><code class="literal">2</code></td></tr><tr><td><code class="literal">&amp;</code></td><td>integer bitwise AND</td><td><code class="literal">1 &amp; 3</code></td><td><code class="literal">1</code></td></tr><tr><td><code class="literal">~</code></td><td>integer bitwise NOT</td><td><code class="literal">~ 1</code></td><td><code class="literal">-2</code></td></tr><tr><td><code class="literal">&lt;&lt;</code></td><td>integer bitwise shift left</td><td><code class="literal">1 &lt;&lt; 2</code></td><td><code class="literal">4</code></td></tr><tr><td><code class="literal">&gt;&gt;</code></td><td>integer bitwise shift right</td><td><code class="literal">8 &gt;&gt; 2</code></td><td><code class="literal">2</code></td></tr><tr><td><code class="literal">+</code></td><td>addition</td><td><code class="literal">5 + 4</code></td><td><code class="literal">9</code></td></tr><tr><td><code class="literal">-</code></td><td>subtraction</td><td><code class="literal">3 - 2.0</code></td><td><code class="literal">1.0</code></td></tr><tr><td><code class="literal">*</code></td><td>multiplication</td><td><code class="literal">5 * 4</code></td><td><code class="literal">20</code></td></tr><tr><td><code class="literal">/</code></td><td>division (integer truncates the results)</td><td><code class="literal">5 / 3</code></td><td><code class="literal">1</code></td></tr><tr><td><code class="literal">%</code></td><td>modulo</td><td><code class="literal">3 % 2</code></td><td><code class="literal">1</code></td></tr><tr><td><code class="literal">-</code></td><td>opposite</td><td><code class="literal">- 2.0</code></td><td><code class="literal">-2.0</code></td></tr></tbody></table></div></div><br class="table-break" /></div><div class="refsect2" id="PGBENCH-BUILTIN-FUNCTIONS"><h3>Built-In Functions</h3><p>

  553.    The functions listed in <a class="xref" href="pgbench.html#PGBENCH-FUNCTIONS" title="Table 259. pgbench Functions">Table 259</a> are built

  554.    into <span class="application">pgbench</span> and may be used in expressions appearing in

  555.    <a class="link" href="pgbench.html#PGBENCH-METACOMMAND-SET"><code class="literal">\set</code></a>.

  556.   </p><div class="table" id="PGBENCH-FUNCTIONS"><p class="title"><strong>Table 259. pgbench Functions</strong></p><div class="table-contents"><table class="table" summary="pgbench Functions" border="1"><colgroup><col /><col /><col /><col /><col /></colgroup><thead><tr><th>Function</th><th>Return Type</th><th>Description</th><th>Example</th><th>Result</th></tr></thead><tbody><tr><td><code class="literal"><code class="function">abs(<em class="replaceable"><code>a</code></em>)</code></code></td><td>same as <em class="replaceable"><code>a</code></em></td><td>absolute value</td><td><code class="literal">abs(-17)</code></td><td><code class="literal">17</code></td></tr><tr><td><code class="literal"><code class="function">debug(<em class="replaceable"><code>a</code></em>)</code></code></td><td>same as <em class="replaceable"><code>a</code></em> </td><td>print <em class="replaceable"><code>a</code></em> to <span class="systemitem">stderr</span>,

  557.         and return <em class="replaceable"><code>a</code></em></td><td><code class="literal">debug(5432.1)</code></td><td><code class="literal">5432.1</code></td></tr><tr><td><code class="literal"><code class="function">double(<em class="replaceable"><code>i</code></em>)</code></code></td><td>double</td><td>cast to double</td><td><code class="literal">double(5432)</code></td><td><code class="literal">5432.0</code></td></tr><tr><td><code class="literal"><code class="function">exp(<em class="replaceable"><code>x</code></em>)</code></code></td><td>double</td><td>exponential</td><td><code class="literal">exp(1.0)</code></td><td><code class="literal">2.718281828459045</code></td></tr><tr><td><code class="literal"><code class="function">greatest(<em class="replaceable"><code>a</code></em> [, <em class="replaceable"><code>...</code></em> ] )</code></code></td><td>double if any <em class="replaceable"><code>a</code></em> is double, else integer</td><td>largest value among arguments</td><td><code class="literal">greatest(5, 4, 3, 2)</code></td><td><code class="literal">5</code></td></tr><tr><td><code class="literal"><code class="function">hash(<em class="replaceable"><code>a</code></em> [, <em class="replaceable"><code>seed</code></em> ] )</code></code></td><td>integer</td><td>alias for <code class="literal">hash_murmur2()</code></td><td><code class="literal">hash(10, 5432)</code></td><td><code class="literal">-5817877081768721676</code></td></tr><tr><td><code class="literal"><code class="function">hash_fnv1a(<em class="replaceable"><code>a</code></em> [, <em class="replaceable"><code>seed</code></em> ] )</code></code></td><td>integer</td><td><a class="ulink" href="https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function" target="_top">FNV-1a hash</a></td><td><code class="literal">hash_fnv1a(10, 5432)</code></td><td><code class="literal">-7793829335365542153</code></td></tr><tr><td><code class="literal"><code class="function">hash_murmur2(<em class="replaceable"><code>a</code></em> [, <em class="replaceable"><code>seed</code></em> ] )</code></code></td><td>integer</td><td><a class="ulink" href="https://en.wikipedia.org/wiki/MurmurHash" target="_top">MurmurHash2 hash</a></td><td><code class="literal">hash_murmur2(10, 5432)</code></td><td><code class="literal">-5817877081768721676</code></td></tr><tr><td><code class="literal"><code class="function">int(<em class="replaceable"><code>x</code></em>)</code></code></td><td>integer</td><td>cast to int</td><td><code class="literal">int(5.4 + 3.8)</code></td><td><code class="literal">9</code></td></tr><tr><td><code class="literal"><code class="function">least(<em class="replaceable"><code>a</code></em> [, <em class="replaceable"><code>...</code></em> ] )</code></code></td><td>double if any <em class="replaceable"><code>a</code></em> is double, else integer</td><td>smallest value among arguments</td><td><code class="literal">least(5, 4, 3, 2.1)</code></td><td><code class="literal">2.1</code></td></tr><tr><td><code class="literal"><code class="function">ln(<em class="replaceable"><code>x</code></em>)</code></code></td><td>double</td><td>natural logarithm</td><td><code class="literal">ln(2.718281828459045)</code></td><td><code class="literal">1.0</code></td></tr><tr><td><code class="literal"><code class="function">mod(<em class="replaceable"><code>i</code></em>, <em class="replaceable"><code>j</code></em>)</code></code></td><td>integer</td><td>modulo</td><td><code class="literal">mod(54, 32)</code></td><td><code class="literal">22</code></td></tr><tr><td><code class="literal"><code class="function">pi()</code></code></td><td>double</td><td>value of the constant PI</td><td><code class="literal">pi()</code></td><td><code class="literal">3.14159265358979323846</code></td></tr><tr><td><code class="literal"><code class="function">pow(<em class="replaceable"><code>x</code></em>, <em class="replaceable"><code>y</code></em>)</code>, <code class="function">power(<em class="replaceable"><code>x</code></em>, <em class="replaceable"><code>y</code></em>)</code></code></td><td>double</td><td>exponentiation</td><td><code class="literal">pow(2.0, 10)</code>, <code class="literal">power(2.0, 10)</code></td><td><code class="literal">1024.0</code></td></tr><tr><td><code class="literal"><code class="function">random(<em class="replaceable"><code>lb</code></em>, <em class="replaceable"><code>ub</code></em>)</code></code></td><td>integer</td><td>uniformly-distributed random integer in <code class="literal">[lb, ub]</code></td><td><code class="literal">random(1, 10)</code></td><td>an integer between <code class="literal">1</code> and <code class="literal">10</code></td></tr><tr><td><code class="literal"><code class="function">random_exponential(<em class="replaceable"><code>lb</code></em>, <em class="replaceable"><code>ub</code></em>, <em class="replaceable"><code>parameter</code></em>)</code></code></td><td>integer</td><td>exponentially-distributed random integer in <code class="literal">[lb, ub]</code>,

  558.               see below</td><td><code class="literal">random_exponential(1, 10, 3.0)</code></td><td>an integer between <code class="literal">1</code> and <code class="literal">10</code></td></tr><tr><td><code class="literal"><code class="function">random_gaussian(<em class="replaceable"><code>lb</code></em>, <em class="replaceable"><code>ub</code></em>, <em class="replaceable"><code>parameter</code></em>)</code></code></td><td>integer</td><td>Gaussian-distributed random integer in <code class="literal">[lb, ub]</code>,

  559.               see below</td><td><code class="literal">random_gaussian(1, 10, 2.5)</code></td><td>an integer between <code class="literal">1</code> and <code class="literal">10</code></td></tr><tr><td><code class="literal"><code class="function">random_zipfian(<em class="replaceable"><code>lb</code></em>, <em class="replaceable"><code>ub</code></em>, <em class="replaceable"><code>parameter</code></em>)</code></code></td><td>integer</td><td>Zipfian-distributed random integer in <code class="literal">[lb, ub]</code>,

  560.               see below</td><td><code class="literal">random_zipfian(1, 10, 1.5)</code></td><td>an integer between <code class="literal">1</code> and <code class="literal">10</code></td></tr><tr><td><code class="literal"><code class="function">sqrt(<em class="replaceable"><code>x</code></em>)</code></code></td><td>double</td><td>square root</td><td><code class="literal">sqrt(2.0)</code></td><td><code class="literal">1.414213562</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

  561.     The <code class="literal">random</code> function generates values using a uniform

  562.     distribution, that is all the values are drawn within the specified

  563.     range with equal probability. The <code class="literal">random_exponential</code>,

  564.     <code class="literal">random_gaussian</code> and <code class="literal">random_zipfian</code>

  565.     functions require an additional double parameter which determines the precise

  566.     shape of the distribution.

  567.    </p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>

  568.       For an exponential distribution, <em class="replaceable"><code>parameter</code></em>

  569.       controls the distribution by truncating a quickly-decreasing

  570.       exponential distribution at <em class="replaceable"><code>parameter</code></em>, and then

  571.       projecting onto integers between the bounds.

  572.       To be precise, with

  573. </p><div class="literallayout"><p><br />

  574. f(x) = exp(-parameter * (x - min) / (max - min + 1)) / (1 - exp(-parameter))<br />

  575. </p></div><p>

  576.       Then value <em class="replaceable"><code>i</code></em> between <em class="replaceable"><code>min</code></em> and

  577.       <em class="replaceable"><code>max</code></em> inclusive is drawn with probability:

  578.       <code class="literal">f(i) - f(i + 1)</code>.

  579.      </p><p>

  580.       Intuitively, the larger the <em class="replaceable"><code>parameter</code></em>, the more

  581.       frequently values close to <em class="replaceable"><code>min</code></em> are accessed, and the

  582.       less frequently values close to <em class="replaceable"><code>max</code></em> are accessed.

  583.       The closer to 0 <em class="replaceable"><code>parameter</code></em> is, the flatter (more

  584.       uniform) the access distribution.

  585.       A crude approximation of the distribution is that the most frequent 1%

  586.       values in the range, close to <em class="replaceable"><code>min</code></em>, are drawn

  587.       <em class="replaceable"><code>parameter</code></em>% of the time.

  588.       The <em class="replaceable"><code>parameter</code></em> value must be strictly positive.

  589.      </p></li><li class="listitem"><p>

  590.       For a Gaussian distribution, the interval is mapped onto a standard

  591.       normal distribution (the classical bell-shaped Gaussian curve) truncated

  592.       at <code class="literal">-parameter</code> on the left and <code class="literal">+parameter</code>

  593.       on the right.

  594.       Values in the middle of the interval are more likely to be drawn.

  595.       To be precise, if <code class="literal">PHI(x)</code> is the cumulative distribution

  596.       function of the standard normal distribution, with mean <code class="literal">mu</code>

  597.       defined as <code class="literal">(max + min) / 2.0</code>, with

  598. </p><div class="literallayout"><p><br />

  599. f(x) = PHI(2.0 * parameter * (x - mu) / (max - min + 1)) /<br />

  600.        (2.0 * PHI(parameter) - 1)<br />

  601. </p></div><p>

  602.       then value <em class="replaceable"><code>i</code></em> between <em class="replaceable"><code>min</code></em> and

  603.       <em class="replaceable"><code>max</code></em> inclusive is drawn with probability:

  604.       <code class="literal">f(i + 0.5) - f(i - 0.5)</code>.

  605.       Intuitively, the larger the <em class="replaceable"><code>parameter</code></em>, the more

  606.       frequently values close to the middle of the interval are drawn, and the

  607.       less frequently values close to the <em class="replaceable"><code>min</code></em> and

  608.       <em class="replaceable"><code>max</code></em> bounds. About 67% of values are drawn from the

  609.       middle <code class="literal">1.0 / parameter</code>, that is a relative

  610.       <code class="literal">0.5 / parameter</code> around the mean, and 95% in the middle

  611.       <code class="literal">2.0 / parameter</code>, that is a relative

  612.       <code class="literal">1.0 / parameter</code> around the mean; for instance, if

  613.       <em class="replaceable"><code>parameter</code></em> is 4.0, 67% of values are drawn from the

  614.       middle quarter (1.0 / 4.0) of the interval (i.e. from

  615.       <code class="literal">3.0 / 8.0</code> to <code class="literal">5.0 / 8.0</code>) and 95% from

  616.       the middle half (<code class="literal">2.0 / 4.0</code>) of the interval (second and third

  617.       quartiles). The minimum allowed <em class="replaceable"><code>parameter</code></em>

  618.       value is 2.0.

  619.      </p></li><li class="listitem"><p>

  620.       <code class="literal">random_zipfian</code> generates a bounded Zipfian

  621.       distribution.

  622.       <em class="replaceable"><code>parameter</code></em> defines how skewed the distribution

  623.       is. The larger the <em class="replaceable"><code>parameter</code></em>, the more

  624.       frequently values closer to the beginning of the interval are drawn.

  625.       The distribution is such that, assuming the range starts from 1,

  626.       the ratio of the probability of drawing <em class="replaceable"><code>k</code></em>

  627.       versus drawing <em class="replaceable"><code>k+1</code></em> is

  628.       <code class="literal">((<em class="replaceable"><code>k</code></em>+1)/<em class="replaceable"><code>k</code></em>)**<em class="replaceable"><code>parameter</code></em></code>.

  629.       For example, <code class="literal">random_zipfian(1, ..., 2.5)</code> produces

  630.       the value <code class="literal">1</code> about <code class="literal">(2/1)**2.5 =

  631.       5.66</code> times more frequently than <code class="literal">2</code>, which

  632.       itself is produced <code class="literal">(3/2)**2.5 = 2.76</code> times more

  633.       frequently than <code class="literal">3</code>, and so on.

  634.      </p><p>

  635.       <span class="application">pgbench</span>'s implementation is based on

  636.       "Non-Uniform Random Variate Generation", Luc Devroye, p. 550-551,

  637.       Springer 1986.  Due to limitations of that algorithm,

  638.       the <em class="replaceable"><code>parameter</code></em> value is restricted to

  639.       the range [1.001, 1000].

  640.      </p></li></ul></div><p>

  641.     Hash functions <code class="literal">hash</code>, <code class="literal">hash_murmur2</code> and

  642.     <code class="literal">hash_fnv1a</code> accept an input value and an optional seed parameter.

  643.     In case the seed isn't provided the value of <code class="literal">:default_seed</code>

  644.     is used, which is initialized randomly unless set by the command-line

  645.     <code class="literal">-D</code> option. Hash functions can be used to scatter the

  646.     distribution of random functions such as <code class="literal">random_zipfian</code> or

  647.     <code class="literal">random_exponential</code>. For instance, the following pgbench

  648.     script simulates possible real world workload typical for social media and

  649.     blogging platforms where few accounts generate excessive load:

  650. 

  651. </p><pre class="programlisting">

  652. \set r random_zipfian(0, 100000000, 1.07)

  653. \set k abs(hash(:r)) % 1000000

  654. </pre><p>

  655. 

  656.     In some cases several distinct distributions are needed which don't correlate

  657.     with each other and this is when implicit seed parameter comes in handy:

  658. 

  659. </p><pre class="programlisting">

  660. \set k1 abs(hash(:r, :default_seed + 123)) % 1000000

  661. \set k2 abs(hash(:r, :default_seed + 321)) % 1000000

  662. </pre><p>

  663.   </p><p>

  664.    As an example, the full definition of the built-in TPC-B-like

  665.    transaction is:

  666. 

  667. </p><pre class="programlisting">

  668. \set aid random(1, 100000 * :scale)

  669. \set bid random(1, 1 * :scale)

  670. \set tid random(1, 10 * :scale)

  671. \set delta random(-5000, 5000)

  672. BEGIN;

  673. UPDATE pgbench_accounts SET abalance = abalance + :delta WHERE aid = :aid;

  674. SELECT abalance FROM pgbench_accounts WHERE aid = :aid;

  675. UPDATE pgbench_tellers SET tbalance = tbalance + :delta WHERE tid = :tid;

  676. UPDATE pgbench_branches SET bbalance = bbalance + :delta WHERE bid = :bid;

  677. INSERT INTO pgbench_history (tid, bid, aid, delta, mtime) VALUES (:tid, :bid, :aid, :delta, CURRENT_TIMESTAMP);

  678. END;

  679. </pre><p>

  680. 

  681.    This script allows each iteration of the transaction to reference

  682.    different, randomly-chosen rows.  (This example also shows why it's

  683.    important for each client session to have its own variables —

  684.    otherwise they'd not be independently touching different rows.)

  685.   </p></div><div class="refsect2" id="id-1.9.4.10.9.6"><h3>Per-Transaction Logging</h3><p>

  686.    With the <code class="option">-l</code> option (but without

  687.    the <code class="option">--aggregate-interval</code> option),

  688.    <span class="application">pgbench</span> writes information about each transaction

  689.    to a log file.  The log file will be named

  690.    <code class="filename"><em class="replaceable"><code>prefix</code></em>.<em class="replaceable"><code>nnn</code></em></code>,

  691.    where <em class="replaceable"><code>prefix</code></em> defaults to <code class="literal">pgbench_log</code>, and

  692.    <em class="replaceable"><code>nnn</code></em> is the PID of the

  693.    <span class="application">pgbench</span> process.

  694.    The prefix can be changed by using the <code class="option">--log-prefix</code> option.

  695.    If the <code class="option">-j</code> option is 2 or higher, so that there are multiple

  696.    worker threads, each will have its own log file. The first worker will

  697.    use the same name for its log file as in the standard single worker case.

  698.    The additional log files for the other workers will be named

  699.    <code class="filename"><em class="replaceable"><code>prefix</code></em>.<em class="replaceable"><code>nnn</code></em>.<em class="replaceable"><code>mmm</code></em></code>,

  700.    where <em class="replaceable"><code>mmm</code></em> is a sequential number for each worker starting

  701.    with 1.

  702.   </p><p>

  703.    The format of the log is:

  704. 

  705. </p><pre class="synopsis">

  706. <em class="replaceable"><code>client_id</code></em> <em class="replaceable"><code>transaction_no</code></em> <em class="replaceable"><code>time</code></em> <em class="replaceable"><code>script_no</code></em> <em class="replaceable"><code>time_epoch</code></em> <em class="replaceable"><code>time_us</code></em> [<span class="optional"> <em class="replaceable"><code>schedule_lag</code></em> </span>]

  707. </pre><p>

  708. 

  709.    where

  710.    <em class="replaceable"><code>client_id</code></em> indicates which client session ran the transaction,

  711.    <em class="replaceable"><code>transaction_no</code></em> counts how many transactions have been

  712.    run by that session,

  713.    <em class="replaceable"><code>time</code></em> is the total elapsed transaction time in microseconds,

  714.    <em class="replaceable"><code>script_no</code></em> identifies which script file was used (useful when

  715.    multiple scripts were specified with <code class="option">-f</code> or <code class="option">-b</code>),

  716.    and <em class="replaceable"><code>time_epoch</code></em>/<em class="replaceable"><code>time_us</code></em> are a

  717.    Unix-epoch time stamp and an offset

  718.    in microseconds (suitable for creating an ISO 8601

  719.    time stamp with fractional seconds) showing when

  720.    the transaction completed.

  721.    The <em class="replaceable"><code>schedule_lag</code></em> field is the difference between the

  722.    transaction's scheduled start time, and the time it actually started, in

  723.    microseconds. It is only present when the <code class="option">--rate</code> option is used.

  724.    When both <code class="option">--rate</code> and <code class="option">--latency-limit</code> are used,

  725.    the <em class="replaceable"><code>time</code></em> for a skipped transaction will be reported as

  726.    <code class="literal">skipped</code>.

  727.   </p><p>

  728.    Here is a snippet of a log file generated in a single-client run:

  729. </p><pre class="screen">

  730. 0 199 2241 0 1175850568 995598

  731. 0 200 2465 0 1175850568 998079

  732. 0 201 2513 0 1175850569 608

  733. 0 202 2038 0 1175850569 2663

  734. </pre><p>

  735. 

  736.    Another example with <code class="literal">--rate=100</code>

  737.    and <code class="literal">--latency-limit=5</code> (note the additional

  738.    <em class="replaceable"><code>schedule_lag</code></em> column):

  739. </p><pre class="screen">

  740. 0 81 4621 0 1412881037 912698 3005

  741. 0 82 6173 0 1412881037 914578 4304

  742. 0 83 skipped 0 1412881037 914578 5217

  743. 0 83 skipped 0 1412881037 914578 5099

  744. 0 83 4722 0 1412881037 916203 3108

  745. 0 84 4142 0 1412881037 918023 2333

  746. 0 85 2465 0 1412881037 919759 740

  747. </pre><p>

  748.    In this example, transaction 82 was late, because its latency (6.173 ms) was

  749.    over the 5 ms limit. The next two transactions were skipped, because they

  750.    were already late before they were even started.

  751.   </p><p>

  752.    When running a long test on hardware that can handle a lot of transactions,

  753.    the log files can become very large.  The <code class="option">--sampling-rate</code> option

  754.    can be used to log only a random sample of transactions.

  755.   </p></div><div class="refsect2" id="id-1.9.4.10.9.7"><h3>Aggregated Logging</h3><p>

  756.    With the <code class="option">--aggregate-interval</code> option, a different

  757.    format is used for the log files:

  758. 

  759. </p><pre class="synopsis">

  760. <em class="replaceable"><code>interval_start</code></em> <em class="replaceable"><code>num_transactions</code></em> <em class="replaceable"><code>sum_latency</code></em> <em class="replaceable"><code>sum_latency_2</code></em> <em class="replaceable"><code>min_latency</code></em> <em class="replaceable"><code>max_latency</code></em> [<span class="optional"> <em class="replaceable"><code>sum_lag</code></em> <em class="replaceable"><code>sum_lag_2</code></em> <em class="replaceable"><code>min_lag</code></em> <em class="replaceable"><code>max_lag</code></em> [<span class="optional"> <em class="replaceable"><code>skipped</code></em> </span>] </span>]

  761. </pre><p>

  762. 

  763.    where

  764.    <em class="replaceable"><code>interval_start</code></em> is the start of the interval (as a Unix

  765.    epoch time stamp),

  766.    <em class="replaceable"><code>num_transactions</code></em> is the number of transactions

  767.    within the interval,

  768.    <em class="replaceable"><code>sum_latency</code></em> is the sum of the transaction

  769.    latencies within the interval,

  770.    <em class="replaceable"><code>sum_latency_2</code></em> is the sum of squares of the

  771.    transaction latencies within the interval,

  772.    <em class="replaceable"><code>min_latency</code></em> is the minimum latency within the interval,

  773.    and

  774.    <em class="replaceable"><code>max_latency</code></em> is the maximum latency within the interval.

  775.    The next fields,

  776.    <em class="replaceable"><code>sum_lag</code></em>, <em class="replaceable"><code>sum_lag_2</code></em>, <em class="replaceable"><code>min_lag</code></em>,

  777.    and <em class="replaceable"><code>max_lag</code></em>, are only present if the <code class="option">--rate</code>

  778.    option is used.

  779.    They provide statistics about the time each transaction had to wait for the

  780.    previous one to finish, i.e. the difference between each transaction's

  781.    scheduled start time and the time it actually started.

  782.    The very last field, <em class="replaceable"><code>skipped</code></em>,

  783.    is only present if the <code class="option">--latency-limit</code> option is used, too.

  784.    It counts the number of transactions skipped because they would have

  785.    started too late.

  786.    Each transaction is counted in the interval when it was committed.

  787.   </p><p>

  788.    Here is some example output:

  789. </p><pre class="screen">

  790. 1345828501 5601 1542744 483552416 61 2573

  791. 1345828503 7884 1979812 565806736 60 1479

  792. 1345828505 7208 1979422 567277552 59 1391

  793. 1345828507 7685 1980268 569784714 60 1398

  794. 1345828509 7073 1979779 573489941 236 1411

  795. </pre><p>

  796.    Notice that while the plain (unaggregated) log file shows which script

  797.    was used for each transaction, the aggregated log does not. Therefore if

  798.    you need per-script data, you need to aggregate the data on your own.

  799.   </p></div><div class="refsect2" id="id-1.9.4.10.9.8"><h3>Per-Statement Latencies</h3><p>

  800.    With the <code class="option">-r</code> option, <span class="application">pgbench</span> collects

  801.    the elapsed transaction time of each statement executed by every

  802.    client.  It then reports an average of those values, referred to

  803.    as the latency for each statement, after the benchmark has finished.

  804.   </p><p>

  805.    For the default script, the output will look similar to this:

  806. </p><pre class="screen">

  807. starting vacuum...end.

  808. transaction type: &lt;builtin: TPC-B (sort of)&gt;

  809. scaling factor: 1

  810. query mode: simple

  811. number of clients: 10

  812. number of threads: 1

  813. number of transactions per client: 1000

  814. number of transactions actually processed: 10000/10000

  815. latency average = 15.844 ms

  816. latency stddev = 2.715 ms

  817. tps = 618.764555 (including connections establishing)

  818. tps = 622.977698 (excluding connections establishing)

  819. statement latencies in milliseconds:

  820.         0.002  \set aid random(1, 100000 * :scale)

  821.         0.005  \set bid random(1, 1 * :scale)

  822.         0.002  \set tid random(1, 10 * :scale)

  823.         0.001  \set delta random(-5000, 5000)

  824.         0.326  BEGIN;

  825.         0.603  UPDATE pgbench_accounts SET abalance = abalance + :delta WHERE aid = :aid;

  826.         0.454  SELECT abalance FROM pgbench_accounts WHERE aid = :aid;

  827.         5.528  UPDATE pgbench_tellers SET tbalance = tbalance + :delta WHERE tid = :tid;

  828.         7.335  UPDATE pgbench_branches SET bbalance = bbalance + :delta WHERE bid = :bid;

  829.         0.371  INSERT INTO pgbench_history (tid, bid, aid, delta, mtime) VALUES (:tid, :bid, :aid, :delta, CURRENT_TIMESTAMP);

  830.         1.212  END;

  831. </pre><p>

  832.   </p><p>

  833.    If multiple script files are specified, the averages are reported

  834.    separately for each script file.

  835.   </p><p>

  836.    Note that collecting the additional timing information needed for

  837.    per-statement latency computation adds some overhead.  This will slow

  838.    average execution speed and lower the computed TPS.  The amount

  839.    of slowdown varies significantly depending on platform and hardware.

  840.    Comparing average TPS values with and without latency reporting enabled

  841.    is a good way to measure if the timing overhead is significant.

  842.   </p></div><div class="refsect2" id="id-1.9.4.10.9.9"><h3>Good Practices</h3><p>

  843.    It is very easy to use <span class="application">pgbench</span> to produce completely

  844.    meaningless numbers.  Here are some guidelines to help you get useful

  845.    results.

  846.   </p><p>

  847.    In the first place, <span class="emphasis"><em>never</em></span> believe any test that runs

  848.    for only a few seconds.  Use the <code class="option">-t</code> or <code class="option">-T</code> option

  849.    to make the run last at least a few minutes, so as to average out noise.

  850.    In some cases you could need hours to get numbers that are reproducible.

  851.    It's a good idea to try the test run a few times, to find out if your

  852.    numbers are reproducible or not.

  853.   </p><p>

  854.    For the default TPC-B-like test scenario, the initialization scale factor

  855.    (<code class="option">-s</code>) should be at least as large as the largest number of

  856.    clients you intend to test (<code class="option">-c</code>); else you'll mostly be

  857.    measuring update contention.  There are only <code class="option">-s</code> rows in

  858.    the <code class="structname">pgbench_branches</code> table, and every transaction wants to

  859.    update one of them, so <code class="option">-c</code> values in excess of <code class="option">-s</code>

  860.    will undoubtedly result in lots of transactions blocked waiting for

  861.    other transactions.

  862.   </p><p>

  863.    The default test scenario is also quite sensitive to how long it's been

  864.    since the tables were initialized: accumulation of dead rows and dead space

  865.    in the tables changes the results.  To understand the results you must keep

  866.    track of the total number of updates and when vacuuming happens.  If

  867.    autovacuum is enabled it can result in unpredictable changes in measured

  868.    performance.

  869.   </p><p>

  870.    A limitation of <span class="application">pgbench</span> is that it can itself become

  871.    the bottleneck when trying to test a large number of client sessions.

  872.    This can be alleviated by running <span class="application">pgbench</span> on a different

  873.    machine from the database server, although low network latency will be

  874.    essential.  It might even be useful to run several <span class="application">pgbench</span>

  875.    instances concurrently, on several client machines, against the same

  876.    database server.

  877.   </p></div><div class="refsect2" id="id-1.9.4.10.9.10"><h3>Security</h3><p>

  878.     If untrusted users have access to a database that has not adopted a

  879.     <a class="link" href="ddl-schemas.html#DDL-SCHEMAS-PATTERNS" title="5.9.6. Usage Patterns">secure schema usage pattern</a>,

  880.     do not run <span class="application">pgbench</span> in that

  881.     database.  <span class="application">pgbench</span> uses unqualified names and

  882.     does not manipulate the search path.

  883.   </p></div></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="app-pgbasebackup.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="reference-client.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="app-pgconfig.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">pg_basebackup </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> pg_config</td></tr></table></div></body></html>
上海开阖软件有限公司 沪ICP备12045867号-1