79 lines
6.0 KiB
HTML
79 lines
6.0 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="Binary radix indexes" />
|
||
|
|
<meta name="abstract" content="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." />
|
||
|
|
<meta name="description" content="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." />
|
||
|
|
<meta name="DC.subject" content="index, binary radix index, definitions" />
|
||
|
|
<meta name="keywords" content="index, binary radix index, definitions" />
|
||
|
|
<meta name="DC.Relation" scheme="URI" content="efindex.htm" />
|
||
|
|
<meta name="DC.Relation" scheme="URI" content="rzajqpagesize.htm" />
|
||
|
|
<meta name="DC.Relation" scheme="URI" content="genidxmaint.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="rzajqbinary" />
|
||
|
|
<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>Binary radix indexes</title>
|
||
|
|
</head>
|
||
|
|
<body id="rzajqbinary"><a name="rzajqbinary"><!-- --></a>
|
||
|
|
<img src="./delta.gif" alt="Start of change" /><!-- Java sync-link --><script language="Javascript" src="../rzahg/synch.js" type="text/javascript"></script>
|
||
|
|
<h1 class="topictitle1">Binary radix indexes</h1>
|
||
|
|
<div><p>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.</p>
|
||
|
|
<p>The binary radix tree structure is very good for finding a small number
|
||
|
|
of rows because it is able to find a given row with a minimal amount of processing.
|
||
|
|
For example, using a binary radix index over a customer number column for
|
||
|
|
a typical OLTP request like "find the outstanding orders for a single customer:
|
||
|
|
will result in fast performance. An index created over the customer number
|
||
|
|
column is considered to be the perfect index for this type of query because
|
||
|
|
it allows the database to zero in on the rows it needs and perform a minimal
|
||
|
|
number of I/Os.</p>
|
||
|
|
<p>In some situations, however, you do not always have the same level of predictability.
|
||
|
|
Increasingly, users want ad hoc access to the detail data. They might for
|
||
|
|
example, run a report every week to look at sales data, then "drill down"
|
||
|
|
for more information related to a particular problem areas that they found
|
||
|
|
in the report. In this scenario, you cannot write all of the queries in advance
|
||
|
|
on behalf of the end users. Without knowing what queries will be run, it is
|
||
|
|
impossible to build the perfect index.</p>
|
||
|
|
</div>
|
||
|
|
<div>
|
||
|
|
<ul class="ullinks">
|
||
|
|
<li class="ulchildlink"><strong><a href="rzajqpagesize.htm">Specifying PAGESIZE on CRTPF or CRTLF commands</a></strong><br />
|
||
|
|
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.</li>
|
||
|
|
<li class="ulchildlink"><strong><a href="genidxmaint.htm">General index maintenance</a></strong><br />
|
||
|
|
Whenever indexes are created and used, there is a potential for a decrease in I/O velocity due to maintenance, therefore, you should consider the maintenance cost of creating and using additional indexes. For radix indexes with MAINT(*IMMED) maintenance occurs when inserting, updating or deleting rows.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<div class="familylinks">
|
||
|
|
<div class="parentlink"><strong>Parent topic:</strong> <a href="efindex.htm" title="DB2 Universal Database for iSeries provides two basic means for accessing tables: a table scan and an index-based retrieval. Index-based retrieval is typically more efficient than table scan when less than 20% of the table rows are selected.">Creating an index strategy</a></div>
|
||
|
|
</div>
|
||
|
|
<div class="relinfo"><strong>Related information</strong><br />
|
||
|
|
<div><a href="../db2/rbafzmstxcindx.htm">SQL Create Index statement</a></div>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<img src="./deltaend.gif" alt="End of change" /></body>
|
||
|
|
</html>
|