02.05.2013 Views

SAS(R) 9.1.3 Companion for z/OS

SAS(R) 9.1.3 Companion for z/OS

SAS(R) 9.1.3 Companion for z/OS

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

R<br />

Using <strong>SAS</strong> Data Libraries Sequential Access Bound Libraries 45<br />

libname seqdisk tape ’user489.seqdisk.saslib’ disp=(new,catlg)<br />

unit=(3390,3) space=(cyl,(200,200)) blksize=27998;<br />

data seqdisk.memb01;<br />

...<br />

Note:<br />

3 To ensure the most complete use of the DASD track, specify the optimum<br />

half-track BLKSIZE <strong>for</strong> the type of disk device used. For sequential access bound<br />

libraries, this must be specified on the DD or LIBNAME statement. The <strong>SAS</strong><br />

BLKSIZE system options are not used <strong>for</strong> sequential access bound libraries.<br />

3 The maximum number of disk volumes to which the library data set can extend is<br />

governed by the unit count in the examples above.<br />

3 Sequential access bound libraries can reside in extended <strong>for</strong>mat sequential data<br />

sets. Extended <strong>for</strong>mat sequential data sets can be defined as compressed by SMS,<br />

and they can also occupy more than 64K tracks per volume.<br />

General Usage Notes<br />

3 Due to the nature of sequential devices, <strong>SAS</strong> allows only two types of operations<br />

with members of a sequential bound library: reading an existing member and<br />

writing a new copy of a member to the library. The following types of operations<br />

are not supported <strong>for</strong> sequential access bound libraries:<br />

3 having multiple members in the library open at the same time<br />

3 updating the contents or attributes of a member of the library<br />

3 renaming or deleting a member of the library.<br />

3 When the FILEDISP=NEW data set option is specified <strong>for</strong> a member to be written<br />

to a sequential access bound library, <strong>SAS</strong> will replace all of the members that<br />

previously existed in the library, even if they were protected by an ALTER<br />

password. The ALTER password is not checked even <strong>for</strong> the member being<br />

replaced.<br />

3 When the COPY procedure is used to write members to a sequential access bound<br />

library, the rules regarding member replacement (listed above) apply only to the<br />

first member being processed by a COPY statement or PROC COPY invocation.<br />

All other members involved in the COPY operation are appended to the end of the<br />

library data even if they already exist in the library. There<strong>for</strong>e, it is possible to<br />

cause a library to contain two copies of the member, only the first of which will be<br />

recognized. You should plan all COPY operations carefully so that you avoid this<br />

outcome.<br />

3 <strong>SAS</strong> locates members of sequential access bound libraries by sequentially scanning<br />

the library from the current location (usually the beginning of the library data set)<br />

until the member is located. To avoid the excessive I/O that could occur with this<br />

type of operation, members of these libraries, that will be repeatedly accessed in a<br />

<strong>SAS</strong> job/session, should be first copied to a BASE engine library and then copied<br />

from the BASE engine library to the sequential access bound library in one PROC<br />

COPY operation. This is particularly important when appending to large<br />

multivolume tape libraries.<br />

3 When adding members to an existing sequential access bound library on tape, <strong>SAS</strong><br />

can read the library to determine which engine <strong>for</strong>mat to use. However,<br />

determining the engine <strong>for</strong>mat requires an extra tape mount if the library is<br />

internally assigned. By explicitly specifying the engine, you can avoid this extra<br />

tape mount.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!