Bitmaps (File architecture): Difference between revisions

Latest revision as of 20:43, 15 January 2015

A bitmap, as the name implies, is a series of "on" and "off" bits which are used to track a condition. These maps are used extensively throughout Model 204 to track sets of records or pages.

The workings of a bitmap

The page size in Model 204 of 6184 bytes contains 6144 "usable" bytes (along with its 40 byte trailer). As such, conditions of up to 49152 "things" (usually records but also pages) can be tracked on a single page.

Usages

The most common use of bitmaps in Model 204 is to track sets of records:

Bitmaps track records inside both indexing types (hash and B-tree).
The existence bitmap tracks which internal record numbers are in use.
During procedure execution, all found sets are held as bitmaps.

And, for Table E non-FILEORG X'100' files, large object available pages are tracked as well.

Manipulating bitmaps

Once conditions are represented as bitmaps, the manipulation ("ANDing" and "ORing") of these sets is straightforward and efficient:

In code that has a Find such as:

X: In filename FD COLOR = 'BLUE' STATE = 'NY' ...

What is happening (given the implied "AND") is that the sets of records for each criteria are retrieved, and then "ANDed" (any bits "on" on both, are "on" on the resultant bitmap associated with the label X.

Example

This example looks at a bitmap as used by an index. It shows the beginning of the bitmap representing the ORD CHAR field value pair COLOR=BLUE for the third segment of a file (which covers IRNs 98304 to 147455):

Based on this, record 98304 does not have an occurrence of COLOR=BLUE, but records 98305 and 98306 do. And so on.

@@ Line 1: / Line 1: @@
-<p>A Bit Map, as the name implies, is a series of on and off bits which are used to track a condition. These maps are used extensively throughout Model 204 to track sets of records or pages.</p>
+<p>
+A bitmap, as the name implies, is a series of "on" and "off" bits which are used to track a condition. These maps are used extensively throughout Model 204 to track sets of records or pages.</p>
+==The workings of a bitmap==
+<p>
+The [[Page (File architecture)|page]] size in Model 204 of 6184 bytes contains 6144 "usable" bytes (along with its 40 byte trailer). As such, conditions of up to 49152 "things" (usually records but also pages) can be tracked on a single page.</p>
-== The Workings of a Bit Map ==
+==Usages==
+The most common use of bitmaps in Model 204 is to track sets of records:
+<ul>
-<p>The [[Page (File Architecture)|page]] size in Model 204 of 6184 bytes contains 6144 'usable' bytes (along with its 40 byte trailer). As such conditions of up to 49152 'things' (usually records but also pages) can be tracked on a single page.</p>
+<li>Bitmaps track records inside both indexing types (hash and B-tree). </li>
-== Usages ==
+<li>The [[Table D (File architecture)#Existence bitmap|existence bitmap]] tracks which internal record numbers are in use. </li>
-The most common use in Model 204 is to track sets of records:
+<li>During procedure execution, all found sets are held as bitmaps. </li>
+</ul>
-* Inside both indexing types (hash and B-tree) bit maps are used
+And, for [[Table E and non-FILEORG X'100' files (File architecture)|Table E non-FILEORG X'100']] files, large object available pages are tracked as well.
-* The [[#Table D (File Architecture) Existence Bit Map|Existence Bit Map]] which tracks which records are in use.
-* During procedure execution, all found sets are held as bit maps
-And, for [[Table E non x'100' (File Architecture)|Table E non FILEORG x'100']] files, large object available pages are tracked as well.
+==Manipulating bitmaps==
+Once conditions are represented as bitmaps, the manipulation ("ANDing" and "ORing") of these sets is straightforward and efficient:
+In code that has a <var>Find</var> such as:
-== Manipulating Bit Maps ==
+<p class="code">X: In ''filename'' FD COLOR = 'BLUE'
-Once you have conditions represented as bitmaps, the manipulation ('anding' and 'oring') of these sets is straightforward and efficient:
-In code which has a find such as:
-<p class="code">
-X: In ''filename'' FD COLOR = 'BLUE'
                    STATE = 'NY' ...
 </p>
+<p>
+What is happening (given the implied "AND") is that the sets of records for each criteria are retrieved, and then "ANDed" (any bits "on" on both, are "on" on the resultant bitmap associated with the label <code>X</code>. </p>
-<p>What is happening (given the implied 'and') is that the sets of records for each criteria are retrieved, and then 'anded' (any bits 'on' on both, are 'on' on the resultant bitmap associated with the label 'X'. </p>
+==Example==
+<p>
+This example looks at a bitmap as used by an index. It shows the beginning of the bitmap representing the <var>ORD CHAR</var> field value pair <code>COLOR=BLUE</code> for the third segment of a file (which covers [[#Internal Record Number|IRNs]] 98304 to 147455):</p>
-== Example ==
-<p>In this example (which looks at a bit map as used by an index), this is the beginning of the bit map representing the ORD CHAR field value pair ''COLOR = BLUE'' for the 3rd segment of a file (which covers [[#Internal Record Number|IRNs]] 98304 to 147455).</p>
-:::[[File:Bit Map Example (File Architecture).jpg]]
-Based in this, record 98304 does not have an occurrence of ''COLOR = BLUE'', but records 98305 and 98306 do... and so on.
+<p class="figure">[[File:Bit Map Example (File Architecture).jpg|border]] </p>
+Based on this, record 98304 does not have an occurrence of <code>COLOR=BLUE</code>, but records 98305 and 98306 do. And so on.
-[[Category:File architecture and Management]]
 [[Category:File architecture]]