ibm-information-center/dist/eclipse/plugins/i5OS.ic.rzajq_5.4.0.1/rzajqpagesize.htm

62 lines
4.6 KiB
HTML

<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html
PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html lang="en-us" xml:lang="en-us">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta name="security" content="public" />
<meta name="Robots" content="index,follow" />
<meta http-equiv="PICS-Label" content='(PICS-1.1 "http://www.icra.org/ratingsv02.html" l gen true r (cz 1 lz 1 nz 1 oz 1 vz 1) "http://www.rsac.org/ratingsv01.html" l gen true r (n 0 s 0 v 0 l 0) "http://www.classify.org/safesurf/" l gen true r (SS~~000 1))' />
<meta name="DC.Type" content="concept" />
<meta name="DC.Title" content="Specifying PAGESIZE on CRTPF or CRTLF commands" />
<meta name="abstract" content="When creating keyed files or indexes using the Create Physical File (CRTPF) or Create Logical File (CRTLF) commands, or the SQL CREATE INDEX statement, you can use the PAGESIZE parameter to specify the access path logical page size that is used by the system when the access path is created." />
<meta name="description" content="When creating keyed files or indexes using the Create Physical File (CRTPF) or Create Logical File (CRTLF) commands, or the SQL CREATE INDEX statement, you can use the PAGESIZE parameter to specify the access path logical page size that is used by the system when the access path is created." />
<meta name="DC.Relation" scheme="URI" content="rzajqbinary.htm" />
<meta name="DC.Relation" scheme="URI" content="../cl/crtlf.htm" />
<meta name="DC.Relation" scheme="URI" content="../cl/crtpf.htm" />
<meta name="DC.Relation" scheme="URI" content="../db2/rbafzmstxcindx.htm" />
<meta name="copyright" content="(C) Copyright IBM Corporation 1998, 2006" />
<meta name="DC.Rights.Owner" content="(C) Copyright IBM Corporation 1998, 2006" />
<meta name="DC.Format" content="XHTML" />
<meta name="DC.Identifier" content="rzahgpagesize" />
<meta name="DC.Language" content="en-us" />
<!-- All rights reserved. Licensed Materials Property of IBM -->
<!-- US Government Users Restricted Rights -->
<!-- Use, duplication or disclosure restricted by -->
<!-- GSA ADP Schedule Contract with IBM Corp. -->
<link rel="stylesheet" type="text/css" href="./ibmdita.css" />
<link rel="stylesheet" type="text/css" href="./ic.css" />
<title>Specifying PAGESIZE on CRTPF or CRTLF commands</title>
</head>
<body id="rzahgpagesize"><a name="rzahgpagesize"><!-- --></a>
<!-- Java sync-link --><script language="Javascript" src="../rzahg/synch.js" type="text/javascript"></script>
<h1 class="topictitle1">Specifying PAGESIZE on CRTPF or CRTLF commands</h1>
<div><p>When creating keyed files or indexes using the <span class="cmdname">Create
Physical File (CRTPF)</span> or <span class="cmdname">Create Logical File (CRTLF)</span> commands,
or the SQL CREATE INDEX statement, you can use the PAGESIZE parameter to specify
the access path logical page size that is used by the system when the access
path is created.</p>
<p>This logical page size is the amount of bytes of the access path that can
be moved into the job's storage pool from the auxiliary storage for a page
fault.</p>
<p>You should consider using the default of *KEYLEN for this parameter except
in rare circumstances so that the page size can be determined by the system
based on the total length of the key, or keys. When the access path is used
by very selective queries (for example, individual key look up), a smaller
page size is typically more efficient. Also, when the keys being selected
by queries are grouped together in the access path and many records are being
selected, or the access path is being scanned, a larger page size is typically
more efficient.</p>
</div>
<div>
<div class="familylinks">
<div class="parentlink"><strong>Parent topic:</strong> <a href="rzajqbinary.htm" title="A radix index is a multilevel, hybrid tree structure that allows a large number of key values to be stored efficiently while minimizing access times. A key compression algorithm assists in this process. The lowest level of the tree contains the leaf nodes, which contain the address of the rows in the base table that are associated with the key value. The key value is used to quickly navigator to the leaf node with a few simple binary search tests.">Binary radix indexes</a></div>
</div>
<div class="relinfo"><strong>Related information</strong><br />
<div><a href="../cl/crtlf.htm">Create Logical File (CRTLF) command</a></div>
<div><a href="../cl/crtpf.htm">Create Physical File (CRTPF) command</a></div>
<div><a href="../db2/rbafzmstxcindx.htm">SQL Create Index statement</a></div>
</div>
</div>
</body>
</html>